Luc Devroye (auth.), Gábor Lugosi, Hans Ulrich Simon (eds.)3540352945, 9783540352945
The 43 revised full papers presented together with 2 articles on open problems and 3 invited lectures were carefully reviewed and selected from a total of 102 submissions. The papers cover a wide range of topics including clustering, un- and semisupervised learning, statistical learning theory, regularized learning and kernel methods, query learning and teaching, inductive inference, learning algorithms and limitations on learning, online aggregation, online prediction and reinforcement learning.
Table of contents :
Front Matter….Pages –
Random Multivariate Search Trees….Pages 1-1
On Learning and Logic….Pages 2-3
Predictions as Statements and Decisions….Pages 4-4
A Sober Look at Clustering Stability….Pages 5-19
PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption….Pages 20-34
Stable Transductive Learning….Pages 35-49
Uniform Convergence of Adaptive Graph-Based Regularization….Pages 50-64
The Rademacher Complexity of Linear Transformation Classes….Pages 65-78
Function Classes That Approximate the Bayes Risk….Pages 79-93
Functional Classification with Margin Conditions….Pages 94-108
Significance and Recovery of Block Structures in Binary Matrices with Noise….Pages 109-122
Maximum Entropy Distribution Estimation with Generalized Regularization….Pages 123-138
Unifying Divergence Minimization and Statistical Inference Via Convex Duality….Pages 139-153
Mercer’s Theorem, Feature Maps, and Smoothing….Pages 154-168
Learning Bounds for Support Vector Machines with Learned Kernels….Pages 169-183
On Optimal Learning Algorithms for Multiplicity Automata….Pages 184-198
Exact Learning Composed Classes with a Small Number of Mistakes….Pages 199-213
DNF Are Teachable in the Average Case….Pages 214-228
Teaching Randomized Learners….Pages 229-243
Memory-Limited U-Shaped Learning….Pages 244-258
On Learning Languages from Positive Data and a Limited Number of Short Counterexamples….Pages 259-273
Learning Rational Stochastic Languages….Pages 274-288
Parent Assignment Is Hard for the MDL, AIC, and NML Costs….Pages 289-303
Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention….Pages 304-318
Discriminative Learning Can Succeed Where Generative Learning Fails….Pages 319-334
Improved Lower Bounds for Learning Intersections of Halfspaces….Pages 335-349
Efficient Learning Algorithms Yield Circuit Lower Bounds….Pages 350-363
Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition….Pages 364-378
Aggregation and Sparsity Via ℓ 1 Penalized Least Squares….Pages 379-391
A Randomized Online Learning Algorithm for Better Variance Control….Pages 392-407
Online Learning with Variable Stage Duration….Pages 408-422
Online Learning Meets Optimization in the Dual….Pages 423-437
Online Tracking of Linear Subspaces….Pages 438-452
Online Multitask Learning….Pages 453-467
The Shortest Path Problem Under Partial Monitoring….Pages 468-482
Tracking the Best Hyperplane with a Simple Budget Perceptron….Pages 483-498
Logarithmic Regret Algorithms for Online Convex Optimization….Pages 499-513
Online Variance Minimization….Pages 514-528
Online Learning with Constraints….Pages 529-543
Continuous Experts and the Binning Algorithm….Pages 544-558
Competing with Wild Prediction Rules….Pages 559-573
Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path….Pages 574-588
Ranking with a P-Norm Push….Pages 589-604
Subset Ranking Using Regression….Pages 605-619
Active Sampling for Multiple Output Identification….Pages 620-634
Improving Random Projections Using Marginal Information….Pages 635-649
Efficient Algorithms for General Active Learning….Pages 650-652
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints….Pages 653-654
Back Matter….Pages –
Reviews
There are no reviews yet.