L0Learn

From MaRDI portal
Software:52543



swMATH36841CRANL0LearnMaRDI QIDQ52543

Fast Algorithms for Best Subset Selection

Rahul Mazumder, Hussein Hazimeh, Tim Nonet

Last update: 7 March 2023

Copyright license: MIT license, File License

Software version identifier: 2.1.0

Source code repository: https://github.com/cran/L0Learn




Related Items (21)

MIP-BOOST: Efficient and Effective L0 Feature Selection for Linear RegressionThe backbone method for ultra-high dimensional sparse machine learningSubset selection in network-linked dataGraph structured sparse subset selectionUnnamed ItemMatrix completion with nonconvex regularization: spectral operators and scalable algorithmsSemi-automated simultaneous predictor selection for regression-SARIMA modelsBest subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisonsA discussion on practical considerations with sparse regression methodologiesDiscussion of ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisonsRejoinder: ``Sparse regression: scalable algorithms and empirical performanceRejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisonsScalable Algorithms for the Sparse Ridge RegressionThe Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min PenaltyAn extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasetsRandomized Gradient Boosting MachineSparse classification: a scalable discrete optimization perspectiveRobust subset selectionMining events with declassified diplomatic documentsA Mixed-Integer Fractional Optimization Approach to Best Subset SelectionUnnamed Item


This page was built for software: L0Learn