Sparse classification: a scalable discrete optimization perspective
From MaRDI portal
Cites work
- A fast dual algorithm for kernel logistic regression
- A Statistical View of Some Chemometrics Regression Tools
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Analysis of multi-stage convex relaxation for sparse regularization
- Approximation hardness for a class of sparse optimization problems
- Best subset selection via a modern optimization lens
- Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- Characterization of the equivalence of robustification and regularization in linear and matrix regression
- Computing in operations research using Julia
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Dual coordinate descent methods for logistic regression and maximum entropy models
- False discoveries occur early on the Lasso path
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Gene selection for cancer classification using support vector machines
- scientific article; zbMATH DE number 653033 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- JuMP: a modeling language for mathematical optimization
- Learning sparse classifiers: continuous and mixed integer optimization perspectives
- Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework
- Logistic regression: from art to science
- Multi-stage convex relaxation for feature selection
- Nearly unbiased variable selection under minimax concave penalty
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- One-bit compressed sensing by linear programming
- One-step sparse estimates in nonconcave penalized likelihood models
- Optimization with sparsity-inducing penalties
- Pegasos: primal estimated sub-gradient solver for SVM
- Projected gradient methods for linearly constrained problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Solving mixed integer nonlinear programs by outer approximation
- Sparse Approximate Solutions to Linear Systems
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Sparse learning via Boolean relaxations
- Sparse regression: scalable algorithms and empirical performance
- SparseNet: coordinate descent with nonconvex penalties
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support recovery without incoherence: a case for nonconvex regularization
- Support vector machines are universally consistent
- Support-vector networks
- Sure independence screening in generalized linear models with NP-dimensionality
- The Cutting-Plane Method for Solving Convex Programs
- Trust region Newton method for logistic regression
- Variable selection using MM algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(18)- Robust and sparse multigroup classification by the optimal scoring approach
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Sparse regression over clusters: SparClur
- Prediction and estimation consistency of sparse multi-class penalized optimal scoring
- Learning Reductions to Sparse Sets
- scientific article; zbMATH DE number 5968873 (Why is no real title available?)
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- eSPA+: Scalable Entropy-Optimal Machine Learning Classification for Small Data Problems
- Sparse convex optimization toolkit: a mixed-integer framework
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- Sparse Classification: a scalable discrete optimization perspective
- Cardinality minimization, constraints, and regularization: a survey
- Constrained optimization of rank-one functions with indicator variables
- Automated subset selection via information criteria optimization in generalized linear models
- Identifying highly relevant entries in datasets: a relevance-based classification
- Sparse vertex discriminant analysis: variable selection for biomedical classification applications
- Interpretable optimisation-based approach for hyper-box classification
- Cardinality-constrained maximal predictability portfolios with an _2 regularization
This page was built for publication: Sparse classification: a scalable discrete optimization perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2071494)
