Learning Theory and Kernel Machines

DOI10.1007/B12006MaRDI QIDQ5305877zbMATH OpenOpenAlexFDO

Authors Shie Mannor, Nahum Shimkin

Publication date 23 March 2010

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

Full work available at URL https://doi.org/10.1007/b12006

Mathematics Subject Classification ID

Multistage and repeated games (91A20) Rationality and learning in game theory (91A26) Signaling and communication in game theory (91A28)

Recommendations

• On-line learning with linear loss constraints.
• scientific article; zbMATH DE number 1569102
• scientific article; zbMATH DE number 1569116
• On the Generalization Ability of On-Line Learning Algorithms
• Online Learning of Noisy Data

Cited in

(7)

• On-line learning and the metrical task system problem
• Randomized prediction of individual sequences
• A general internal regret-free strategy
• Online Learning with Variable Stage Duration
• The Empirical Bayes Envelope and Regret Minimization in Competitive Markov Decision Processes
• Best-of-both-worlds algorithms for partial monitoring
• Cleaning up the neighborhood: a full classification for adversarial partial monitoring

This page was built for publication: Learning Theory and Kernel Machines

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