Research
L1 Regularization Paths in Linear Models by Parametric Gaussian Message Passing
arXiv:2604.16949v1 Announce Type: new Abstract: The paper considers the computation of L1 regularization paths in a state space setting, which includes L1 regularized Kalman smoothing, linear SVM, LAS
arXiv:2604.16949v1 Announce Type: new Abstract: The paper considers the computation of L1 regularization paths in a state space setting, which includes L1 regularized Kalman smoothing, linear SVM, LASSO, and more. The paper proposes two new algorithms, which are duals of each other; the first algorithm applies to L1 regularization of independent variables while the second applies to L1 regularization of dependent variables. The heart of the proposed algorithms is parametric Gaussian message passing (i.e., Kalman-type forward-backward recursions) in the pertinent factor graphs. The proposed methods are broadly applicable, they (usually) require only matrix multiplications, and their complexity can be competitive with prior methods in some cases.
Related
- Smoothing the Edges: Smooth Optimization for Sparse Regularization using Hadamard Overparametrization
- Optimal L2 Regularization in High-dimensional Continual Linear Regression
- Advancing Intelligent Sequence Modeling: Evolution, Trade-offs, and Applications of State- Space Architectures from S4 to Mamba
- On the Expressive Power and Limitations of Multi-Layer SSMs
Source: arXiv cs.LG | 2026-04-21