English
Related papers

Related papers: LASSO reloaded: a variational analysis perspective…

200 papers

The lasso is a popular tool for sparse linear regression, especially for problems in which the number of variables p exceeds the number of observations n. But when p>n, the lasso criterion is not strictly convex, and hence it may not have a…

Statistics Theory · Mathematics 2012-11-06 Ryan J. Tibshirani

The tuning parameter selection strategy for penalized estimation is crucial to identify a model that is both interpretable and predictive. However, popular strategies (e.g., minimizing average squared prediction error via cross-validation)…

Methodology · Statistics 2022-11-10 Julia Holter , Jonathan Stallrich

The paper concerns foundations of sensitivity and stability analysis in optimization and related areas, being primarily addressed truncated constrained systems. We consider general models, which are described by multifunctions between…

Optimization and Control · Mathematics 2025-04-30 Boris S. Mordukhovich , Pengcheng Wu , Xiaoqi Yang

This paper deals with the problem of accurately determining guaranteed suboptimal values of an unknown cost function on the basis of noisy measurements. We consider a set-valued variant to regression where, instead of finding a best…

Optimization and Control · Mathematics 2024-07-29 Jaap Eising , Jorge Cortes

In this paper, we consider a compressed sensing problem of reconstructing a sparse signal from an undersampled set of noisy linear measurements. The regularized least squares or least absolute shrinkage and selection operator (LASSO)…

Information Theory · Computer Science 2014-10-30 Chao-Kai Wen , Jun Zhang , Kai-Kit Wong , Jung-Chieh Chen , Chau Yuen

In this paper we look at a well known linear inverse problem that is one of the mathematical cornerstones of the compressed sensing field. In seminal works \cite{CRT,DOnoho06CS} $\ell_1$ optimization and its success when used for recovering…

Information Theory · Computer Science 2015-07-17 Mihailo Stojnic

Quantifying uncertainty in high-dimensional sparse linear regression is a fundamental task in statistics that arises in various applications. One of the most successful methods for quantifying uncertainty is the debiased LASSO, which has a…

Statistics Theory · Mathematics 2024-02-27 Pedro Abdalla , Gil Kur

In life sciences, the experts generally use empirical knowledge to recode variables, choose interactions and perform selection by classical approach. The aim of this work is to perform automatic learning algorithm for variables selection…

Machine Learning · Statistics 2015-11-05 Bienvenue Kouwayè , Noël Fonton , Fabrice Rossi

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

We present a smooth probabilistic reformulation of $\ell_0$ regularized regression that does not require Monte Carlo sampling and allows for the computation of exact gradients, facilitating rapid convergence to local optima of the best…

Machine Learning · Computer Science 2025-09-19 Lukas Silvester Barth , Paulo von Petersenn

Nowadays, l1 penalized likelihood has absorbed a high amount of consideration due to its simplicity and well developed theoretical properties. This method is known as a reliable method in order to apply in a broad range of applications…

Methodology · Statistics 2015-06-12 Hamed Haselimashhadi

We consider the most common variants of linear regression, including Ridge, Lasso and Support-vector regression, in a setting where the learner is allowed to observe only a fixed number of attributes of each example at training time. We…

Machine Learning · Computer Science 2015-03-19 Elad Hazan , Tomer Koren

We consider an important problem in signal processing, which consists in finding the sparsest solution of a linear system $\Phi x=b$. This problem has applications in several areas, but is NP-hard in general. Usually an alternative convex…

Optimization and Control · Mathematics 2019-06-25 Matías Valdés , Marcelo Fiori

Regression with the lasso penalty is a popular tool for performing dimension reduction when the number of covariates is large. In many applications of the lasso, like in genomics, covariates are subject to measurement error. We study the…

Methodology · Statistics 2017-01-04 Øystein Sørensen , Arnoldo Frigessi , Magne Thoresen

We propose two novel approaches to the recovery of an (approximately) sparse signal from noisy linear measurements in the case that the signal is a priori known to be non-negative and obey given linear equality constraints, such as simplex…

Information Theory · Computer Science 2015-06-17 Jeremy Vila , Philip Schniter

Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an $s$-sparse signal using $m \gtrsim s \log(d/s)$ measurements in a robust and stable way.…

Functional Analysis · Mathematics 2016-05-25 Axel Flinth

The Lasso is a prominent algorithm for variable selection. However, its instability in the presence of correlated variables in the high-dimensional setting is well-documented. Although previous research has attempted to address this issue…

Methodology · Statistics 2025-05-28 Mahdi Nouraie , Connor Smith , Samuel Muller

Additive isotonic regression attempts to determine the relationship between a multi-dimensional observation variable and a response, under the constraint that the estimate is the additive sum of univariate component effects that are…

Methodology · Statistics 2010-06-16 Zhou Fang , Nicolai Meinshausen

A multiple interval-valued linear regression model considering all the cross-relationships between the mids and spreads of the intervals has been introduced recently. A least-squares estimation of the regression parameters has been carried…

Statistics Theory · Mathematics 2016-02-09 Marta García Bárzana , Ana Colubi , Erricos John Kontoghiorghes

In this article we propose a method for solving unconstrained optimization problems with convex and Lipschitz continuous objective functions. By making use of the Moreau envelopes of the functions occurring in the objective, we smooth the…

Optimization and Control · Mathematics 2012-07-16 Radu Ioan Bot , Christopher Hendrich