COLT A*

52 papers

YearTitle / Authors
200821st Annual Conference on Learning Theory - COLT 2008, Helsinki, Finland, July 9-12, 2008
Rocco A. Servedio, Tong Zhang
2008A Query Algorithm for Agnostically Learning DNF?.
Parikshit Gopalan, Adam Kalai, Adam R. Klivans
2008Adapting to a Changing Environment: the Brownian Restless Bandits.
Aleksandrs Slivkins, Eli Upfal
2008Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains.
Andrey Bernstein, Nahum Shimkin
2008Adaptive Hausdorff Estimation of Density Level Sets.
Aarti Singh, Robert D. Nowak, Clayton D. Scott
2008Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions.
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
2008An Efficient Reduction of Ranking to Classification.
Nir Ailon, Mehryar Mohri
2008An Information Theoretic Framework for Multi-view Learning.
Karthik Sridharan, Sham M. Kakade
2008Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions.
Kamalika Chaudhuri, Satish Rao
2008Combinatorial Prediction Markets.
Robin Hanson
2008Combining Expert Advice Efficiently.
Wouter M. Koolen, Steven de Rooij
2008Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization.
Jacob D. Abernethy, Elad Hazan, Alexander Rakhlin
2008Concentration Inequalities.
Gábor Lugosi
2008Density Estimation in Linear Time.
Satyaki Mahalanabis, Daniel Stefankovic
2008Dimension and Margin Bounds for Reflection-invariant Kernels.
Thorsten Doliwa, Michael Kallweit, Hans Ulrich Simon
2008Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning.
Shai Ben-David, Tyler Lu, Dávid Pál
2008Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs.
Elad Hazan, Satyen Kale
2008Finding Metric Structure in Information Theoretic Clustering.
Kamalika Chaudhuri, Andrew McGregor
2008Geometric & Topological Representations of Maximum Classes with Applications to Sample Compression.
J. Hyam Rubinstein, Benjamin I. P. Rubinstein
2008High-Probability Regret Bounds for Bandit Online Linear Optimization.
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham M. Kakade, Alexander Rakhlin, Ambuj Tewari
2008How Local Should a Learning Method Be?.
Alon Zakai, Yaacov Ritov
2008Improved Guarantees for Learning via Similarity Functions.
Maria-Florina Balcan, Avrim Blum, Nathan Srebro
2008Injective Hilbert Space Embeddings of Probability Measures.
Bharath K. Sriperumbudur, Arthur Gretton, Kenji Fukumizu, Gert R. G. Lanckriet, Bernhard Schölkopf
2008Learning Acyclic Probabilistic Circuits Using Test Paths.
Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin
2008Learning Coordinate Gradients with Multi-Task Kernels.
Yiming Ying, Colin Campbell
2008Learning Mixtures of Product Distributions Using Correlations and Independence.
Kamalika Chaudhuri, Satish Rao
2008Learning Random Monotone DNF Under the Uniform Distribution.
Linda Sellie
2008Learning Rotations.
Adam M. Smith, Manfred K. Warmuth
2008Learning from Collective Behavior.
Michael J. Kearns, Jennifer Wortman
2008Learning in the Limit with Adversarial Disturbances.
Constantine Caramanis, Shie Mannor
2008Linear Algorithms for Online Multitask Classification.
Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile
2008Minimizing Wide Range Regret with Time Selection Functions.
Subhash Khot, Ashok Kumar Ponnuswami
2008Model Selection and Stability in k-means Clustering.
Ohad Shamir, Naftali Tishby
2008More Efficient Internal-Regret-Minimizing Algorithms.
Amy Greenwald, Zheng Li, Warren Schudy
2008On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms.
Shai Shalev-Shwartz, Yoram Singer
2008On the Margin Explanation of Boosting Algorithms.
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua Zhou, Jufu Feng
2008On the Power of Membership Queries in Agnostic Learning.
Vitaly Feldman
2008On-line Sequential Bin Packing.
András György, Gábor Lugosi, György Ottucsák
2008Online Learning of Maximum p-Norm Margin Classifiers with Bias.
Kosuke Ishibashi, Kohei Hatano, Masayuki Takeda
2008Optimal Stragies and Minimax Lower Bounds for Online Convex Games.
Jacob D. Abernethy, Peter L. Bartlett, Alexander Rakhlin, Ambuj Tewari
2008Polynomial Regression under Arbitrary Product Distributions.
Eric Blais, Ryan O'Donnell, Karl Wimmer
2008Regret Bounds for Sleeping Experts and Bandits.
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yogeshwer Sharma
2008Relating Clustering Stability to Properties of Cluster Boundaries.
Shai Ben-David, Ulrike von Luxburg
2008Sparse Recovery in Large Ensembles of Kernel Machines On-Line Learning and Bandits.
Vladimir Koltchinskii, Ming Yuan
2008Stochastic Linear Optimization under Bandit Feedback.
Varsha Dani, Thomas P. Hayes, Sham M. Kakade
2008Teaching Dimensions based on Cooperative Learning.
Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich
2008The Catch-Up Phenomenon in Bayesian Inference.
Peter Grunwald
2008The Learning Power of Evolution.
Vitaly Feldman, Leslie G. Valiant
2008The True Sample Complexity of Active Learning.
Maria-Florina Balcan, Steve Hanneke, Jennifer Wortman
2008Time Varying Undirected Graphs.
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman
2008Unsupervised Learning for Natural Language Processing.
Dan Klein
2008When Random Play is Optimal Against an Adversary.
Jacob D. Abernethy, Manfred K. Warmuth, Joel Yellin