Name
Abstract | ||
|---|---|---|
Discriminative methods for learning structured output classifiers have been gaining popularity in recent years due to their successful applications in fields like computer vision, natural language processing, etc. Learning of the structured output classifiers leads to solving a convex minimization problem, still hard to solve by standard algorithms in real-life settings. A significant effort has been put to development of specialized solvers among which the Bundle Method for RiskMinimization (BMRM) [1] is one of the most successful. The BMRM is a simplified variant of bundle methods well known in the filed of non-smooth optimization. In this paper, we propose two speed-up improvements of the BMRM: i) using the adaptive prox-term known from the original bundle methods, ii) starting optimization from a non-trivial initial solution. We combine both improvements with the multiple cutting plane model approximation [2]. Experiments on real-life data show consistently faster convergence achieving speedup up to factor of 9.7. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-38886-6_16 | IMAGE ANALYSIS, SCIA 2013: 18TH SCANDINAVIAN CONFERENCE |
Keywords | Field | DocType |
Structured Output Learning, Bundle Methods, Risk Minimization, Structured Output SVM | Convergence (routing),Cutting-plane method,Standard algorithms,Computer science,Theoretical computer science,Minification,Artificial intelligence,Discriminative model,Bundle,Speedup,Mathematical optimization,Pattern recognition,Convex optimization | Conference |
Volume | ISSN | Citations |
7944 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michal Uricar | 1 | 86 | 4.31 |
| Vojtěch Franc | 2 | 584 | 55.78 |
| Václav Hlavác | 3 | 616 | 85.46 |