Algorithmic Learning Theory: 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings

Front Matter....Pages -
Editors’ Introduction....Pages 1-11
Declarative Modeling for Machine Learning and Data Mining....Pages 12-12
Learnability beyond Uniform Convergence....Pages 13-16
Some Rates of Convergence for the Selected Lasso Estimator....Pages 17-33
Recent Developments in Pattern Mining....Pages 34-34
Exploring Sequential Data....Pages 35-35
The Safe Bayesian....Pages 169-183
Data Stability in Clustering: A Closer Look....Pages 184-198
Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis....Pages 199-213
Regret Bounds for Restless Markov Bandits....Pages 214-228
Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples....Pages 229-244
Enlarging Learnable Classes....Pages 36-50
Confident and Consistent Partial Learning of Recursive Functions....Pages 51-65
Automatic Learning from Positive Data and Negative Counterexamples....Pages 66-80
Regular Inference as Vertex Coloring....Pages 81-95
Sauer’s Bound for a Notion of Teaching Complexity....Pages 96-110
On the Learnability of Shuffle Ideals....Pages 111-123
New Analysis and Algorithm for Learning with Drifting Distributions....Pages 124-138
On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples....Pages 139-153
Efficient Protocols for Distributed Classification and Optimization....Pages 154-168
Weighted Last-Step Min-Max Algorithm with Improved Sub-logarithmic Regret....Pages 245-259
Online Prediction under Submodular Constraints....Pages 260-274
Lower Bounds on Individual Sequence Regret....Pages 275-289
A Closer Look at Adaptive Regret....Pages 290-304
Partial Monitoring with Side Information....Pages 305-319
PAC Bounds for Discounted MDPs....Pages 320-334
Buy Low, Sell High....Pages 335-349
Kernelization of Matrix Updates, When and How?....Pages 350-364
Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes....Pages 365-379
Back Matter....Pages -