Pages that link to "Item:Q5073242"
From MaRDI portal
The following pages link to A polynomial algorithm for best-subset selection problem (Q5073242):
Displaying 11 items.
- Clustering, multicollinearity, and singular vectors (Q2143037) (← links)
- (Q3985788) (← links)
- (Q5053172) (← links)
- <i>L</i><sub>0</sub>-Regularized Learning for High-Dimensional Additive Hazards Regression (Q5058017) (← links)
- Variables selection using \(\mathcal{L}_0\) penalty (Q6071717) (← links)
- <i>L</i> <sub>0</sub> -regularization for high-dimensional regression with corrupted data (Q6082450) (← links)
- Communication-efficient estimation for distributed subset selection (Q6089198) (← links)
- COMBSS: best subset selection via continuous optimization (Q6494417) (← links)
- Numerical characterization of support recovery in sparse regression with correlated design (Q6558520) (← links)
- Distribution-Free Location-Scale Regression (Q6585591) (← links)
- \texttt{skscope}: fast sparsity-constrained optimization in Python (Q6638539) (← links)