English
Related papers

Related papers: The Strong Screening Rule for SLOPE

200 papers

Inference for high-dimensional logistic regression models using penalized methods has been a challenging research problem. As an illustration, a major difficulty is the significant bias of the Lasso estimator, which limits its direct…

Methodology · Statistics 2024-10-29 Yuming Zhang , Stéphane Guerrier , Runze Li

In the era of exceptionally data-hungry models, careful selection of the training data is essential to mitigate the extensive costs of deep learning. Data pruning offers a solution by removing redundant or uninformative samples from the…

Machine Learning · Computer Science 2025-02-11 Artem Vysogorets , Kartik Ahuja , Julia Kempe

For high-dimensional omics data, sparsity-inducing regularization methods such as the Lasso are widely used and often yield strong predictive performance, even in settings when the assumption of sparsity is likely violated. We demonstrate…

Methodology · Statistics 2025-02-13 Andrea Bratsberg , Magne Thoresen , Jelle J. Goeman

We propose a Multi-step Screening Procedure (MSP) for the recovery of sparse linear models in high-dimensional data. This method is based on a repeated small penalty strategy that quickly converges to an estimate within a few iterations.…

Methodology · Statistics 2019-12-13 Yuehan Yang , Ji Zhu , Edward I. George

Variable selection is a challenging issue in statistical applications when the number of predictors $p$ far exceeds the number of observations $n$. In this ultra-high dimensional setting, the sure independence screening (SIS) procedure was…

Methodology · Statistics 2015-06-08 Xiangyu Wang , Chenlei Leng

Regularization is widely used in statistics and machine learning to prevent overfitting and gear solution towards prior information. In general, a regularized estimation problem minimizes the sum of a loss function and a penalty term. The…

Computation · Statistics 2012-01-18 Hua Zhou , Yichao Wu

In this paper we study predictive pattern mining problems where the goal is to construct a predictive model based on a subset of predictive patterns in the database. Our main contribution is to introduce a novel method called safe pattern…

Machine Learning · Statistics 2016-02-16 Kazuya Nakagawa , Shinya Suzumura , Masayuki Karasuyama , Koji Tsuda , Ichiro Takeuchi

The network Lasso (nLasso) has been proposed recently as an efficient learning algorithm for massive networked data sets (big data over networks). It extends the well-known least absolute shrinkage and selection operator (Lasso) from…

Machine Learning · Computer Science 2019-07-24 Alexander Jung , Nguyen Tran

The sparse group lasso is a high-dimensional regression technique that is useful for problems whose predictors have a naturally grouped structure and where sparsity is encouraged at both the group and individual predictor level. In this…

Scaled sparse linear regression jointly estimates the regression coefficients and noise level in a linear model. It chooses an equilibrium with a sparse regression method by iteratively estimating the noise level via the mean residual…

Machine Learning · Statistics 2012-06-22 Tingni Sun , Cun-Hui Zhang

We extend the feature selection methodology to dependent data and propose a novel time series predictor selection scheme that accommodates statistical dependence in a more typical i.i.d sub-sampling based framework. Furthermore, the…

Methodology · Statistics 2019-05-21 Avleen S. Bijral

Large-scale sequential data is often exposed to some degree of inhomogeneity in the form of sudden changes in the parameters of the data-generating process. We consider the problem of detecting such structural changes in a high-dimensional…

Methodology · Statistics 2016-01-15 Florencia Leonardi , Peter Bühlmann

Regularized estimators in the context of group variables have been applied successfully in model and feature selection in order to preserve interpretability. We formulate a Distributionally Robust Optimization (DRO) problem which recovers…

Statistics Theory · Mathematics 2017-05-12 Jose Blanchet , Yang Kang

The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a…

Statistics Theory · Mathematics 2007-06-13 Bradley Efron , Trevor Hastie , Iain Johnstone , Robert Tibshirani

In high dimensional settings, sparse structures are crucial for efficiency, both in term of memory, computation and performance. It is customary to consider $\ell_1$ penalty to enforce sparsity in such scenarios. Sparsity enforcing methods,…

Machine Learning · Statistics 2017-11-22 Eugene Ndiaye , Olivier Fercoq , Alexandre Gramfort , Vincent Leclère , Joseph Salmon

We study a seemingly unexpected and relatively less understood overfitting aspect of a fundamental tool in sparse linear modeling - best subset selection, which minimizes the residual sum of squares subject to a constraint on the number of…

Methodology · Statistics 2022-01-11 Rahul Mazumder , Peter Radchenko , Antoine Dedieu

This article introduces lassopack, a suite of programs for regularized regression in Stata. lassopack implements lasso, square-root lasso, elastic net, ridge regression, adaptive lasso and post-estimation OLS. The methods are suitable for…

Econometrics · Economics 2019-01-17 Achim Ahrens , Christian B. Hansen , Mark E. Schaffer

The propensity score (PS) is often used to control for large numbers of covariates in high-dimensional healthcare database studies. The least absolute shrinkage and selection operator (LASSO) has become the most widely used tool for fitting…

Methodology · Statistics 2025-12-17 Richard Wyss , Ben B. Hansen , Georg Hahn , Lars van der Laan , Kueiyu Joshua Lin

We consider model selection and estimation for partial spline models and propose a new regularization method in the context of smoothing splines. The regularization method has a simple yet elegant form, consisting of roughness penalty on…

Methodology · Statistics 2013-11-25 Guang Cheng , Hao Helen Zhang , Zuofeng Shang

We consider the problem of variable selection in high-dimensional settings with missing observations among the covariates. To address this relatively understudied problem, we propose a new synergistic procedure -- adaptive Bayesian SLOPE --…

‹ Prev 1 3 4 5 6 7 10 Next ›