atlas

Research map / Learning theory and algorithms / Prediction and decision losses

On the Consistency of Feature Selection With Lasso for Non-linear Targets

ICML 2016 · Learning theory and algorithms › Prediction and decision losses · approach: Distributionally robust optimization · 16 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Lasso fit with a linear hypothesis on data generated by nonlinear link functions (polynomial, sine, mixed) with Gaussian featuresLasso feature selection · synthetic nonlinear targets, Gaussian X, n up to 4000probability of successful relevant feature selectionHelped
Increase sample size n for Lasso under nonlinear link (polynomial g1 with m=3,5) versus linear caseLasso feature selection · synthetic, w in R^100 with 10 nonzerossample size needed for near-certain selectionHurt
Use a false link function g4(u)=1/u that violates the expectation assumption on g' (ablation)Lasso feature selection · synthetic, Gaussian X with Sigma=Iselection success probabilityHurt
Replace Gaussian features with Beta(2,2) or Student-t(nu=1) distributed features (ablation)Lasso feature selection with g5 · synthetic, g5 targetselection consistencyHurt
Use uniform or Weibull(1,1.5) features instead of Gaussian (ablation)Lasso feature selection with g5 · synthetic, g5 targetselection success probabilityNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy