Papers
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions
Alexander Strehl, Joydeep Ghosh
A Robust Minimax Approach to Classification
Gert R.G. Lanckriet, Laurent El Ghaoui, Chiranjib Bhattacharyya et al.
Optimal Structure Identification With Greedy Search
David Maxwell Chickering
On Boosting with Polynomially Bounded Distributions
Nader H. Bshouty, Dmitry Gavinsky
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Peter L. Bartlett, Shahar Mendelson
Limitations of Learning Via Embeddings in Euclidean Half Spaces
Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
Efficient Algorithms for Universal Portfolios
Adam Kalai, Santosh Vempala
Tracking a Small Set of Experts by Mixing Past Posteriors
Olivier Bousquet, Manfred K. Warmuth
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
Masashi Sugiyama, Klaus-Robert Müller
Minimal Kernel Classifiers
Glenn M. Fung, Olvi L. Mangasarian, Alexander J. Smola
On Online Learning of Decision Lists
Ziv Nevo, Ran El-Yaniv
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
Ronen I. Brafman, Moshe Tennenholtz
Algorithmic Luckiness
Ralf Herbrich, Robert C. Williamson
ε-MDPs: Learning in Varying Environments
István Szita, Bálint Takács, András Lörincz
Learning Precise Timing with LSTM Recurrent Networks
Felix A. Gers, Nicol N. Schraudolph, Jürgen Schmidhuber
Variational Learning of Clusters of Undercomplete Nonsymmetric Independent Components
Kwokleung Chan, Te-Won Lee, Terrence J. Sejnowski
Data-dependent margin-based generalization bounds for classification
András Antos, Balázs Kégl, Tamás Linder et al.
On the Convergence of Optimistic Policy Iteration
John N. Tsitsiklis
Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries
Nader H. Bshouty, Nadav Eiron
Kernel Independent Component Analysis
Francis R. Bach, Michael I. Jordan
Round Robin Classification
Johannes Fürnkranz