English
Related papers

Related papers: Smooth Adjustment for Correlated Effects

200 papers

We consider a linear regression problem in a high dimensional setting where the number of covariates $p$ can be much larger than the sample size $n$. In such a situation, one often assumes sparsity of the regression vector, \textit i.e.,…

Statistics Theory · Mathematics 2011-10-12 Mohamed Hebiri , Sara A. Van De Geer

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

Model selection and sparse recovery are two important problems for which many regularization methods have been proposed. We study the properties of regularization methods in both problems under the unified framework of regularized least…

Statistics Theory · Mathematics 2009-09-03 Jinchi Lv , Yingying Fan

Sorted L-One Penalized Estimation is a relatively new convex optimization procedure which allows for adaptive selection of regressors under sparse high dimensional designs. Here we extend the idea of SLOPE to deal with the situation when…

Statistics Theory · Mathematics 2015-12-01 Damian Brzyski , Weijie Su , Małgorzata Bogdan

The Lasso is biased. Concave penalized least squares estimation (PLSE) takes advantage of signal strength to reduce this bias, leading to sharper error bounds in prediction, coefficient estimation and variable selection. For prediction and…

Statistics Theory · Mathematics 2017-12-29 Long Feng , Cun-Hui Zhang

High-dimensional learning problems, where the number of features exceeds the sample size, often require sparse regularization for effective prediction and variable selection. While established for fully supervised data, these techniques…

Machine Learning · Computer Science 2026-01-01 The Tien Mai , Mai Anh Nguyen , Trung Nghia Nguyen

We study sparse signal recovery from noisy linear observations using nonconvex log-sum regularization. The log-sum penalty reduces the shrinkage bias of $\ell_1$ regularization and more closely approximates the $\ell_0$ regularization, but…

Information Theory · Computer Science 2026-05-12 Keisuke Morita , Masayuki Ohzeki

Modern variable selection procedures make use of penalization methods to execute simultaneous model selection and estimation. A popular method is the LASSO (least absolute shrinkage and selection operator), the use of which requires…

Methodology · Statistics 2023-01-12 Meadhbh O'Neill , Kevin Burke

Linear Mixed-Effects (LME) models are a fundamental tool for modeling correlated data, including cohort studies, longitudinal data analysis, and meta-analysis. Design and analysis of variable selection methods for LMEs is more difficult…

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

Traditional variable selection methods could fail to be sign consistent when irrepresentable conditions are violated. This is especially critical in high-dimensional settings when the number of predictors exceeds the sample size. In this…

Methodology · Statistics 2022-04-26 Fei Xue , Annie Qu

We propose an approach for fitting linear regression models that splits the set of covariates into groups. The optimal split of the variables into groups and the regularized estimation of the regression coefficients are performed by…

Methodology · Statistics 2019-12-13 Anthony Christidis , Ruben Zamar , Laks V. S. Lakshmanan , Ezequiel Smucler

There are proposals that extend the classical generalized additive models (GAMs) to accommodate high-dimensional data ($p>>n$) using group sparse regularization. However, the sparse regularization may induce excess shrinkage when estimating…

Methodology · Statistics 2022-07-07 Boyi Guo , Byron C. Jaeger , A. K. M. Fazlur Rahman , D. Leann Long , Nengjun Yi

Growth curve analysis (GCA) has a wide range of applications in various fields where growth trajectories need to be modeled. Heteroscedasticity is often present in the error term, which can not be handled with sufficient flexibility by…

Methodology · Statistics 2025-03-11 Jieying Jiao , Wenling Song , Yishu Xue , Jun Yan

Compared with digital methods, sparse recovery based on spiking neural networks has great advantages like high computational efficiency and low power-consumption. However, current spiking algorithms cannot guarantee more accurate estimates…

Signal Processing · Electrical Eng. & Systems 2020-09-22 Xiang Zhang , Lei Yu , Gang Zheng

Large language models (LLMs) have demonstrated strong reasoning abilities in mathematical tasks, often enhanced through reinforcement learning (RL). However, RL-trained models frequently produce unnecessarily long reasoning traces -- even…

Computation and Language · Computer Science 2025-05-27 Jinyan Su , Claire Cardie

This paper considers the development of spatially adaptive smoothing splines for the estimation of a regression function with non-homogeneous smoothness across the domain. Two challenging issues that arise in this context are the evaluation…

Statistics Theory · Mathematics 2013-06-11 Xiao Wang , Pang Du , Jinglai Shen

Recently, high-dimensional heterogeneous data have attracted a lot of attention and discussion. Under heterogeneity, semiparametric regression is a popular choice to model data in statistics. In this paper, we take advantages of expectile…

Statistics Theory · Mathematics 2019-08-20 Jun Zhao , Guan'ao Yan , Yi Zhang

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

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