Optimized cutting plane algorithm for large-scale risk minimization
zbMATH Open1235.68151MaRDI QIDQ2880969FDOQ2880969
Authors: Vojtěch Franc, Sören Sonnenburg 
Publication date: 17 April 2012
Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)
Full work available at URL: http://www.jmlr.org/papers/v10/franc09a.html
Recommendations
- Stochastic Cutting Planes for Data-Driven Optimization
- Cut generation for optimization problems with multivariate risk constraints
- scientific article; zbMATH DE number 592648
- scientific article; zbMATH DE number 219017
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- A cutting plane method from analytic centers for stochastic programming
- scientific article; zbMATH DE number 2196287
- On global optimality conditions and cutting plane algorithms
- Cutting plane algorithms for robust conic convex optimization problems
binary classificationmulti-class classificationparallelizationlarge-scale learningrisk minimizationlinear support vector machine
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cited In (10)
- Nonlinear optimization and support vector machines
- Nonlinear optimization and support vector machines
- Stochastic Cutting Planes for Data-Driven Optimization
- Cutting-plane training of structural SVMs
- Efficient optimization of \(F\)-measure with cost-sensitive SVM
- Privacy preserving feature selection and multiclass classification for horizontally distributed data
- Bundle methods for regularized risk minimization
- Learning optimized risk scores
- A flexible elicitation procedure for additive model scale constants
- Learning data discretization via convex optimization
Uses Software
This page was built for publication: Optimized cutting plane algorithm for large-scale risk minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880969)
