English
Related papers

Related papers: Honest variable selection in linear and logistic r…

200 papers

Uncertainty quantification is crucial to assess prediction quality of a machine learning model. In the case of Extreme Learning Machines (ELM), most methods proposed in the literature make strong assumptions on the data, ignore the…

Machine Learning · Statistics 2020-11-04 Fabian Guignard , Federico Amato , Mikhail Kanevski

Ultra high-throughput sequencing of transcriptomes (RNA-Seq) has enabled the accurate estimation of gene expression at individual isoform level. However, systematic biases introduced during the sequencing and mapping processes as well as…

Methodology · Statistics 2013-10-02 Hui Jiang , Julia Salzman

$\ell_1$ mean filtering is a conventional, optimization-based method to estimate the positions of jumps in a piecewise constant signal perturbed by additive noise. In this method, the $\ell_1$ norm penalizes sparsity of the first-order…

Information Theory · Computer Science 2016-11-18 Mohammadreza Malek-Mohammadi , Cristian R. Rojas , Bo Wahlberg

This paper aims to build an estimate of an unknown density of the data with measurement error as a linear combination of functions from a dictionary. Inspired by the penalization approach, we propose the weighted Elastic-net penalized…

Statistics Theory · Mathematics 2020-07-07 Xiaowei Yang , Huiming Zhang , Haoyu Wei , Shouzheng Zhang

Mixed-effect models are very popular for analyzing data with a hierarchical structure, e.g. repeated observations within subjects in a longitudinal design, patients nested within centers in a multicenter design. However, recently, due to…

Methodology · Statistics 2019-05-09 Abhik Ghosh , Magne Thoresen

In the context of a linear model with a sparse coefficient vector, exponential weights methods have been shown to be achieve oracle inequalities for prediction. We show that such methods also succeed at variable selection and estimation…

Statistics Theory · Mathematics 2012-09-18 Ery Arias-Castro , Karim Lounici

In this paper, we aim to give a theoretical approximation for the penalty level of $\ell_{1}$-regularization problems. This can save much time in practice compared with the traditional methods, such as cross-validation. To achieve this…

Statistics Theory · Mathematics 2020-02-19 Fang Xie

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 consider high-dimensional binary classification by sparse logistic regression. We propose a model/feature selection procedure based on penalized maximum likelihood with a complexity penalty on the model size and derive the non-asymptotic…

Statistics Theory · Mathematics 2018-11-20 Felix Abramovich , Vadim Grinshtein

In many linear regression problems, including ill-posed inverse problems in image restoration, the data exhibit some sparse structures that can be used to regularize the inversion. To this end, a classical path is to use $\ell_{12}$ block…

Signal Processing · Electrical Eng. & Systems 2021-10-25 Charles-Alban Deledalle , Nicolas Papadakis , Joseph Salmon , Samuel Vaiter

We study a regularization framework that combines a convex fidelity term with multiple $\ell_1$-based regularizers, each linked to a distinct linear transform. This multi-penalty model enhances flexibility in promoting structured sparsity.…

Numerical Analysis · Mathematics 2026-02-02 Qianru Liu , Rui Wang , Yuesheng Xu

In this paper, we propose a data-adaptive empirical likelihood-based approach for treatment effect estimation and inference, which overcomes the obstacle of the traditional empirical likelihood-based approaches in the high-dimensional…

Methodology · Statistics 2020-12-15 Wei Liang , Ying Yan

We present a new method for post-selection inference for L1 (lasso)-penalized likelihood models, including generalized regression models. Our approach generalizes the post-selection framework presented in Lee et al (2014). The method…

Methodology · Statistics 2016-10-17 Jonathan Taylor , Robert Tibshirani

Many data mining and statistical machine learning algorithms have been developed to select a subset of covariates to associate with a response variable. Spurious discoveries can easily arise in high-dimensional data analysis due to enormous…

Statistics Theory · Mathematics 2016-10-25 Jianqing Fan , Wen-Xin Zhou

Penalized $M-$estimators for logistic regression models have been previously study for fixed dimension in order to obtain sparse statistical models and automatic variable selection. In this paper, we derive asymptotic results for penalized…

Statistics Theory · Mathematics 2023-08-08 Ana M. Bianco , Graciela Boente , Gonzalo Chebi

In high-dimensional regression, we attempt to estimate a parameter vector $\beta_0\in\mathbb{R}^p$ from $n\lesssim p$ observations $\{(y_i,x_i)\}_{i\leq n}$ where $x_i\in\mathbb{R}^p$ is a vector of predictors and $y_i$ is a response…

Statistics Theory · Mathematics 2022-02-08 Michael Celentano , Andrea Montanari

Regression calibration as developed by Rosner, Spiegelman and Willet is used to correct the bias in effect estimates due to measurement error in continuous exposures. The method involves two models: a measurement error model (MEM) relating…

Methodology · Statistics 2026-02-24 Wenze Tang , Donna Spiegelman , Xiaomei Liao , Molin Wang

The instability in the selection of models is a major concern with data sets containing a large number of covariates. This paper deals with variable selection methodology in the case of high-dimensional problems where the response variable…

Applications · Statistics 2012-03-23 Marie Walschaerts , Eve Leconte , Philippe Besse

We consider the problem of learning linear prediction models with model misspecification bias. In such case, the collinearity among input variables may inflate the error of parameter estimation, resulting in instability of prediction…

Machine Learning · Computer Science 2019-12-02 Zheyan Shen , Peng Cui , Tong Zhang , Kun Kuang

Popular iterative algorithms such as boosting methods and coordinate descent on linear models converge to the maximum $\ell_1$-margin classifier, a.k.a. sparse hard-margin SVM, in high dimensional regimes where the data is linearly…

Machine Learning · Statistics 2023-01-23 Stefan Stojanovic , Konstantin Donhauser , Fanny Yang