arXiv:2607. 07735v1 Announce Type: cross Abstract: Sparse precision matrix estimation provides an interpretable and computationally efficient framework for modeling conditional dependencies in high-dimensional, low-sample-size data.
By Aryan Eftekhari, Daniel Sergio Vega, Ernst-Jan Camiel Wit, Olaf Schenk
arXiv:2306. 14851v5 Announce Type: replace-cross Abstract: Given a high-dimensional covariate matrix and a response vector, ridge-regularized sparse linear regression selects a subset of features that explains the relationship between covariates and the response in an interpretable manner.
By Ryan Cory-Wright, Andr\'es G\'omez
The paper introduces a two‑stage method for estimating sparse high‑dimensional partial correlation matrices and inverse covariance matrices with non‑asymptotic guarantees. It leverages the link between inverse covariance and linear regression while ensuring positive semi‑definiteness, and provides an efficient proximal splitting algorithm for computation. The authors demonstrate the method’s effectiveness on synthetic and real‑world datasets.
By Samuel Erickson, Tobias Ryd\'en
arXiv:2610.33957v1 Announce Type: cross
Abstract: We propose a joint sparse sample weighting and parameter estimation (SWAPE) framework that jointly optimizes model parameters and sample weights to t...
By Hassan Nojavan, Chul Moon, Miju Ahn
The paper introduces an online generalized-sparsity-constrained regression framework that addresses key challenges in online sparse regression, such as dynamic regularization, memory usage, and real-time computation. It proposes an efficient online hard‑thresholding algorithm that performs closed‑form updates using only summary statistics, achieving global convergence at optimal statistical rates when the projection set is overparameterized. Numerical experiments show the method consistently outperforms existing alternatives in online cardinality‑constrained linear regression and low‑rank matrix sensing.
By Shuoguang Yang, Qiang Sun
The paper studies the numerical solution of the Beurling‑LASSO (BLASSO) for estimating Gaussian mixture models (GMMs) with unknown numbers of components and unknown diagonal covariance matrices. It introduces a Conic Particle Gradient Descent (CPGD) algorithm that incorporates Riemannian gradient descent to respect the Fisher‑Rao geometry of Gaussian distributions. The authors provide theoretical convergence guarantees, including exponential local convergence under a non‑degeneracy condition related to component separation, and demonstrate through numerical experiments that CPGD is more robust to overspecification of components than the EM algorithm.
By Romane Giard, Yohann De Castro, Roland Denis, Cl\'ement Marteau