atlas

Research map / Learning theory and algorithms / Sample complexity

High-Dimensional Structured Quantile Regression

ICML 2017 · Learning theory and algorithms › Sample complexity · approach: Optimal mean estimation and subsampling · 6 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
Use quantile loss instead of least squares (Lasso) for sparse regression with heavy-tailed noisel1 penalized regression · Student t-distribution noiseestimation errorHelped
Use quantile loss instead of least squares (Lasso) under outlier contaminationl1 penalized regression · Percent contamination 2.5% to 15%estimation errorHelped
Increase number of samples beyond the NIPS threshold (about s log p for l1)structured quantile regression · Synthetic l1 and l1/l2 group sparse recoveryprobability of recovering true parameterHelped
Assess quantile regression with n < p and no regularizationquantile regression without structure · high-dimensional n<pnumber of interpolated samplesNo 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