On Coresets For Regularized Regression
Rachit Chhaya, Anirban Dasgupta, Supratim Shit

TL;DR
This paper investigates the impact of norm-based regularization on coreset sizes in regression problems, revealing limitations for certain regularizations and proposing a modified lasso with smaller coresets, supported by empirical results.
Contribution
It demonstrates that when regularization norms differ, coresets cannot be smaller than unregularized versions, and introduces a modified lasso with reduced coreset size.
Findings
Coreset size cannot be smaller than unregularized regression when r ≠ s.
Modified lasso achieves smaller coresets while maintaining sparsity.
Empirical results confirm improved coreset performance for the modified lasso and ℓ₁ regression.
Abstract
We study the effect of norm based regularization on the size of coresets for regression problems. Specifically, given a matrix with and a vector and , we analyze the size of coresets for regularized versions of regression of the form . Prior work has shown that for ridge regression (where ) we can obtain a coreset that is smaller than the coreset for the unregularized counterpart i.e. least squares regression (Avron et al). We show that when , no coreset for regularized regression can have size smaller than the optimal coreset of the unregularized version. The well known lasso problem falls under this category and hence does not allow a coreset smaller than the one for least squares regression. We propose a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Face and Expression Recognition · Stochastic Gradient Optimization Techniques
MethodsCoresets
