Preference Elicitation and Query Learning
Avrim Blum - Carnegie Mellon University Jeffrey Jackson - Duquesne University Tuomas Sandholm - Carnegie Mellon University Martin Zinkevich - Carnegie Mellon University
Knowledge-Based Nonlinear Kernel Classifiers
Glenn Fung - The University of Wisconsin-Madison Olvi Mangasarian - The University of Wisconsin-Madison Jude Shavlik - The University of Wisconsin-Madison
How Many Strings Are Easy to Predict?
Yuri Kalnishkan - Royal Holloway University of London Vladimir Vovk - Royal Holloway University of London Michael V. Vyugin - Royal Holloway University of London
Projective DNF Formulae and Their Revision
Robert Sloan - University of Illinois at Chicago Balazs Szorenyi - University of Szeged Gyorgy Turan - University of Illinois at Chicago
Learning All Subfunctions of a Function
Sanjay Jain - National University of Singapore Efim Kinber - Sacred Heart University Rolf Wiehagen - University of Kaiserslautern
When Is Small Beautiful? Amiran Ambroladze - Lund University John Shawe-Taylor - Royal Holloway University of London
Learning a Function of r Relevant Variables Avrim Blum - Carnegie Mellon University
Subspace Detection: A Robust Statistics Formulation Sanjoy Dasgupta - University of California at San Diego
How Fast Is k-Means? Sanjoy Dasgupta - University of California at San Diego
Universal Coding of Zipf Distributions Yoav Freund - Mitsubishi Electric Research Labs Alon Orlitsky - University of California at San Diego Prasad Santhanam - University of California at San Diego Junan Zhang - University of California at San Diego
An Open Problem Regarding the Convergence of Universal A\\Priori Probability Marcus Hutter - IDSIA
Entropy Bounds for Restricted Convex Hulls Vladimir Koltchinskii - University of New Mexico
Compressing to VC Dimension Many Points Manfred K. Warmuth - University of California at Santa Cruz