About: Bundle Methods for Structured Output Learning

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Bundle Methods for Structured Output Learning - Back to the Roots 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://link.springer.com/chapter/10.1007/978-3-642-38886-6_16
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, 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 Risk Minimization (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. 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 Risk Minimization (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. (en)
Title	Bundle Methods for Structured Output Learning - Back to the Roots Bundle Methods for Structured Output Learning - Back to the Roots (en)
skos:prefLabel	Bundle Methods for Structured Output Learning - Back to the Roots Bundle Methods for Structured Output Learning - Back to the Roots (en)
skos:notation	RIV/68407700:21230/13:00212533!RIV14-MSM-21230___
http://linked.open...avai/predkladatel	Fakulta elektrotechnická
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(7E10047), P(7E13018), P(GAP202/12/2071), P(TE01020197)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Hlaváč, Václav Franc, Vojtěch Uřičář, Michal
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	64030
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00212533
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Structured Output Learning; Bundle Methods; Risk Minimization; Structured Output SVM (en)
http://linked.open.../riv/klicoveSlovo	Bundle Methods Risk Minimization Structured Output Learning Structured Output SVM
http://linked.open...ontrolniKodProRIV	[1A70AE3DDD1E]
http://linked.open...v/mistoKonaniAkce	Espoo
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	SCIA 2013: Proceedings of the 18th Scandinavian Conference on Image Analysis
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Strukturované statistické modely pro porozumění obrazům Clothes Perception and Manipulation Centre for Applied Cybernetics 3 Humanoids with auditory and visual abilities in populated spaces
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Hlaváč, Václav Franc, Vojtěch Uřičář, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-06-17 (xsd:date)
issn	0302-9743
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-38886-6_16
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-38885-9
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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