Sparse regression: scalable algorithms and empirical performance
From MaRDI portal
Publication:2225311
DOI10.1214/19-STS701WikidataQ120702957 ScholiaQ120702957MaRDI QIDQ2225311FDOQ2225311
Authors: Jean Pauphilet, Dimitris Bertsimas, Bart P. G. Van Parys 
Publication date: 8 February 2021
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.06547
Cites Work
- LIBLINEAR: a library for large linear classification
- Sure independence screening in generalized linear models with NP-dimensionality
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- JuMP: a modeling language for mathematical optimization
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Nearly unbiased variable selection under minimax concave penalty
- Heuristics of instability and stabilization in model selection
- Least angle regression. (With discussion)
- Pathwise coordinate optimization
- Coordinate descent algorithms for lasso penalized regression
- Title not available (Why is that?)
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- Gene selection for cancer classification using support vector machines
- One-step sparse estimates in nonconcave penalized likelihood models
- High-dimensional graphs and variable selection with the Lasso
- Best subset selection via a modern optimization lens
- Title not available (Why is that?)
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Regularization and Variable Selection Via the Elastic Net
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Regressions by Leaps and Bounds
- Matching pursuits with time-frequency dictionaries
- Title not available (Why is that?)
- False discoveries occur early on the Lasso path
- Stable signal recovery from incomplete and inaccurate measurements
- Robustness and regularization of support vector machines
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Uncertainty principles and ideal atomic decomposition
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Sparse Approximate Solutions to Linear Systems
- On general minimax theorems
- Computing in operations research using Julia
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
- Support recovery without incoherence: a case for nonconvex regularization
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Nonlinear programming
- Logistic regression: from art to science
- Sparse learning via Boolean relaxations
- Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
Cited In (32)
- Numerical characterization of support recovery in sparse regression with correlated design
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Rejoinder: ``Sparse regression: scalable algorithms and empirical performance
- A unifying framework for sparsity-constrained optimization
- A unified approach to mixed-integer optimization problems with logical constraints
- Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization
- Sparse classification: a scalable discrete optimization perspective
- Title not available (Why is that?)
- A literature review of (Sparse) exponential family PCA
- Scaled sparse linear regression
- Title not available (Why is that?)
- SPARSE AND ROBUST LINEAR REGRESSION: AN OPTIMIZATION ALGORITHM AND ITS STATISTICAL PROPERTIES
- A neutral comparison of algorithms to minimize \(L_0\) penalties for high-dimensional variable selection
- Iteratively reweighted \(\ell_1\)-penalized robust regression
- The backbone method for ultra-high dimensional sparse machine learning
- A new perspective on low-rank optimization
- Variable selection in additive models via hierarchical sparse penalty
- A note on sparse least-squares regression
- Sparse hierarchical regression with polynomials
- Ideal formulations for constrained convex optimization problems with indicator variables
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Robust subset selection
- Learning sparse nonlinear dynamics via mixed-integer optimization
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees
- Regularized scalar-on-function regression analysis to assess functional association of critical physical activity window with biological age
- Day-ahead aircraft routing with data-driven primary delay predictions
- Linear regression with sparsely permuted data
- A fast regression via SVD and marginalization
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Topology optimization for inverse magnetostatics as sparse regression: application to electromagnetic coils for stellarators
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- Linear Regression With a Sparse Parameter Vector
Uses Software
This page was built for publication: Sparse regression: scalable algorithms and empirical performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225311)
