About: Bundle Method for Structured Output Learning     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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 or bio-informatics. Learning of the structured output classifiers leads to solving a convex minimization problem which is not tractable by standard algorithms. A significant effort has been put to development of specialized solvers among which the Bundle Method for Risk Minimization (BMRM) [Teo et al., 2010] is one of the most successful. The BMRM is a simplified variant of bundle methods well known in the filed of non-smooth optimization. The simplicity of the BMRM is compensated by its reduced efficiency. In this paper, we propose several improvements of the BMRM which significantly speeds up its convergence. The improvements involve i) using the prox-term known from the original bundle methods, ii) starting optimization from a non-trivial initial solution and iii) using multiple cutting plane model to refine the risk approximation. Experiments on real-life data show that the improved BMRM converges significantly faster achieving speedup up to a factor of 10 compared to the original BMRM. The proposed method has become a part of the SHOGUN Machine Learning Toolbox [Sonnenburg et al., 2010].
  • 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 or bio-informatics. Learning of the structured output classifiers leads to solving a convex minimization problem which is not tractable by standard algorithms. A significant effort has been put to development of specialized solvers among which the Bundle Method for Risk Minimization (BMRM) [Teo et al., 2010] is one of the most successful. The BMRM is a simplified variant of bundle methods well known in the filed of non-smooth optimization. The simplicity of the BMRM is compensated by its reduced efficiency. In this paper, we propose several improvements of the BMRM which significantly speeds up its convergence. The improvements involve i) using the prox-term known from the original bundle methods, ii) starting optimization from a non-trivial initial solution and iii) using multiple cutting plane model to refine the risk approximation. Experiments on real-life data show that the improved BMRM converges significantly faster achieving speedup up to a factor of 10 compared to the original BMRM. The proposed method has become a part of the SHOGUN Machine Learning Toolbox [Sonnenburg et al., 2010]. (en)
Title
  • Bundle Method for Structured Output Learning
  • Bundle Method for Structured Output Learning (en)
skos:prefLabel
  • Bundle Method for Structured Output Learning
  • Bundle Method for Structured Output Learning (en)
skos:notation
  • RIV/68407700:21230/12:00200618!RIV13-MSM-21230___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(7E10047), P(TE01020197), S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 125695
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/12:00200618
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Regularized risk minimization; Structured Output SVM; Bundle methods; BMRM (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [6810BAFA6E5E]
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Franc, Vojtěch
  • Uřičář, Michal
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software