English
Related papers

Related papers: Lasso, fractional norm and structured sparse estim…

200 papers

Quantile regression is studied in combination with a penalty which promotes structured (or group) sparsity. A mixed $\ell_{1,\infty}$-norm on the parameter vector is used to impose structured sparsity on the traditional quantile regression…

Methodology · Statistics 2013-02-26 Vahid Nassiri , Ignace Loris

Sparse linear regression -- finding an unknown vector from linear measurements -- is now known to be possible with fewer samples than variables, via methods like the LASSO. We consider the multiple sparse linear regression problem, where…

Machine Learning · Computer Science 2012-02-28 Ali Jalali , Pradeep Ravikumar , Sujay Sanghavi

Covariance regression offers an effective way to model the large covariance matrix with the auxiliary similarity matrices. In this work, we propose a sparse covariance regression (SCR) approach to handle the potentially high-dimensional…

Methodology · Statistics 2024-10-17 Yuan Gao , Zhiyuan Zhang , Zhanrui Cai , Xuening Zhu , Tao Zou , Hansheng Wang

We consider the problem of non-parametric regression with a potentially large number of covariates. We propose a convex, penalized estimation framework that is particularly well-suited for high-dimensional sparse additive models. The…

Methodology · Statistics 2019-06-19 Asad Haris , Ali Shojaie , Noah Simon

We study the problem of learning a sparse linear regression vector under additional conditions on the structure of its sparsity pattern. This problem is relevant in machine learning, statistics and signal processing. It is well known that a…

Machine Learning · Statistics 2015-03-17 Charles A. Micchelli , Jean M. Morales , Massimiliano Pontil

We present a new approach to solve the sparse approximation or best subset selection problem, namely find a $k$-sparse vector ${\bf x}\in\mathbb{R}^d$ that minimizes the $\ell_2$ residual $\lVert A{\bf x}-{\bf y} \rVert_2$. We consider a…

Machine Learning · Computer Science 2021-06-21 Tal Amir , Ronen Basri , Boaz Nadler

Regularized regression has become very popular nowadays, particularly on high-dimensional problems where the addition of a penalty term to the log-likelihood allows inference where traditional methods fail. A number of penalties have been…

Methodology · Statistics 2021-02-15 Hamed Haselimashhadi , Veronica Vinciotti

The elastic net penalty is frequently employed in high-dimensional statistics for parameter regression and variable selection. It is particularly beneficial compared to lasso when the number of predictors greatly surpasses the number of…

Machine Learning · Statistics 2024-12-06 Yanyun Ding , Zhenghua Yao , Peili Li , Yunhai Xiao

We compare alternative computing strategies for solving the constrained lasso problem. As its name suggests, the constrained lasso extends the widely-used lasso to handle linear constraints, which allow the user to incorporate prior…

Machine Learning · Statistics 2016-11-08 Brian R. Gaines , Hua Zhou

Regularized regression approaches such as the Lasso have been widely adopted for constructing sparse linear models in high-dimensional datasets. A complexity in fitting these models is the tuning of the parameters which control the level of…

Methodology · Statistics 2019-03-12 Ellis Patrick , Samuel Mueller

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

The paper focuses on the automatic selection of the grouped explanatory variables in an high-dimensional model, when the model errors are asymmetric. After introducing the model and notations, we define the adaptive group LASSO expectile…

Statistics Theory · Mathematics 2022-03-14 Angelo Alcaraz , Gabriela Ciuperca

The paper proposes a new covariance estimator for large covariance matrices when the variables have a natural ordering. Using the Cholesky decomposition of the inverse, we impose a banded structure on the Cholesky factor, and select the…

Applications · Statistics 2008-12-18 Elizaveta Levina , Adam Rothman , Ji Zhu

Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection but numerous extensions have now emerged such as structured sparsity or kernel…

Machine Learning · Computer Science 2011-11-24 Francis Bach , Rodolphe Jenatton , Julien Mairal , Guillaume Obozinski

Penalized estimation principle is fundamental to high-dimensional problems. In the literature, it has been extensively and successfully applied to various models with only structural parameters. As a contrast, in this paper, we apply this…

Statistics Theory · Mathematics 2017-08-03 Jianqing Fan , Runlong Tang , Xiaofeng Shi

Penalized logistic regression is extremely useful for binary classification with large number of covariates (higher than the sample size), having several real life applications, including genomic disease classification. However, the…

Methodology · Statistics 2023-04-10 Ayanendranath Basu , Abhik Ghosh , María Jaenada , Leandro Pardo

The ordinary least squares estimate in linear regression is sensitive to the influence of errors with large variance, which reduces its robustness, especially when dealing with heavy-tailed errors or outliers frequently encountered in…

Methodology · Statistics 2025-05-01 Mengjiao Shi , Yunhai Xiao

In many scientific studies, it becomes increasingly important to delineate the causal pathways through a large number of mediators, such as genetic and brain mediators. Structural equation modeling (SEM) is a popular technique to estimate…

Machine Learning · Statistics 2016-03-28 Yi Zhao , Xi Luo

We present a novel approach to the formulation and the resolution of sparse Linear Discriminant Analysis (LDA). Our proposal, is based on penalized Optimal Scoring. It has an exact equivalence with penalized LDA, contrary to the multi-class…

Machine Learning · Computer Science 2012-07-03 Luis Francisco Sanchez Merchante , Yves Grandvalet , Gerrad Govaert

Modern statistical learning algorithms are capable of amazing flexibility, but struggle with interpretability. One possible solution is sparsity: making inference such that many of the parameters are estimated as being identically 0, which…

Methodology · Statistics 2023-05-15 Nathan Wycoff , Ali Arab , Katharine M. Donato , Lisa O. Singh