COLT/EuroCOLT

Keyphrases

Publications

2001

Nicolò Cesa-Bianchi, Gábor Lugosi
Potential-Based Algorithms in Online Prediction and Game Theory. COLT/EuroCOLT (2001)
Koby Crammer, Yoram Singer
Ultraconservative Online Algorithms for Multiclass Problems. COLT/EuroCOLT (2001)
Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
Limitations of Learning via Embeddings in Euclidean Half-Spaces. COLT/EuroCOLT (2001)
Peter Grünwald
Strong Entropy Concentration, Game Theory, and Algorithmic Randomness. COLT/EuroCOLT (2001)
Sanjay Jain, Efim B. Kinber
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data. COLT/EuroCOLT (2001)
Shie Mannor, Ron Meir
Geometric Bounds for Generalization in Boosting. COLT/EuroCOLT (2001)
Olivier Bousquet, Manfred K. Warmuth
Tracking a Small Set of Experts by Mixing Past Posteriors. COLT/EuroCOLT (2001)
Sham M. Kakade
Optimizing Average Reward Using Discounted Rewards. COLT/EuroCOLT (2001)
Ilia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alexander Gammerman
Pattern Recognition and Density Estimation under the General i.i.d. Assumption. COLT/EuroCOLT (2001)
Hans Ulrich Simon
How Many Queries Are Needed to Learn One Bit of Information? COLT/EuroCOLT (2001)
Deepak Chawla, Lin Li, Stephen Scott
Efficiently Approximating Weighted Sums with Exponentially Many Terms. COLT/EuroCOLT (2001)
Nader H. Bshouty, Nadav Eiron
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries. COLT/EuroCOLT (2001)
Shahar Mendelson
Geometric Methods in the Analysis of Glivenko-Cantelli Classes. COLT/EuroCOLT (2001)
Shai Ben-David, Philip M. Long, Yishay Mansour
Agnostic Boosting. COLT/EuroCOLT (2001)
Philip M. Long
On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses. COLT/EuroCOLT (2001)
Michael Schmitt
Radial Basis Function Neural Networks Have Superlinear VC Dimension. COLT/EuroCOLT (2001)
José L. Balcázar, Jorge Castro, David Guijarro
A General Dimension for Exact Learning. COLT/EuroCOLT (2001)
Vladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano
Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights. COLT/EuroCOLT (2001)
Antonio Piccolboni, Christian Schindelhauer
Discrete Prediction Games with Arbitrary Feedback and Loss. COLT/EuroCOLT (2001)
Nader H. Bshouty, Dmitry Gavinsky
On Boosting with Optimal Poly-Bounded Distributions. COLT/EuroCOLT (2001)
Nader H. Bshouty, Avi Owshanko
Learning Regular Sets with an Incomplete Membership Oracle. COLT/EuroCOLT (2001)
Leonid Peshkin, Sayan Mukherjee
Bounds on Sample Size for Policy Evaluation in Markov Environments. COLT/EuroCOLT (2001)
Jürgen Forster, Niels Schmitt, Hans Ulrich Simon
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. COLT/EuroCOLT (2001)
David G. Stork
Toward a Computational Theory of Data Acquisition and Truthing. COLT/EuroCOLT (2001)
Tong Zhang
A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning. COLT/EuroCOLT (2001)
Nader H. Bshouty, Vitaly Feldman
On Using Extended Statistical Queries to Avoid Membership Queries. COLT/EuroCOLT (2001)
Rocco A. Servedio
On Learning Monotone DNF under Product Distributions. COLT/EuroCOLT (2001)
Balázs Kégl, Tamás Linder, Gábor Lugosi
Data-Dependent Margin-Based Generalization Bounds for Classification. COLT/EuroCOLT (2001)
Sandra Zilles
On the Synthesis of Strategies Identifying Recursive Functions. COLT/EuroCOLT (2001)
Paul W. Goldberg
When Can Two Unsupervised Learners Achieve PAC Separation? COLT/EuroCOLT (2001)
Rocco A. Servedio
Smooth Boosting and Learning with Malicious Noise. COLT/EuroCOLT (2001)
Shie Mannor, Nahum Shimkin
Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments. COLT/EuroCOLT (2001)
Shahar Mendelson
Learning Relatively Small Classes. COLT/EuroCOLT (2001)
Mark Herbster
Learning Additive Models Online with Fast Evaluating Kernels. COLT/EuroCOLT (2001)
Peter L. Bartlett, Shahar Mendelson
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results. COLT/EuroCOLT (2001)
Wee Sun Lee, Philip M. Long
A Theoretical Analysis of Query Selection for Collaborative Filtering. COLT/EuroCOLT (2001)
Eyal Even-Dar, Yishay Mansour
Learning Rates for Q-Learning. COLT/EuroCOLT (2001)
Paul W. Goldberg
Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required. COLT/EuroCOLT (2001)
Tong Zhang
A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning. COLT/EuroCOLT (2001)
Bernhard Schölkopf, Ralf Herbrich, Alexander J. Smola
A Generalized Representer Theorem. COLT/EuroCOLT (2001)
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
Robust Learning - Rich and Poor. COLT/EuroCOLT (2001)

volume 2111, 2001

Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings COLT/EuroCOLT 2111 (2001)