Pruning the ensemble of convolutional neural networks using second-order cone programming
From MaRDI portal
Cites work
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A characterization of entropy in terms of information loss
- A novel auto-pruned ensemble clustering via SOCP
- A trust region SQP-filter method for nonlinear second-order cone programming
- An SQP-type algorithm for nonlinear second-order cone programs
- Applications of second-order cone programming
- Bagging predictors
- CVXPY: a Python-embedded modeling language for convex optimization
- Ensemble pruning via semi-definite programming
- scientific article; zbMATH DE number 4189084 (Why is no real title available?)
- Interior-point methods
- Joint leaf-refinement and ensemble pruning through L₁ regularization
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- On Information and Sufficiency
- Pruning of error correcting output codes by optimization of accuracy-diversity trade off
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Second-order cone programming
This page was built for publication: Pruning the ensemble of convolutional neural networks using second-order cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966634)