COMBSS: best subset selection via continuous optimization
From MaRDI portal
Publication:6494417
DOI10.1007/S11222-024-10387-8MaRDI QIDQ6494417
Samuel Müller, Houying Zhu, Sarat B. Moka, Bernoît Liquet
Publication date: 30 April 2024
Published in: Statistics and Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Best subset selection via a modern optimization lens
- A randomized Kaczmarz algorithm with exponential convergence
- Lasso, fractional norm and structured sparse estimation using a Hadamard product parametrization
- Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- Expressions for the Moore-Penrose inverse of block matrices involving the Schur complement
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- Sparse Approximate Solutions to Linear Systems
- A polynomial algorithm for best-subset selection problem
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
- High-dimensional linear regression via implicit regularization
- Policy Optimization Using Semiparametric Models for Dynamic Pricing
This page was built for publication: COMBSS: best subset selection via continuous optimization