Optimized Cutting Plane Algorithm for Large-Scale Risk Minimization

@article{Franc2009OptimizedCP,
  title={Optimized Cutting Plane Algorithm for Large-Scale Risk Minimization},
  author={Vojtech Franc and S{\"o}ren Sonnenburg},
  journal={Journal of Machine Learning Research},
  year={2009},
  volume={10},
  pages={2157-2192}
}
We have developed an optimized cutting plane algorithm (OCA) for solving large-scale risk minimization problems. We prove that the number of iterations OCA requires to converge to a ε precise solution is approximately linear in the sample size. We also derive OCAS, an OCA-based linear binary Support Vector Machine (SVM) solver, and OCAM, a linear multi-class SVM solver. In an extensive empirical evaluation we show that OCAS outperforms current state-of-the-art SVM solvers like SVMlight… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 108 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 42 extracted citations

108 Citations

0102030'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 108 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 40 references

Similar Papers

Loading similar papers…