OpenAlex ·
The Critical Line Algorithm and the Constrained LASSO: One Curve, Two Literatures
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.25704
- Original
- Read it at the publisher
- Topics
Abstract
Many statistical procedures compute an entire solution path rather than a single estimator. For one class the path is piecewise linear, traced corner to corner by an active-set homotopy. Two of its members coincide exactly: under $Σ=X^\top X$ and $μ=X^\top y$ the gross-exposure-constrained mean--variance program and the constrained LASSO trace the same piecewise-linear curve, and they keep doing so under arbitrary linear equality and inequality constraints. Which parameter is swept, a leverage budget or a return tilt, is not a choice the curve notices: under a homogeneous mandate the two sweeps differ by a scalar. A mandate that holds the portfolio invested costs a radial rescaling instead, and the efficient frontier is that curve rescaled; its corners pass unnoticed because the frontier is continuously differentiable where they fall. We give the map between the two parametrisations and the single way it degenerates. That mean--variance selection and the LASSO instantiate one parametric quadratic program is prior art (Gärtner, Jaggi and Maria, 2012). The Critical Line Algorithm itself lies off that route, and the correspondence established here is new. The identity is one of curves, not of statistical experiments. The map between the parametrisations is computed from the data, so the geometry of the path transfers while quantities averaged over the response do not. We cross that boundary deliberately and give the degrees of freedom of the constrained fit under arbitrary linear constraints. In the long-only, fully invested case it is the expected number of holdings away from a bound, less one.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Numerical Analysis
AURA: Angular Update Rate Adaptation for training complex-valued neural networks
KATOsuper: Surrogate-accelerated neural topology optimization with sensitivity-consistent Fourier neural operators
SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA
Sparse-Observation Atmospheric Thermal Forecasting with Physics-Informed Neural Networks for Climate-Aware Digital Twins
One-Step Generative Surrogate Models via Block-Triangular Joint Drifting
Get the few papers worth your time in Numerical Analysis every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.