Pith. sign in

REVIEW 2 cited by

A Survey of Tuning Parameter Selection for High-dimensional Regression

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.03669 v1 pith:WIBCVLSA submitted 2019-08-10 stat.ME cs.LGstat.ML

classification stat.MEcs.LGstat.ML
keywords parameterregressiontuninghigh-dimensionalchoicepenalizedselectionaccuracy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Penalized (or regularized) regression, as represented by Lasso and its variants, has become a standard technique for analyzing high-dimensional data when the number of variables substantially exceeds the sample size. The performance of penalized regression relies crucially on the choice of the tuning parameter, which determines the amount of regularization and hence the sparsity level of the fitted model. The optimal choice of tuning parameter depends on both the structure of the design matrix and the unknown random error distribution (variance, tail behavior, etc). This article reviews the current literature of tuning parameter selection for high-dimensional regression from both theoretical and practical perspectives. We discuss various strategies that choose the tuning parameter to achieve prediction accuracy or support recovery. We also review several recently proposed methods for tuning-free high-dimensional regression.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Sample-efficient inductive matrix completion with noise and inexact side-information

    stat.ML 2026-05 unverdicted novelty 7.0 of 10

    Nonconvex projected gradient descent for noisy inductive matrix completion achieves linear convergence and order-optimal error at sample complexity scaling with side-information dimension a instead of ambient dimension n.

  2. Sample-efficient inductive matrix completion with noise and inexact side-information

    stat.ML 2026-05 unverdicted novelty 7.0 of 10

    A projected gradient descent algorithm for noisy inductive matrix completion achieves linear convergence and stable recovery at sample complexity governed by side-information dimension, extending to inexact side-infor...

Pith tools