Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons

DOI10.1214/20-STS733REJMaRDI QIDQ2225320zbMATH OpenFDO

Authors Robert Tibshirani, Ryan J. Tibshirani, Trevor Hastie

Publication date 8 February 2021

Published in Statistical Science (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.ss/1605603637

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
• Scalable approximate MCMC algorithms for the horseshoe prior
• SparseNet: coordinate descent with nonconvex penalties

Cited in

(13)

• Extending greedy feature selection algorithms to multiple solutions
• Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
• Leveraged least trimmed absolute deviations
• Scalable penalized spatiotemporal land-use regression for ground-level nitrogen dioxide
• Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor
• Interaction Model and Model Selection for Function-on-Function Regression
• Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
• Sparse index tracking using sequential Monte Carlo
• Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles
• MIP-BOOST: Efficient and Effective L₀ Feature Selection for Linear Regression
• Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint
• Integrating prediction in mean-variance portfolio optimization
• Approximate Selective Inference via Maximum Likelihood

Describes a project that uses

Uses Software

• L0Learn

This page was built for publication: Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225320)