On-line learning and the metrical task system problem

DOI10.1023/A:1007621832648MaRDI QIDQ1568389zbMATH OpenFDO

Authors Carl Burch, Avrim Blum

Publication date 18 December 2000

Published in Machine Learning (Search for Journal in Brave)

zbMATH Keywords

computational learning theorymetrical task system

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• An optimal on-line algorithm for metrical task system
• A regularization approach to metrical task systems
• Online learning via sequential complexities
• MetaGrad: adaptation using multiple learning rates in online learning
• Learning Theory and Kernel Machines
• On algorithm design for metrical task systems
• Publication:4886074
• On Complexity Issues of Online Learning Algorithms
• On-line learning with restricted training sets: An exactly solvable case

Cited in

(12)

• An optimal on-line algorithm for metrical task system
• An improved deterministic algorithm for the online min-sum set cover problem
• 10.1162/153244303321897654
• Linear programming with online learning
• Online Metric Algorithms with Untrusted Predictions
• Multitask Learning with Expert Advice
• Chasing convex bodies optimally
• Multiagent learning using a variable learning rate
• scientific article; zbMATH DE number 7758362 (Why is no real title available?)
• Unified algorithms for online learning and competitive analysis
• New results for online page replication
• Competitive On-line Statistics

This page was built for publication: On-line learning and the metrical task system problem

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