10.1162/1532443041424328
From MaRDI portal
Publication:4823522
DOI10.1162/1532443041424328zbMath1083.68592OpenAlexW3023115439MaRDI QIDQ4823522
Eiji Takimoto, Manfred K. Warmuth
Publication date: 28 October 2004
Published in: CrossRef Listing of Deleted DOIs (Search for Journal in Brave)
Full work available at URL: http://jmlr.csail.mit.edu/papers/v4/takimoto03a.html
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Dynamic benchmark targeting, Combining initial segments of lists, Combinatorial bandits, Randomized prediction of individual sequences, Online linear optimization and adaptive routing, Unnamed Item, Regret bounded by gradual variation for online convex optimization, Boosting over non-deterministic ZDDs, Online Discrete Optimization in Social Networks in the Presence of Knightian Uncertainty, A Combinatorial Metrical Task System Problem Under the Uniform Metric, The Canadian Traveller Problem and its competitive analysis, Online Learning over a Finite Action Set with Limited Switching, Efficient algorithms for online decision problems, Speech recognition by composition of weighted finite automata