Abstract is missing.
- Random Multivariate Search TreesLuc Devroye. 1 [doi]
- On Learning and LogicGyörgy Turán. 2-3 [doi]
- Predictions as Statements and DecisionsVladimir Vovk. 4 [doi]
- A Sober Look at Clustering StabilityShai Ben-David, Ulrike von Luxburg, Dávid Pál. 5-19 [doi]
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation AssumptionJon Feldman, Rocco A. Servedio, Ryan O Donnell. 20-34 [doi]
- Stable Transductive LearningRan El-Yaniv, Dmitry Pechyony. 35-49 [doi]
- Uniform Convergence of Adaptive Graph-Based RegularizationMatthias Hein. 50-64 [doi]
- The Rademacher Complexity of Linear Transformation ClassesAndreas Maurer. 65-78 [doi]
- Function Classes That Approximate the Bayes RiskIngo Steinwart, Don R. Hush, Clint Scovel. 79-93 [doi]
- Functional Classification with Margin ConditionsMagalie Fromont, Christine Tuleau. 94-108 [doi]
- Significance and Recovery of Block Structures in Binary Matrices with NoiseXing Sun, Andrew B. Nobel. 109-122 [doi]
- Maximum Entropy Distribution Estimation with Generalized RegularizationMiroslav Dudík, Robert E. Schapire. 123-138 [doi]
- Unifying Divergence Minimization and Statistical Inference Via Convex DualityYasemin Altun, Alexander J. Smola. 139-153 [doi]
- Mercer s Theorem, Feature Maps, and SmoothingHa Quang Minh, Partha Niyogi, Yuan Yao. 154-168 [doi]
- Learning Bounds for Support Vector Machines with Learned KernelsNathan Srebro, Shai Ben-David. 169-183 [doi]
- On Optimal Learning Algorithms for Multiplicity AutomataLaurence Bisht, Nader H. Bshouty, Hanna Mazzawi. 184-198 [doi]
- Exact Learning Composed Classes with a Small Number of MistakesNader H. Bshouty, Hanna Mazzawi. 199-213 [doi]
- DNF Are Teachable in the Average CaseHomin K. Lee, Rocco A. Servedio, Andrew Wan. 214-228 [doi]
- Teaching Randomized LearnersFrank J. Balbach, Thomas Zeugmann. 229-243 [doi]
- Memory-Limited U-Shaped LearningLorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan. 244-258 [doi]
- On Learning Languages from Positive Data and a Limited Number of Short CounterexamplesSanjay Jain, Efim B. Kinber. 259-273 [doi]
- Learning Rational Stochastic LanguagesFrançois Denis, Yann Esposito, Amaury Habrard. 274-288 [doi]
- Parent Assignment Is Hard for the MDL, AIC, and NML CostsMikko Koivisto. 289-303 [doi]
- Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of AttentionJeffrey C. Jackson. 304-318 [doi]
- Discriminative Learning Can Succeed Where Generative Learning FailsPhilip M. Long, Rocco A. Servedio. 319-334 [doi]
- Improved Lower Bounds for Learning Intersections of HalfspacesAdam R. Klivans, Alexander A. Sherstov. 335-349 [doi]
- Efficient Learning Algorithms Yield Circuit Lower BoundsLance Fortnow, Adam R. Klivans. 350-363 [doi]
- Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise ConditionGuillaume Lecué. 364-378 [doi]
- Aggregation and Sparsity Via ::::l::::::1:: Penalized Least SquaresFlorentina Bunea, Alexandre B. Tsybakov, Marten H. Wegkamp. 379-391 [doi]
- A Randomized Online Learning Algorithm for Better Variance ControlJean-Yves Audibert. 392-407 [doi]
- Online Learning with Variable Stage DurationShie Mannor, Nahum Shimkin. 408-422 [doi]
- Online Learning Meets Optimization in the DualShai Shalev-Shwartz, Yoram Singer. 423-437 [doi]
- Online Tracking of Linear SubspacesKoby Crammer. 438-452 [doi]
- Online Multitask LearningOfer Dekel, Philip M. Long, Yoram Singer. 453-467 [doi]
- The Shortest Path Problem Under Partial MonitoringAndrás György, Tamás Linder, György Ottucsák. 468-482 [doi]
- Tracking the Best Hyperplane with a Simple Budget PerceptronNicolò Cesa-Bianchi, Claudio Gentile. 483-498 [doi]
- Logarithmic Regret Algorithms for Online Convex OptimizationElad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal. 499-513 [doi]
- Online Variance MinimizationManfred K. Warmuth, Dima Kuzmin. 514-528 [doi]
- Online Learning with ConstraintsShie Mannor, John N. Tsitsiklis. 529-543 [doi]
- Continuous Experts and the Binning AlgorithmJacob Abernethy, John Langford, Manfred K. Warmuth. 544-558 [doi]
- Competing with Wild Prediction RulesVladimir Vovk. 559-573 [doi]
- Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample PathAndrás Antos, Csaba Szepesvári, Rémi Munos. 574-588 [doi]
- Ranking with a P-Norm PushCynthia Rudin. 589-604 [doi]
- Subset Ranking Using RegressionDavid Cossock, Tong Zhang. 605-619 [doi]
- Active Sampling for Multiple Output IdentificationShai Fine, Yishay Mansour. 620-634 [doi]
- Improving Random Projections Using Marginal InformationPing Li, Trevor Hastie, Kenneth Ward Church. 635-649 [doi]
- Efficient Algorithms for General Active LearningClaire Monteleoni. 650-652 [doi]
- Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear ConstraintsManfred K. Warmuth. 653-654 [doi]