{'fraction_non_alphanumeric': 0.018811136192626036, 'fraction_numerical': 0.0, 'mean_word_length': 5.456310679611651, '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}}
Large‐margin classification with multiple decision rules

Binary classification is a common statistical learning problem in which a model is estimated on a set of covariates for some outcome, indicating the membership of one of two classes. In the literature, there exists a distinction between hard and soft classification. In soft classification, the conditional class probability is modeled as a function of the covariates. In contrast, hard classification methods only target the optimal prediction boundary. While hard and soft classification methods have been studied extensively, not much work has been performed to compare the actual tasks of hard and soft classification. In this paper, we propose a spectrum of statistical learning problems that span the hard and soft classification tasks based on fitting multiple decision rules to the data. By doing so, we reveal a novel collection of learning tasks of increasing complexity. We study the problems using the framework of large‐margin classifiers and a class of piecewise linear convex surrogates, for which we derive statistical properties and a corresponding sub‐gradient descent algorithm. We conclude by applying our approach to simulation settings and a magnetic resonance imaging (MRI) dataset from the Alzheimer's Disease Neuroimaging Initiative (ADNI) study.