Abstract is missing.
- How Many Queries Are Needed to Learn One Bit of Information?Hans-Ulrich Simon. 1-13 [doi]
- Radial Basis Function Neural Networks Have Superlinear VC DimensionMichael Schmitt. 14-30 [doi]
- Tracking a Small Set of Experts by Mixing Past PosteriorsOlivier Bousquet, Manfred K. Warmuth. 31-47 [doi]
- Potential-Based Algorithms in Online Prediction and Game TheoryNicolò Cesa-Bianchi, Gábor Lugosi. 48-64 [doi]
- A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in LearningTong Zhang. 65-81 [doi]
- Efficiently Approximating Weighted Sums with Exponentially Many TermsDeepak Chawla, Lin Li, Stephen Scott. 82-98 [doi]
- Ultraconservative Online Algorithms for Multiclass ProblemsKoby Crammer, Yoram Singer. 99-115 [doi]
- Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision RequiredPaul W. Goldberg. 116-127 [doi]
- Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov EnvironmentsShie Mannor, Nahum Shimkin. 128-142 [doi]
- Robust Learning - Rich and PoorJohn Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen. 143-159 [doi]
- On the Synthesis of Strategies Identifying Recursive FunctionsSandra Zilles. 160-176 [doi]
- Intrinsic Complexity of Learning Geometrical Concepts from Positive DataSanjay Jain, Efim B. Kinber. 177-193 [doi]
- Toward a Computational Theory of Data Acquisition and TruthingDavid G. Stork. 194-207 [doi]
- Discrete Prediction Games with Arbitrary Feedback and LossAntonio Piccolboni, Christian Schindelhauer. 208-223 [doi]
- Rademacher and Gaussian Complexities: Risk Bounds and Structural ResultsPeter L. Bartlett, Shahar Mendelson. 224-240 [doi]
- Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and WeightsVladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano. 241-255 [doi]
- Geometric Methods in the Analysis of Glivenko-Cantelli ClassesShahar Mendelson. 256-272 [doi]
- Learning Relatively Small ClassesShahar Mendelson. 273-288 [doi]
- On Agnostic Learning with {0, *, 1}-Valued and Real-Valued HypothesesPhilip M. Long. 289-302 [doi]
- When Can Two Unsupervised Learners Achieve PAC Separation?Paul W. Goldberg. 303-319 [doi]
- Strong Entropy Concentration, Game Theory, and Algorithmic RandomnessPeter Grünwald. 320-336 [doi]
- Pattern Recognition and Density Estimation under the General i.i.d. AssumptionIlia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alexander Gammerman. 337-353 [doi]
- A General Dimension for Exact LearningJosé L. Balcázar, Jorge Castro, David Guijarro. 354-367 [doi]
- Data-Dependent Margin-Based Generalization Bounds for ClassificationBalázs Kégl, Tamás Linder, Gábor Lugosi. 368-384 [doi]
- Limitations of Learning via Embeddings in Euclidean Half-SpacesShai Ben-David, Nadav Eiron, Hans-Ulrich Simon. 385-401 [doi]
- Estimating the Optimal Margins of Embeddings in Euclidean Half SpacesJürgen Forster, Niels Schmitt, Hans-Ulrich Simon. 402-415 [doi]
- A Generalized Representer TheoremBernhard Schölkopf, Ralf Herbrich, Alex J. Smola. 416-426 [doi]
- A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in LearningTong Zhang. 427-443 [doi]
- Learning Additive Models Online with Fast Evaluating KernelsMark Herbster. 444-460 [doi]
- Geometric Bounds for Generalization in BoostingShie Mannor, Ron Meir. 461-472 [doi]
- Smooth Boosting and Learning with Malicious NoiseRocco A. Servedio. 473-489 [doi]
- On Boosting with Optimal Poly-Bounded DistributionsNader H. Bshouty, Dmitry Gavinsky. 490-506 [doi]
- Agnostic BoostingShai Ben-David, Philip M. Long, Yishay Mansour. 507-516 [doi]
- A Theoretical Analysis of Query Selection for Collaborative FilteringWee Sun Lee, Philip M. Long. 517-528 [doi]
- On Using Extended Statistical Queries to Avoid Membership QueriesNader H. Bshouty, Vitaly Feldman. 529-545 [doi]
- Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership QueriesNader H. Bshouty, Nadav Eiron. 546-557 [doi]
- On Learning Monotone DNF under Product DistributionsRocco A. Servedio. 558-573 [doi]
- Learning Regular Sets with an Incomplete Membership OracleNader H. Bshouty, Avi Owshanko. 574-588 [doi]
- Learning Rates for Q-LearningEyal Even-Dar, Yishay Mansour. 589-604 [doi]
- Optimizing Average Reward Using Discounted RewardsSham Kakade. 605-615 [doi]
- Bounds on Sample Size for Policy Evaluation in Markov EnvironmentsLeonid Peshkin, Sayan Mukherjee. 616-630 [doi]