About: Efficient Algorithm for Regularized Risk Minimization

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

About: Efficient Algorithm for Regularized Risk Minimization 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
Description	Many machine learning algorithms lead to solving a convex regularized risk minimization problem. Despite its convexity the problem is often very demanding in practice due to a high number of variables or a complex objective function. The Bundle Method for Risk Minimization (BMRM) is a recently proposed method for minimizing a generic regularized risk. Unlike the approximative methods, the BMRM algorithm comes with convergence guarantees but it is often too slow in practice. We propose a modified variant of the BMRM algorithm which decomposes the objective function into several parts and approximates each part by a separate cutting plane model instead of a single cutting plane model used in the original BMRM. The finer approximation of the objective function can significantly decrease the number of iterations at the expense of higher memory requirements. A preliminary experimental comparison shows promising results. Many machine learning algorithms lead to solving a convex regularized risk minimization problem. Despite its convexity the problem is often very demanding in practice due to a high number of variables or a complex objective function. The Bundle Method for Risk Minimization (BMRM) is a recently proposed method for minimizing a generic regularized risk. Unlike the approximative methods, the BMRM algorithm comes with convergence guarantees but it is often too slow in practice. We propose a modified variant of the BMRM algorithm which decomposes the objective function into several parts and approximates each part by a separate cutting plane model instead of a single cutting plane model used in the original BMRM. The finer approximation of the objective function can significantly decrease the number of iterations at the expense of higher memory requirements. A preliminary experimental comparison shows promising results. (en)
Title	Efficient Algorithm for Regularized Risk Minimization Efficient Algorithm for Regularized Risk Minimization (en)
skos:prefLabel	Efficient Algorithm for Regularized Risk Minimization Efficient Algorithm for Regularized Risk Minimization (en)
skos:notation	RIV/68407700:21230/12:00200337!RIV13-MSM-21230___
http://linked.open...avai/predkladatel	Fakulta elektrotechnická
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(7E10047)
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	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	133556
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/12:00200337
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Machine Learning; Regularized Risk Minimization; Cutting planes (en)
http://linked.open.../riv/klicoveSlovo	Machine Learning Cutting planes Regularized Risk Minimization
http://linked.open...ontrolniKodProRIV	[5FEDAA3517EB]
http://linked.open...v/mistoKonaniAkce	Mala Nedelja
http://linked.open...i/riv/mistoVydani	Ljubljana
http://linked.open...i/riv/nazevZdroje	CVWW 2012: Proceedings of the 17th Computer Vision Winter Workshop
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Humanoids with auditory and visual abilities in populated spaces
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Franc, Vojtěch Uřičář, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2012-02-01 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Slovenian Pattern Recognition Society
https://schema.org/isbn	978-961-90901-6-9
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	Efficient Algorithm for Regularized Risk Minimization

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