Editors' Introduction | | 1 - 7
|
Peter Auer,
Alexander Clark,
Thomas Zeugmann,
and
Sandra Zilles
|
| |
|
| |
|
FULL
INVITED PAPERS
| |
|
| |
|
Cellular Tree Classifiers,
Abstract.
| | 8 - 17
|
Gérard Biau and
Luc Devroye
| |
|
A Survey of Preference-Based Online Learning with Bandit Algorithms,
Abstract.
| | 18 - 39
|
Róbert Busa-Fekete
and
Eike Hüllermeier
| |
|
|
| |
|
REGULAR
CONTRIBUTIONS
| |
|
| |
|
|
| |
|
| |
|
Inductive Inference
| |
|
| |
|
A Map of Update Constraints in Inductive Inference,
Abstract.
| | 40 - 54
|
Timo Kötzing and
Raphaela Palenta
| |
|
On the Role of Update Constraints and Text-Types in Iterative Learning,
Abstract.
| | 55 - 69
|
Sanjay Jain,
Timo Kötzing,
Junqi Ma, and
Frank Stephan
| |
|
Parallel Learning of Automatic Classes of Languages,
Abstract.
| | 70 - 84
|
Sanjay Jain
and
Efim Kinber
| |
|
Algorithmic Identification of Probabilities Is Hard,
Abstract.
| | 85 - 95
|
Laurent Bienvenu,
Benoît Monin,
and
Alexander Shen
|
| |
|
Exact Learning from Queries
| |
|
| |
|
Learning Boolean Halfspaces with Small Weights from Membership Queries,
Abstract.
| | 96 - 110
|
Hasan Abasi, Ali Z. Abdi,
and
Nader H. Bshouty
| |
|
On Exact Learning Monotone DNF from Membership Queries,
Abstract.
| | 111 - 124
|
Hasan Abasi,
Nader H. Bshouty
and
Hanna Mazzawi
| |
|
Learning Regular Omega Languages,
Abstract.
| | 125 - 139
|
Dana Angluin
and
Dana Fisman
|
| |
|
| |
|
Reinforcement Learning
| |
|
| |
|
Selecting Near-Optimal Approximate State Representations in Reinforcement Learning,
Abstract.
| | 140 - 154
|
Ronald Ortner,
Odalric-Ambrym Maillard,
and
Daniil Ryabko
| |
|
Policy Gradients for CVaR-Constrained MDPs,
Abstract.
| | 155 - 169
|
L. A. Prashanth
| |
|
Bayesian Reinforcement Learning with Exploration,
Abstract.
| | 170 - 184
|
Tor Lattimore
and
Marcus Hutter
| |
|
Extreme State Aggregation beyond MDPs,
Abstract.
| | 185 - 199
|
Marcus Hutter
|
| |
|
| |
|
Online Learning and Learning with Bandit Information
| |
|
| |
|
On Learning the Optimal Waiting Time,
Abstract.
| | 200 - 214
|
Tor Lattimore,
András György,
and
Csaba Szepesvári
| |
|
Bandit Online Optimization over the Permutahedron,
Abstract.
| | 215 - 229
|
Nir Ailon,
Kohei Hatano,
and
Eiji Takimoto
| |
|
Offline to Online Conversion,
Abstract.
| | 230 - 244
|
Marcus Hutter
|
| |
|
| |
|
Statistical Learning Theory
| |
|
| |
|
A Chain Rule for the Expected Suprema of Gaussian Processes,
Abstract.
| | 245 - 259
|
Andreas Maurer
| |
|
Generalization Bounds for Time Series Prediction with Non-stationary Processes,
Abstract.
| | 260 - 274
|
Vitaly Kuznetsov and
Mehryar Mohri
| |
|
Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes,
Abstract.
| | 275 - 290
|
Rahim Samei,
Boting Yang,
and
Sandra Zilles
|
| |
|
| |
|
Privacy, Clustering, MDL, and Kolmogorov Complexity
| |
|
| |
|
Robust and Private Bayesian Inference,
Abstract.
| | 291 - 305
|
Christos Dimitrakakis,
Blaine Nelson,
Aikaterini Mitrokotsa,
and
Benjamin I. P. Rubinstein
| |
|
Clustering, Hamming Embedding, Generalized LSH and the Max Norm,
Abstract.
| | 306 - 320
|
Behnam Neyshabur,
Yury Makarychev,
and
Nathan Srebro
| |
|
Indefinitely Oscillating Martingales,
Abstract.
| | 321 - 335
|
Jan Leike and
Marcus Hutter
| |
|
A Safe Approximation for Kolmogorov Complexity,
Abstract.
| | 336 - 350
|
Peter Bloem, Francisco Mota, Steven de Rooij,
Luís Antunes, Pieter Adriaans
| |
|
Author Index
| | 351
|