Training Data Subset Selection for Regression with Controlled Generalization Error

Abstract

Data subset selection from a large number of training instances has been a successful approach toward efficient and cost-effective machine learning. However, models trained on a smaller subset may show poor generalization ability. In this paper, our goal is to design an algorithm for selecting a subset of the training data, so that the model can be trained quickly, without significantly sacrificing on accuracy. More specifically, we focus on data subset selection for L2 regularized regression problems and provide a novel problem formulation which seeks to minimize the training loss with respect to both the trainable parameters and the subset of training data, subject to error bounds on the validation set. We tackle this problem using several technical innovations. First, we represent this problem with simplified constraints using the dual of the original training problem and show that the objective of this new representation is a monotone and alpha-submodular function, for a wide variety of modeling choices. Such properties lead us to develop SELCON, an efficient majorization-minimization algorithm for data subset selection, that admits an approximation guarantee even when the training provides an imperfect estimate of the trained model. Finally, our experiments on several datasets show that SELCON trades off accuracy and efficiency more effectively than the current state-of-the-art.

References in corpus (13)

• Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
• Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications
• Maximization of Approximately Submodular Functions
• Anchor regression: heterogeneous data meets causality
• Near-optimal Coresets For Least-Squares Regression
• Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
• Coresets for Data-efficient Training of Machine Learning Models
• Submodular Optimization under Noise
• Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
• Polyhedral aspects of Submodularity, Convexity and Concavity
• GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Training
• Non-submodular Function Maximization subject to a Matroid Constraint, with Applications
• Submodular Observation Selection and Information Gathering for Quadratic Models