14. COLT / 5. EuroCOLT 2001:
Amsterdam,
The Netherlands
David P. Helmbold, Bob Williamson (Eds.):
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.
Lecture Notes in Computer Science 2111 Springer 2001, ISBN 3-540-42343-5 BibTeX
@proceedings{DBLP:conf/colt/2001,
editor = {David P. Helmbold and
Bob Williamson},
title = {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},
booktitle = {COLT/EuroCOLT},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2111},
year = {2001},
isbn = {3-540-42343-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Hans-Ulrich Simon:
How Many Queries Are Needed to Learn One Bit of Information?
1-13
Electronic Edition (Springer LINK) BibTeX
- Michael Schmitt:
Radial Basis Function Neural Networks Have Superlinear VC Dimension.
14-30
Electronic Edition (Springer LINK) BibTeX
- Olivier Bousquet, Manfred K. Warmuth:
Tracking a Small Set of Experts by Mixing Past Posteriors.
31-47
Electronic Edition (Springer LINK) BibTeX
- Nicolò Cesa-Bianchi, Gábor Lugosi:
Potential-Based Algorithms in Online Prediction and Game Theory.
48-64
Electronic Edition (Springer LINK) BibTeX
- Tong Zhang:
A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning.
65-81
Electronic Edition (Springer LINK) BibTeX
- Deepak Chawla, Lin Li, Stephen Scott:
Efficiently Approximating Weighted Sums with Exponentially Many Terms.
82-98
Electronic Edition (Springer LINK) BibTeX
- Koby Crammer, Yoram Singer:
Ultraconservative Online Algorithms for Multiclass Problems.
99-115
Electronic Edition (Springer LINK) BibTeX
- Paul W. Goldberg:
Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required.
116-127
Electronic Edition (Springer LINK) BibTeX
- Shie Mannor, Nahum Shimkin:
Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments.
128-142
Electronic Edition (Springer LINK) BibTeX
- John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen:
Robust Learning - Rich and Poor.
143-159
Electronic Edition (Springer LINK) BibTeX
- Sandra Zilles:
On the Synthesis of Strategies Identifying Recursive Functions.
160-176
Electronic Edition (Springer LINK) BibTeX
- Sanjay Jain, Efim B. Kinber:
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data.
177-193
Electronic Edition (Springer LINK) BibTeX
- David G. Stork:
Toward a Computational Theory of Data Acquisition and Truthing.
194-207
Electronic Edition (Springer LINK) BibTeX
- Antonio Piccolboni, Christian Schindelhauer:
Discrete Prediction Games with Arbitrary Feedback and Loss.
208-223
Electronic Edition (Springer LINK) BibTeX
- Peter L. Bartlett, Shahar Mendelson:
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results.
224-240
Electronic Edition (Springer LINK) BibTeX
- Vladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano:
Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights.
241-255
Electronic Edition (Springer LINK) BibTeX
- Shahar Mendelson:
Geometric Methods in the Analysis of Glivenko-Cantelli Classes.
256-272
Electronic Edition (Springer LINK) BibTeX
- Shahar Mendelson:
Learning Relatively Small Classes.
273-288
Electronic Edition (Springer LINK) BibTeX
- Philip M. Long:
On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses.
289-302
Electronic Edition (Springer LINK) BibTeX
- Paul W. Goldberg:
When Can Two Unsupervised Learners Achieve PAC Separation?
303-319
Electronic Edition (Springer LINK) BibTeX
- Peter Grünwald:
Strong Entropy Concentration, Game Theory, and Algorithmic Randomness.
320-336
Electronic Edition (Springer LINK) BibTeX
- Ilia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alexander Gammerman:
Pattern Recognition and Density Estimation under the General i.i.d. Assumption.
337-353
Electronic Edition (Springer LINK) BibTeX
- José L. Balcázar, Jorge Castro, David Guijarro:
A General Dimension for Exact Learning.
354-367
Electronic Edition (Springer LINK) BibTeX
- Balázs Kégl, Tamás Linder, Gábor Lugosi:
Data-Dependent Margin-Based Generalization Bounds for Classification.
368-384
Electronic Edition (Springer LINK) BibTeX
- Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon:
Limitations of Learning via Embeddings in Euclidean Half-Spaces.
385-401
Electronic Edition (Springer LINK) BibTeX
- Jürgen Forster, Niels Schmitt, Hans-Ulrich Simon:
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
402-415
Electronic Edition (Springer LINK) BibTeX
- Bernhard Schölkopf, Ralf Herbrich, Alex J. Smola:
A Generalized Representer Theorem.
416-426
Electronic Edition (Springer LINK) BibTeX
- Tong Zhang:
A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning.
427-443
Electronic Edition (Springer LINK) BibTeX
- Mark Herbster:
Learning Additive Models Online with Fast Evaluating Kernels.
444-460
Electronic Edition (Springer LINK) BibTeX
- Shie Mannor, Ron Meir:
Geometric Bounds for Generalization in Boosting.
461-472
Electronic Edition (Springer LINK) BibTeX
- Rocco A. Servedio:
Smooth Boosting and Learning with Malicious Noise.
473-489
Electronic Edition (Springer LINK) BibTeX
- Nader H. Bshouty, Dmitry Gavinsky:
On Boosting with Optimal Poly-Bounded Distributions.
490-506
Electronic Edition (Springer LINK) BibTeX
- Shai Ben-David, Philip M. Long, Yishay Mansour:
Agnostic Boosting.
507-516
Electronic Edition (Springer LINK) BibTeX
- Wee Sun Lee, Philip M. Long:
A Theoretical Analysis of Query Selection for Collaborative Filtering.
517-528
Electronic Edition (Springer LINK) BibTeX
- Nader H. Bshouty, Vitaly Feldman:
On Using Extended Statistical Queries to Avoid Membership Queries.
529-545
Electronic Edition (Springer LINK) BibTeX
- Nader H. Bshouty, Nadav Eiron:
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries.
546-557
Electronic Edition (Springer LINK) BibTeX
- Rocco A. Servedio:
On Learning Monotone DNF under Product Distributions.
558-573
Electronic Edition (Springer LINK) BibTeX
- Nader H. Bshouty, Avi Owshanko:
Learning Regular Sets with an Incomplete Membership Oracle.
574-588
Electronic Edition (Springer LINK) BibTeX
- Eyal Even-Dar, Yishay Mansour:
Learning Rates for Q-Learning.
589-604
Electronic Edition (Springer LINK) BibTeX
- Sham Kakade:
Optimizing Average Reward Using Discounted Rewards.
605-615
Electronic Edition (Springer LINK) BibTeX
- Leonid Peshkin, Sayan Mukherjee:
Bounds on Sample Size for Policy Evaluation in Markov Environments.
616-630
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:02:59 2009
by Michael Ley (ley@uni-trier.de)