Abstract is missing.
- Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract)Paolo Santi, Vincent Conitzer, Tuomas Sandholm. 1-16 [doi]
- Graphical EconomicsSham Kakade, Michael J. Kearns, Luis E. Ortiz. 17-32 [doi]
- Deterministic Calibration and Nash EquilibriumSham Kakade, Dean P. Foster. 33-48 [doi]
- Reinforcement Learning for Average Reward Zero-Sum GamesShie Mannor. 49-63 [doi]
- Polynomial Time Prediction Strategy with Almost Optimal Mistake ProbabilityNader H. Bshouty. 64-76 [doi]
- Minimizing Regret with Label Efficient PredictionNicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz. 77-92 [doi]
- Regret Bounds for Hierarchical Classification with Linear-Threshold FunctionsNicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile. 93-108 [doi]
- Online Geometric Optimization in the Bandit Setting Against an Adaptive AdversaryH. Brendan McMahan, Avrim Blum. 109-123 [doi]
- Learning Classes of Probabilistic AutomataFrançois Denis, Yann Esposito. 124-139 [doi]
- On the Learnability of E-pattern Languages over Small AlphabetsDaniel Reidenbach. 140-154 [doi]
- Replacing Limit Learners with Equally Powerful One-Shot Query LearnersSteffen Lange, Sandra Zilles. 155-169 [doi]
- Concentration Bounds for Unigrams Language ModelEvgeny Drukh, Yishay Mansour. 170-185 [doi]
- Inferring Mixtures of Markov ChainsTugkan Batu, Sudipto Guha, Sampath Kannan. 186-199 [doi]
- PExact = Exact LearningDmitry Gavinsky, Avi Owshanko. 200-209 [doi]
- Learning a Hidden Graph Using O(log n) Queries Per EdgeDana Angluin, Jiang Chen. 210-223 [doi]
- Toward Attribute Efficient Learning of Decision Lists and ParitiesAdam R. Klivans, Rocco A. Servedio. 224-238 [doi]
- Learning Over Compact Metric SpacesHa Quang Minh, Thomas Hofmann. 239-254 [doi]
- A Function Representation for Learning in Banach SpacesCharles A. Micchelli, Massimiliano Pontil. 255-269 [doi]
- Local Complexities for Empirical Risk MinimizationPeter L. Bartlett, Shahar Mendelson, Petra Philips. 270-284 [doi]
- Model Selection by Bootstrap Penalization for ClassificationMagalie Fromont. 285-299 [doi]
- Convergence of Discrete MDL for Sequential PredictionJan Poland, Marcus Hutter. 300-314 [doi]
- On the Convergence of MDL Density EstimationTong Zhang. 315-330 [doi]
- Suboptimal Behavior of Bayes and MDL in Classification Under MisspecificationPeter Grünwald, John Langford. 331-347 [doi]
- Learning Intersections of Halfspaces with a MarginAdam R. Klivans, Rocco A. Servedio. 348-362 [doi]
- A General Convergence Theorem for the Decomposition MethodNikolas List, Hans-Ulrich Simon. 363-377 [doi]
- Oracle Bounds and Exact Algorithm for Dyadic Classification TreesGilles Blanchard, Christin Schäfer, Yves Rozenholc. 378-392 [doi]
- An Improved VC Dimension Bound for Sparse PolynomialsMichael Schmitt. 393-407 [doi]
- A New PAC Bound for Intersection-Closed Concept ClassesPeter Auer, Ronald Ortner. 408-414 [doi]
- A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median ClusteringShai Ben-David. 415-426 [doi]
- Data Dependent Risk Bounds for Hierarchical Mixture of Experts ClassifiersArik Azran, Ron Meir. 427-441 [doi]
- Consistency in Models for Communication Constrained Distributed LearningJoel B. Predd, Sanjeev R. Kulkarni, Harold Vincent Poor. 442-456 [doi]
- On the Convergence of Spectral Clustering on Random Samples: The Normalized CaseUlrike von Luxburg, Olivier Bousquet, Mikhail Belkin. 457-471 [doi]
- Performance Guarantees for Regularized Maximum Entropy Density EstimationMiroslav Dudík, Steven J. Phillips, Robert E. Schapire. 472-486 [doi]
- Learning Monotonic Linear FunctionsAdam Kalai. 487-501 [doi]
- Boosting Based on a Smooth MarginCynthia Rudin, Robert E. Schapire, Ingrid Daubechies. 502-517 [doi]
- Bayesian Networks and Inner Product SpacesAtsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans-Ulrich Simon. 518-533 [doi]
- An Inequality for Nearly Log-Concave Distributions with Applications to LearningConstantine Caramanis, Shie Mannor. 534-548 [doi]
- Bayes and Tukey Meet at the Center PointRan Gilad-Bachrach, Amir Navot, Naftali Tishby. 549-563 [doi]
- Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic ResultsPeter L. Bartlett, Ambuj Tewari. 564-578 [doi]
- A Statistical Mechanics Analysis of Gram Matrix Eigenvalue SpectraDavid C. Hoyle, Magnus Rattray. 579-593 [doi]
- Statistical Properties of Kernel Principal Component AnalysisLaurent Zwald, Olivier Bousquet, Gilles Blanchard. 594-608 [doi]
- Kernelizing Sorting, Permutation, and Alignment for Minimum Volume PCATony Jebara. 609-623 [doi]
- Regularization and Semi-supervised Learning on Large GraphsMikhail Belkin, Irina Matveeva, Partha Niyogi. 624-638 [doi]
- Perceptron-Like Performance for Intersections of HalfspacesAdam R. Klivans, Rocco A. Servedio. 639-640 [doi]
- The Optimal PAC AlgorithmManfred K. Warmuth. 641-642 [doi]
- The Budgeted Multi-armed Bandit ProblemOmid Madani, Daniel J. Lizotte, Russell Greiner. 643-645 [doi]