Table of Contents

ALT '12 Logo

Editors' Introduction 1 - 9
Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, and Thomas Zeugmann.


INVITED PAPERS

Declarative Modeling for Machine Learning and Data Mining,
Abstract.
12 - 12
Luc De Raedt

Learnability beyond Uniform Convergence,
Abstract.
13 - 16
Shai Shalev-Shwartz

Some Rates of Convergence for the Selected Lasso Estimator,
Abstract.
17 - 33
Pascal Massart and Caroline Meynet.

Recent Developments in Pattern Mining,
Abstract.
34 - 34
Toon Calders,

Exploring Sequential Data,
Abstract.
35 - 35
Gilbert Ritschard



REGULAR CONTRIBUTIONS

Inductive Inference

Enlarging Learnable Classes,
Abstract.
36 - 50
Sanjay Jain, Timo Kötzing, and Frank Stephan.

Confident and Consistent Partial Learning of Recursive Functions,
Abstract.
51 - 65
Ziyuan Gao and Frank Stephan.

Automatic Learning from Positive Data and Negative Counterexamples,
Abstract.
66 - 80
Sanjay Jain and Efim Kinber.

Regular Inference as Vertex Coloring,
Abstract.
81 - 95
Christophe Costa Florêncio and Sicco Verwer.

Teaching and PAC Learning

Sauer's Bound for a Notion of Teaching Complexity,
Abstract.
96 - 110
Rahim Samei, Pavel Semukhin, Boting Yang, and Sandra Zilles.

On the Learnability of Shuffle Ideals,
Abstract.
111 - 123
Dana Angluin, James Aspnes, and Aryeh Kontorovich.

Statistical Learning Theory and Classification

New Analysis and Algorithm for Learning with Drifting Distributions,
Abstract.
124 - 138
Mehryar Mohri and Andres Muñoz Medina.

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

Efficient Protocols for Distributed Classification and Optimization,
Abstract.
154 - 168
Hal Daumé III, Jeff M. Phillips, Avishek Saha, and Suresh Venkatasubramanian.

Relations between Models and Data

The Safe Bayesian: Learning the Learning Rate via the Mixability Gap,
Abstract.
169 - 183
Peter Grünwald.

Data Stability in Clustering: A Closer Look,
Abstract.
184 - 198
Lev Reyzin.

Bandit Problems


Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis,
Abstract.
199 - 213
Emilie Kaufmann, Nathaniel Korda, and Rémi Munos.

Regret Bounds for Restless Markov Bandits,
Abstract.
214 - 228
Ronald Ortner, Daniil Ryabko, Peter Auer, and Rémi Munos.

Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples,
Abstract.
229 - 244
Alexandra Carpentier and Rémi Munos.

Online Prediction of Individual Sequences

Weighted Last-Step Min-Max Algorithm with Improved Sub-logarithmic Regret,
Abstract.
245 - 259
Edward Moroshko, and Koby Crammer.

Online Prediction under Submodular Constraints,
Abstract.
260 - 274
Daiki Suehiro, Kohei Hatano , Shuji Kijima, Eiji Takimoto, and Kiyohito Nagano.

Lower Bounds on Individual Sequence Regret,
Abstract.
275 - 289
Eyal Gofer and Yishay Mansour.

A Closer Look at Adaptive Regret,
Abstract.
290 - 304
Dmitry Adamskiy, Wouter M. Koolen, Alexey Chernov, and Vladimir Vovk.

Partial Monitoring with Side Information,
Abstract.
305 - 319
Gábor Bartók and Csaba Szepesvári.

Other Models of Online Learning

PAC Bounds for Discounted MDPs,
Abstract.
320 - 334
Tor Lattimore and Marcus Hutter.

Buy Low, Sell High,
Abstract.
335 - 349
Wouter M. Koolen and Vladimir Vovk.

Kernelization of Matrix Updates, When and How?,
Abstract.
350 - 364
Manfred Warmuth, Wojciech Kotłowski, and Shuisheng Zhou.

Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes,
Abstract.
365 - 379
Mrinalkanti Ghosh and Satyadev Nandakumar.

Author Index 381


©Copyright Notice:
The document of this page is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provision of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable for prosecution under German Copyright Law.

uparrowback to the ALT 2012 Proceedings Page

uparrowuparrow back to the Conference Page


Valid HTML 4.1