ALT 2012 Accepted Papers

Tor Lattimore and Marcus Hutter. PAC Bounds for Discounted MDPs
Eyal Gofer and Yishay Mansour. Lower Bounds on Individual Sequence Regret
Rahim Samei, Pavel Semukhin, Boting Yang and Sandra Zilles. Sauer's Bound for a Notion of Teaching Complexity
Dana Angluin, James Aspnes and Aryeh Kontorovich. On the Learnability of Shuffle Ideals
Sanjay Jain, Timo Kötzing and Frank Stephan. Enlarging Learnable Classes
Wouter M. Koolen and Vladimir Vovk. Buy Low, Sell High
Dmitry Adamskiy, Wouter M. Koolen, Alexey Chernov and Vladimir Vovk. A Closer Look at Adaptive Regret
Alexandra Carpentier and Rémi Munos. Minimax Number of Strata for Online Stratified Sampling given Noisy Samples
Ronald Ortner, Daniil Ryabko, Peter Auer and Rémi Munos. Regret Bounds for Restless Markov Bandits
Peter Grünwald. The Safe Bayesian: learning the learning rate via the mixability gap
Ziyuan Gao and Frank Stephan. Confident and Consistent Partial Learning of Recursive Functions
Mehryar Mohri and Andres Munoz. New analysis and algorithm for learning with drifting distributions
Hal Daume III, Jeff M. Phillips, Avishek Saha and Suresh Venkatasubramanian. Efficient Protocols for Distributed Classification and Optimization
Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto and Kiyohito Nagano. Online Prediction under Submodular Constraints
Shai Ben-David and Ruth Urner. On the Hardness of Covariate Shift Learning (and the Utility of Unlabeled Target Samples)
Emilie Kaufmann, Nathaniel Korda and Rémi Munos. Thompson Sampling: An Optimal Finite Time Analysis
Christophe Costa Florencio and Sicco Verwer. Regular inference as vertex coloring
Lev Reyzin. Data Stability in Clustering: A Closer Look
Manfred Warmuth, Wojciech Kotlowski and Shuisheng Zhou. Kernelization of matrix updates, when and how?
Edward Moroshko and Koby Crammer. Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret
Gábor Bartók and Csaba Szepesvári. Partial Monitoring with Side Information
Sanjay Jain and Efim Kinber. Automatic Learning from Positive Data and Negative Counterexamples
Satyadev Nandakumar and Mrinalkanti Ghosh. Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes

Valid HTML 4.1