English
Related papers

Related papers: Letter to the Editor

200 papers

Estimation in generalized linear models (GLM) is complicated by the presence of constraints. One can handle constraints by maximizing a penalized log-likelihood. Penalties such as the lasso are effective in high dimensions, but often lead…

Machine Learning · Statistics 2017-11-07 Jason Xu , Eric C. Chi , Kenneth Lange

The two primary approaches for high-dimensional regression problems are sparse methods (e.g., best subset selection, which uses the L0-norm in the penalty) and ensemble methods (e.g., random forests). Although sparse methods typically yield…

Methodology · Statistics 2024-10-31 Anthony-Alexander Christidis , Stefan Van Aelst , Ruben Zamar

Penalization schemes like Lasso or ridge regression are routinely used to regress a response of interest on a high-dimensional set of potential predictors. Despite being decisive, the question of the relative strength of penalization is…

Methodology · Statistics 2018-11-08 Britta Velten , Wolfgang Huber

A new reweighted l1-norm penalized least mean square (LMS) algorithm for sparse channel estimation is proposed and studied in this paper. Since standard LMS algorithm does not take into account the sparsity information about the channel…

Information Theory · Computer Science 2014-05-09 Omid Taheri , Sergiy A. Vorobyov

We present a novel binary convex reformulation of the sparse regression problem that constitutes a new duality perspective. We devise a new cutting plane method and provide evidence that it can solve to provable optimality the sparse…

Optimization and Control · Mathematics 2017-09-29 Dimitris Bertsimas , Bart Van Parys

Inferring network structures remains an interesting question for its importance on the understanding and controlling collective dynamics of complex systems. The existing shrinking methods such as Lasso-type estimation can not suitably…

Statistics Theory · Mathematics 2025-09-03 Lei Shi , Jie Hu , Huaiyu Tan , Libin Jin , Wei Zhong , Chen Shen

Despite its prevalence in statistical datasets, heteroscedasticity (non-constant sample variances) has been largely ignored in the high-dimensional statistics literature. Recently, studies have shown that the Lasso can accommodate…

Statistics Theory · Mathematics 2014-10-31 James Sharpnack , Mladen Kolar

Partial Least Squares (PLS) regression emerged as an alternative to ordinary least squares for addressing multicollinearity in a wide range of scientific applications. As multidimensional tensor data is becoming more widespread, tensor…

Methodology · Statistics 2024-10-11 Kwangmoon Park , Sündüz Keleş

In high-dimensional model selection problems, penalized simple least-square approaches have been extensively used. This paper addresses the question of both robustness and efficiency of penalized model selection methods, and proposes a…

Methodology · Statistics 2011-07-06 Jelena Bradic , Jianqing Fan , Weiwei Wang

The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation…

Information Theory · Computer Science 2014-07-24 Guan Gui , Li Xu , Fumiyuki Adachi

Recent work has focused on the problem of conducting linear regression when the number of covariates is very large, potentially greater than the sample size. To facilitate this, one useful tool is to assume that the model can be well…

Methodology · Statistics 2011-11-21 Zhou Fang

We present a novel approach to address the multi-agent sparse contextual linear bandit problem, in which the feature vectors have a high dimension $d$ whereas the reward function depends on only a limited set of features - precisely $s_0…

Machine Learning · Computer Science 2023-05-31 Haniyeh Barghi , Xiaotong Cheng , Setareh Maghsudi

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

This paper proposes a new interpretation of sparse penalties such as the elastic-net and the group-lasso. Beyond providing a new viewpoint on these penalization schemes, our approach results in a unified optimization strategy. Our…

Machine Learning · Statistics 2017-07-20 Yves Grandvalet , Julien Chiquet , Christophe Ambroise

The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly time-varying) subset of vertices. We recast two classical adaptive algorithms in the graph…

Machine Learning · Computer Science 2018-08-01 Paolo Di Lorenzo , Paolo Banelli , Elvin Isufi , Sergio Barbarossa , Geert Leus

This paper studies inference in the high-dimensional linear regression model with outliers. Sparsity constraints are imposed on the vector of coefficients of the covariates. The number of outliers can grow with the sample size while their…

Statistics Theory · Mathematics 2021-02-08 Jad Beyhum

Recently, linear regression models incorporating an optimal transport (OT) loss have been explored for applications such as supervised unmixing of spectra, music transcription, and mass spectrometry. However, these task-specific approaches…

Large outliers break down linear and nonlinear regression models. Robust regression methods allow one to filter out the outliers when building a model. By replacing the traditional least squares criterion with the least trimmed squares…

Optimization and Control · Mathematics 2012-06-07 Gleb Beliakov , Andrei Kelarev , John Yearwood

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

This paper deals with sparse feature selection and grouping for classification and regression. The classification or regression problems under consideration consists in minimizing a convex empirical risk function subject to an $\ell^1$…

Statistics Theory · Mathematics 2017-03-27 Michel Barlaud , Wafa Belhajali , Patrick L. Combettes , Lionel Fillatre