{'fraction_non_alphanumeric': 0.009569377990430622, 'fraction_numerical': 0.0, 'mean_word_length': 5.301204819277109, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Selective Sampling Based Efficient Classifier Representation in Distributed Learning

Communication is a bottleneck for many distributed machine learning problems with large data sets. One effective approach is to exchange the set of good classifiers among the learners. The key challenge in such an approach is how to represent the set of good classifiers, which can be viewed as a source coding problem in communication systems. A nonuniform sampling framework is proposed for this source coding problem. A metric that describes the quality of the sampled data for the target hypothesis space is proposed. An optimization problem is formulated by minimizing the upper bound of the proposed metric, and an efficient weight based algorithm is provided to solve the optimization problem. Numerical simulations on synthetic and real world data set show that the learning performance based on the proposed sampling framework is close to the global optimum with high confidence, while requiring less samples than baseline random sampling algorithms.