Classification model selection via bilevel programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5305393
- Feature selection for classification models via bilevel optimization
- Model selection in utility-maximizing binary prediction
- scientific article; zbMATH DE number 1706384
- scientific article; zbMATH DE number 1966528
- Model selection for classification with a large number of classes
- Using a bicriteria Boolean linear programming model for parameter selection in large multicategory classification problem
- On a class of model selection procedures
Cited in
(34)- Solving bilevel linear programs using multiple objective linear programming
- Feature selection for classification models via bilevel optimization
- A novel embedded min-max approach for feature selection in nonlinear support vector machine classification
- Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method
- Best subset selection via cross-validation criterion
- Self-adaptive support vector machines: modelling and experiments
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Efficient optimization of hyper-parameters for least squares support vector regression
- scientific article; zbMATH DE number 5305393 (Why is no real title available?)
- Model selection for primal SVM
- A Parametric Optimization Method for Machine Learning
- On linear programs with linear complementarity constraints
- Bilevel Optimization of Regularization Hyperparameters in Machine Learning
- Constraint qualifications and optimality conditions in bilevel optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Generic property of the partial calmness condition for bilevel programming problems
- Directional necessary optimality conditions for bilevel programs
- A Lagrange multiplier expression method for bilevel polynomial optimization
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Learning with Limited Samples: Meta-Learning and Applications to Communication Systems
- Three modeling paradigms in mathematical programming
- On solving difference of convex functions programs with linear complementarity constraints
- scientific article; zbMATH DE number 7733454 (Why is no real title available?)
- Model building using bi-level optimization
- A fast smoothing newton method for bilevel hyperparameter optimization for SVC with logistic loss
- Second-order optimality conditions for bi-local solutions of bilevel programs
- Riemannian bilevel optimization
- Efficiently escaping saddle points in bilevel optimization
- Decentralized bilevel optimization
- Second-order optimality conditions for nonsmooth constrained optimization with applications to bilevel programming
- The rate of convergence of augmented Lagrangian method for bilevel optimization problems with equality constraints
- Global resolution of the support vector machine regression parameters selection problem with LPCC
This page was built for publication: Classification model selection via bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503687)
