Sparse Regression with Multi-type Regularized Feature Modeling
Sander Devriendt, Katrien Antonio, Tom Reynkens, Roel Verbelen

TL;DR
This paper introduces a novel multi-type regularization approach for sparse regression models, enabling tailored predictor selection and fusion across different predictor types with improved computational efficiency.
Contribution
It proposes a new multi-type Lasso penalty and an efficient estimation algorithm that avoids approximations, enhancing model accuracy and computational speed.
Findings
The SMuRF algorithm outperforms existing methods in accuracy.
Simulation studies demonstrate improved predictor selection.
Case study shows practical effectiveness in insurance pricing.
Abstract
Within the statistical and machine learning literature, regularization techniques are often used to construct sparse (predictive) models. Most regularization strategies only work for data where all predictors are treated identically, such as Lasso regression for (continuous) predictors treated as linear effects. However, many predictive problems involve different types of predictors and require a tailored regularization term. We propose a multi-type Lasso penalty that acts on the objective function as a sum of subpenalties, one for each type of predictor. As such, we allow for predictor selection and level fusion within a predictor in a data-driven way, simultaneous with the parameter estimation process. We develop a new estimation strategy for convex predictive models with this multi-type penalty. Using the theory of proximal operators, our estimation procedure is computationally…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
