| Target Area: Computational Game Theory | |
| Tutorial: Learning Topics in Game-Theoretic Decision Making | p. 1 |
| Invited Talk | |
| A General Class of No-Regret Learning Algorithms and Game-Theoretic Equilibria | p. 2 |
| Contributed Talks | |
| Preference Elicitation and Query Learning | p. 13 |
| Efficient Algorithms for Online Decision Problems | p. 26 |
| Kernel Machines | |
| Positive Definite Rational Kernels | p. 41 |
| Bhattacharyya and Expected Likelihood Kernels | p. 57 |
| Maximal Margin Classification for Metric Spaces | p. 72 |
| Maximum Margin Algorithms with Boolean Kernels | p. 87 |
| Knowledge-Based Nonlinear Kernel Classifiers | p. 102 |
| Fast Kernels for Inexact String Matching | p. 114 |
| On Graph Kernels: Hardness Results and Efficient Alternatives | p. 129 |
| Kernels and Regularization on Graphs | p. 144 |
| Data-Dependent Bounds for Multi-category Classification Based on Convex Losses | p. 159 |
| Poster Session 1 | |
| Comparing Clusterings by the Variation of Information | p. 173 |
| Multiplicative Updates for Large Margin Classifiers | p. 188 |
| Simplified PAC-Bayesian Margin Bounds | p. 203 |
| Sparse Kernel Partial Least Squares Regression | p. 216 |
| Sparse Probability Regression by Label Partitioning | p. 231 |
| Learning with Rigorous Support Vector Machines | p. 243 |
| Robust Regression by Boosting the Median | p. 258 |
| Boosting with Diverse Base Classifiers | p. 273 |
| Reducing Kernel Matrix Diagonal Dominance Using Semi-definite Programming | p. 288 |
| Statistical Learning Theory | |
| Optimal Rates of Aggregation | p. 303 |
| Distance-Based Classification with Lipschitz Functions | p. 314 |
| Random Subclass Bounds | p. 329 |
| PAC-MDL Bounds | p. 344 |
| Online Learning | |
| Universal Well-Calibrated Algorithm for On-Line Classification | p. 358 |
| Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling | p. 373 |
| Learning Algorithms for Enclosing Points in Bregmanian Spheres | p. 388 |
| Internal Regret in On-Line Portfolio Selection | p. 403 |
| Other Approaches | |
| Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem | p. 418 |
| Smooth e-Insensitive Regression by Loss Symmetrization | p. 433 |
| On Finding Large Conjunctive Clusters | p. 448 |
| Learning Arithmetic Circuits via Partial Derivatives | p. 463 |
| Poster Session 2 | |
| Using a Linear Fit to Determine Monotonicity Directions | p. 477 |
| Generalization Bounds for Voting Classifiers Based on Sparsity and Clustering | p. 492 |
| Sequence Prediction Based on Monotone Complexity | p. 506 |
| How Many Strings Are Easy to Predict? | p. 522 |
| Polynomial Certificates for Propositional Classes | p. 537 |
| On-Line Learning with Imperfect Monitoring | p. 552 |
| Exploiting Task Relatedness for Multiple Task Learning | p. 567 |
| Approximate Equivalence of Markov Decision Processes | p. 581 |
| An Information Theoretic Tradeoff between Complexity and Accuracy | p. 595 |
| Learning Random Log-Depth Decision Trees under the Uniform Distribution | p. 610 |
| Projective DNF Formulae and Their Revision | p. 625 |
| Learning with Equivalence Constraints and the Relation to Multiclass Learning | p. 640 |
| Target Area: Natural Language Processing | |
| Tutorial: Machine Learning Methods in Natural Language Processing | p. 655 |
| Invited Talks | |
| Learning from Uncertain Data | p. 656 |
| Learning and Parsing Stochastic Unification-Based Grammars | p. 671 |
| Inductive Inference Learning | |
| Generality's Price: Inescapable Deficiencies in Machine-Learned Programs | p. 684 |
| On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms | p. 699 |
| Learning All Subfunctions of a Function | p. 714 |
| Open Problems | |
| When Is Small Beautiful? | p. 729 |
| Learning a Function of r Relevant Variables | p. 731 |
| Subspace Detection: A Robust Statistics Formulation | p. 734 |
| How Fast Is k Means? | p. 735 |
| Universal Coding of Zipf Distributions | p. 736 |
| An Open Problem Regarding the Convergence of Universal A Priori Probability | p. 738 |
| Entropy Bounds for Restricted Convex Hulls | p. 741 |
| Compressing to VC Dimension Many Points | p. 743 |
| Author Index | p. 745 |
| Table of Contents provided by Publisher. All Rights Reserved. |