A regularization approach to metrical task systems

DOI10.1007/978-3-642-16108-7_23MaRDI QIDQ4930704zbMATH OpenOpenAlexFDO

Authors Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton

Publication date 1 October 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16108-7_23

Mathematics Subject Classification ID

Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Randomized algorithms for metrical task systems
• On algorithm design for metrical task systems
• Randomized algorithms for metrical task systems
• scientific article; zbMATH DE number 1559591
• An optimal on-line algorithm for metrical task system

Cited in

(8)

• On-line learning and the metrical task system problem
• Uniform metrical task systems with a limited number of states
• Unified algorithms for online learning and competitive analysis
• A combinatorial metrical task system problem under the uniform metric
• An optimal on-line algorithm for metrical task system
• Pure entropic regularization for metrical task systems
• Parametrized Metrical Task Systems
• Competitive ratio vs regret minimization: achieving the best of both worlds

This page was built for publication: A regularization approach to metrical task systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930704)