Minimum distance Lasso for robust high-dimensional regression

DOI10.1214/16-EJS1136zbMath1349.62322OpenAlexW2405968727MaRDI QIDQ286223

Eunho Yang, Nicolai Meinshausen, Aurélie C. Lozano

Publication date: 20 May 2016

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ejs/1463664092

zbMATH Keywords

robust estimationLassohigh-dimensional variable selectionsparse learning

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Nonparametric robustness (62G35) Linear regression; mixed models (62J05)

Related Items (9)

The main contributions of robust statistics to statistical science and a new challenge ⋮ A User-Friendly Computational Framework for Robust Structured Regression with the L₂ Criterion ⋮ Robust regression against heavy heterogeneous contamination ⋮ A semi-parametric approach to feature selection in high-dimensional linear regression models ⋮ High-dimensional composite quantile regression: optimal statistical guarantees and fast algorithms ⋮ A Tuning-free Robust and Efficient Approach to High-dimensional Regression ⋮ The landscape of empirical risk for nonconvex losses ⋮ I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error ⋮ Robust subset selection

Uses Software

• robustbase
• bootlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encoding and decoding V1 fMRI responses to natural images with sparse nonparametric models
• Robust inversion, dimensionality reduction, and randomized sampling
• Robust location estimates
• The ``automatic robustness of minimum distance functionals
• Metric fibrations from simply connected rank-one projective spaces
• Sparse least trimmed squares regression for analyzing high-dimensional large data sets
• Simultaneous analysis of Lasso and Dantzig selector
• High-dimensional graphs and variable selection with the Lasso
• Optimization with Sparsity-Inducing Penalties
• Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows
• The Minimum Distance Method
• What is invexity?
• Robust and efficient estimation by minimising a density power divergence
• Sparsity and Smoothness Via the Fused Lasso
• 10.1162/153244303321897690
• Multiscale Mining of fMRI Data with Hierarchical Structured Sparsity
• The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
• Model Selection and Estimation in Regression with Grouped Variables
• Robust Statistics
• Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
• An algorithm for information structuring and retrieval
• Robust Statistics
• A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers

This page was built for publication: Minimum distance Lasso for robust high-dimensional regression