ALT 2012

28 papers

A Closer Look at Adaptive Regret Dmitry Adamskiy, Wouter M. Koolen, Alexey V. Chernov, Vladimir Vovk

Automatic Learning from Positive Data and Negative Counterexamples Sanjay Jain, Efim B. Kinber

Buy Low, Sell High Wouter M. Koolen, Vladimir Vovk

Confident and Consistent Partial Learning of Recursive Functions Ziyuan Gao, Frank Stephan

Data Stability in Clustering: A Closer Look Lev Reyzin

Declarative Modeling for Machine Learning and Data Mining Luc De Raedt

Efficient Protocols for Distributed Classification and Optimization Hal Daumé Iii, Jeff M. Phillips, Avishek Saha, Suresh Venkatasubramanian

Enlarging Learnable Classes Sanjay Jain, Timo Kötzing, Frank Stephan

Exploring Sequential Data Gilbert Ritschard

Kernelization of Matrix Updates, When and How? Manfred K. Warmuth, Wojciech Kotlowski, Shuisheng Zhou

Learnability Beyond Uniform Convergence Shai Shalev-Shwartz

Lower Bounds on Individual Sequence Regret Eyal Gofer, Yishay Mansour

Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples Alexandra Carpentier, Rémi Munos

New Analysis and Algorithm for Learning with Drifting Distributions Mehryar Mohri, Andres Muñoz Medina

On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples Shai Ben-David, Ruth Urner

On the Learnability of Shuffle Ideals Dana Angluin, James Aspnes, Aryeh Kontorovich

Online Prediction Under Submodular Constraints Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Kiyohito Nagano

PAC Bounds for Discounted MDPs Tor Lattimore, Marcus Hutter

Partial Monitoring with Side Information Gábor Bartók, Csaba Szepesvári

Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes Mrinalkanti Ghosh, Satyadev Nandakumar

Recent Developments in Pattern Mining Toon Calders

Regret Bounds for Restless Markov Bandits Ronald Ortner, Daniil Ryabko, Peter Auer, Rémi Munos

Regular Inference as Vertex Coloring Christophe Costa Florêncio, Sicco Verwer

Sauer's Bound for a Notion of Teaching Complexity Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles

Some Rates of Convergence for the Selected Lasso Estimator Pascal Massart, Caroline Meynet

The Safe Bayesian - Learning the Learning Rate via the Mixability Gap Peter Grünwald

Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis Emilie Kaufmann, Nathaniel Korda, Rémi Munos

Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret Edward Moroshko, Koby Crammer