The backbone method for ultra-high dimensional sparse machine learning

Cites Work

Sure independence screening in generalized linear models with NP-dimensionality
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Scikit-learn: machine learning in Python
Nearly unbiased variable selection under minimax concave penalty
Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
Least angle regression. (With discussion)
Title not available (Why is that?)
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
10.1162/153244303322753616
Title not available (Why is that?)
Random forests
Gene selection for cancer classification using support vector machines
Distributed optimization and statistical learning via the alternating direction method of multipliers
Best subset selection via a modern optimization lens
Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
Sure Independence Screening for Ultrahigh Dimensional Feature Space
Regularization and Variable Selection Via the Elastic Net
Ridge Regression: Biased Estimation for Nonorthogonal Problems
A data-driven software tool for enabling cooperative information sharing among police departments
Title not available (Why is that?)
Nonparametric independence screening in sparse ultra-high-dimensional additive models
Supersparse linear integer models for optimized medical scoring systems
Optimization problems for machine learning: a survey
Branch-and-price: Column generation for solving huge integer programs
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Sparse Approximate Solutions to Linear Systems
Ultrahigh dimensional feature selection: beyond the linear model
Learning Boolean concepts in the presence of many irrelevant features
Integer programming models for feature selection: new extensions and a randomized solution algorithm
Enlarging the margins in perceptron decision trees
Characterization of the equivalence of robustification and regularization in linear and matrix regression
Title not available (Why is that?)
Robust Regression and Lasso
Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
Divide-and-conquer for debiased \(l_1\)-norm support vector machine in ultra-high dimensions
Sparse high-dimensional regression: exact scalable algorithms and phase transitions
Sparse regression: scalable algorithms and empirical performance
A split-and-merge Bayesian variable selection approach for ultrahigh dimensional regression
Optimal classification trees
Sparsity in optimal randomized classification trees
Fifty years of classification and regression trees
Mathematical optimization in classification and regression trees
Scalable algorithms for the sparse ridge regression
Entropy-based model-free feature screening for ultrahigh-dimensional multiclass classification
Sparse learning via Boolean relaxations
Making decision trees feasible in ultrahigh feature and label dimensions
MIP-BOOST: Efficient and Effective L₀ Feature Selection for Linear Regression
The all-or-nothing phenomenon in sparse linear regression
Optimal randomized classification trees
An error bound for \(L_1\)-norm support vector machine coefficients in ultra-high dimension

Cited In (1)

Learning sparse nonlinear dynamics via mixed-integer optimization

Uses Software

UCI-ml
Gurobi
glmnet
Scikit
PostgreSQL
XGBoost
TaxiSimulation
L0Learn
L0BnB

This page was built for publication: The backbone method for ultra-high dimensional sparse machine learning

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