Invited Papers | |
The Two Faces of Active Learning | p. 1 |
Inference and Learning in Planning | p. 2 |
Mining Heterogeneous Information Networks by Exploring the Power of Links | p. 3 |
Learning and Domain Adaptation | p. 4 |
Learning on the Web | p. 7 |
Regular Contributions | |
Online Learning | |
Prediction with Expert Evaluators' Advice | p. 8 |
Pure Exploration in Multi-armed Bandits Problems | p. 23 |
The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses | p. 38 |
Computable Bayesian Compression for Uniformly Discretizable Statistical Models | p. 53 |
Calibration and Internal No-Regret with Random Signals | p. 68 |
St. Petersburg Portfolio Games | p. 83 |
Learning Graphs | |
Reconstructing Weighted Graphs with Minimal Query Complexity | p. 97 |
Learning Unknown Graphs | p. 110 |
Completing Networks Using Observed Data | p. 126 |
Active Learning and Query Learning | |
Average-Case Active Learning with Costs | p. 141 |
Canonical Horn Representations and Query Learning | p. 156 |
Learning Finite Automata Using Label Queries | p. 171 |
Characterizing Statistical Query Learning: Simplified Notions and Proofs | p. 186 |
An Algebraic Perspective on Boolean Function Learning | p. 201 |
Statistical Learning | |
Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm | p. 216 |
Complexity versus Agreement for Many Views: Co-regularization for Multi-view Semi-supervised Learning | p. 232 |
Error-Correcting Tournaments | p. 247 |
Inductive Inference | |
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference | p. 263 |
Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data | p. 278 |
Uncountable Automatic Classes and Learning | p. 293 |
Iterative Learning from Texts and Counterexamples Using Additional Information | p. 308 |
Incremental Learning with Ordinal Bounded Example Memory | p. 323 |
Learning from Streams | p. 338 |
Semi-supervised and Unsupervised Learning | |
Smart PAC-Learners | p. 353 |
Approximation Algorithms for Tensor Clustering | p. 368 |
Agnostic Clustering | p. 384 |
Author Index | p. 399 |
Table of Contents provided by Ingram. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.