Margin Maximization as Lossless Maximal Compression

Abstract

The ultimate goal of a supervised learning algorithm is to produce models constructed on the training data that can generalize well to new examples. In classification, functional margin maximization -- correctly classifying as many training examples as possible with maximal confidence --has been known to construct models with good generalization guarantees. This work gives an information-theoretic interpretation of a margin maximizing model on a noiseless training dataset as one that achieves lossless maximal compression of said dataset -- i.e. extracts from the features all the useful information for predicting the label and no more. The connection offers new insights on generalization in supervised machine learning, showing margin maximization as a special case (that of classification) of a more general principle and explains the success and potential limitations of popular learning algorithms like gradient boosting. We support our observations with theoretical arguments and empirical evidence and identify interesting directions for future work.

19 pages Main Paper + 7 pages Supplementary Material, 7 Figures, Submitted to the Machine Learning journal (11/11/19)

References in corpus (6)

• The information bottleneck method
• Opening the Black Box of Deep Neural Networks via Information
• Deep Variational Information Bottleneck
• Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data
• On the Dual Formulation of Boosting Algorithms
• Boosting in the presence of label noise