paper-with-me

홈 › Papers

Selection consistency of Lasso-based procedures for misspecified high-dimensional binary model and random regressors

2019-06-10 · Mariusz Kubkowski, Jan Mielniczuk

We consider selection of random predictors for high-dimensional regression problem with binary response for a general loss function. Important special case is when the binary model is semiparametric and the response function is misspecified under parametric model fit. Selection for such a scenario aims at recovering the support of the minimizer of the associated risk with large probability. We propose a two-step selection procedure which consists of screening and ordering predictors by Lasso method and then selecting a subset of predictors which minimizes Generalized Information Criterion on the corresponding nested family of models. We prove consistency of the selection method under conditions which allow for much larger number of predictors than number of observations. For the semiparametric case when distribution of random predictors satisfies linear regression conditions the true and the estimated parameters are collinear and their common support can be consistently identified.

📄 PDF Abstract BibTeX arXiv:1906.04175

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Methods 이 논문이 사용한 방법론

Linear Regression Linear Regression is a method for modelling a relationship between a dependent variable and independent variables. These models can be fit with numerous approaches. The most…

Similar Papers 제목 키워드 기반

Moran's I Lasso for models with spatially correlated data

2023-10-04 · Sylvain Barde, Rowan Cherodian, Guy Tchuente

This paper proposes a Lasso-based estimator which uses information embedded in the Moran statistic to develop a selection procedure called Moran's I Lasso (Mi-Lasso) to solve the Eigenvector Spatial Filtering (ESF) eigen…

Lasso Inference for High-Dimensional Time Series

2020-07-21 · Robert Adamek, Stephan Smeekes, Ines Wilms

In this paper we develop valid inference for high-dimensional time series. We extend the desparsified lasso to a time series setting under Near-Epoch Dependence (NED) assumptions allowing for non-Gaussian, serially corre…

Time SeriesTime Series AnalysisvalidVocal Bursts Intensity Prediction

A Strongly Consistent Sparse $k$-means Clustering with Direct $l_1$ Penalization on Variable Weights

2019-03-24 · Saptarshi Chakraborty, Swagatam Das

We propose the Lasso Weighted $k$-means ($LW$-$k$-means) algorithm as a simple yet efficient sparse clustering procedure for high-dimensional data where the number of features ($p$) can be much larger compared to the num…

Clusteringfeature selection

Risk-consistency of cross-validation with lasso-type procedures

2013-08-04 · Darren Homrighausen, Daniel J. McDonald

The lasso and related sparsity inducing algorithms have been the target of substantial theoretical and applied research. Correspondingly, many results are known about their behavior for a fixed or optimally chosen tuning…

Model SelectionVocal Bursts Type Prediction

High SNR Consistent Compressive Sensing

2017-03-10 · Sreejith Kallummil, Sheetal Kalyani

High signal to noise ratio (SNR) consistency of model selection criteria in linear regression models has attracted a lot of attention recently. However, most of the existing literature on high SNR consistency deals with …

Compressive SensingModel SelectionregressionVocal Bursts Intensity Prediction