COLT 2010

48 papers

Active Learning on Trees and Graphs Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella

Adaptive Bound Optimization for Online Convex Optimization H. Brendan McMahan, Matthew J. Streeter

Adaptive Subgradient Methods for Online Learning and Stochastic Optimization John C. Duchi, Elad Hazan, Yoram Singer

Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization Daniel Golovin, Andreas Krause

An Asymptotically Optimal Bandit Algorithm for Bounded Support Models Junya Honda, Akimichi Takemura

Best Arm Identification in Multi-Armed Bandits Jean-Yves Audibert, Sébastien Bubeck, Rémi Munos

Can We Learn to Gamble Efficiently? Jacob D. Abernethy

Causal Markov Condition for Submodular Information Measures Bastian Steudel, Dominik Janzing, Bernhard Schölkopf

Characterization of Linkage-Based Clustering Margareta Ackerman, Shai Ben-David, David Loker

Composite Objective Mirror Descent John C. Duchi, Shai Shalev-Shwartz, Yoram Singer, Ambuj Tewari

Convex Games in Banach Spaces Karthik Sridharan, Ambuj Tewari

Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions Adi Akavia

Efficient Classification for Metric Data Lee-Ad Gottlieb, Leonid Kontorovich, Robert Krauthgamer

Evolution with Drifting Targets Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan

Following the Flattened Leader Wojciech Kotlowski, Peter Grünwald, Steven de Rooij

Forest Density Estimation Anupam Gupta, John D. Lafferty, Han Liu, Larry A. Wasserman, Min Xu

Hedging Structured Concepts Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivinen

Improved Guarantees for Agnostic Learning of Disjunctions Pranjal Awasthi, Avrim Blum, Or Sheffet

Inferring Descriptive Generalisations of Formal Languages Dominik D. Freydenberger, Daniel Reidenbach

Learning Kernel-Based Halfspaces with the Zero-One Loss Shai Shalev-Shwartz, Ohad Shamir, Karthik Sridharan

Learning Rotations with Little Regret Elad Hazan, Satyen Kale, Manfred K. Warmuth

Learning Talagrand DNF Formulas Homin K. Lee

Learning to Create Is as Hard as Learning to Appreciate David Xiao

Learning with Global Cost in Stochastic Environments Eyal Even-Dar, Shie Mannor, Yishay Mansour

Mansour's Conjecture Is True for Random DNF Formulas Adam R. Klivans, Homin K. Lee, Andrew Wan

Nonparametric Bandits with Covariates Philippe Rigollet, Assaf Zeevi

On-Line Variance Minimization in O(n2) per Trial? Elad Hazan, Satyen Kale, Manfred K. Warmuth

Online Learning of Noisy Data with Kernels Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir

Open Loop Optimistic Planning Sébastien Bubeck, Rémi Munos

Open Problem: Analyzing Ant Robot Coverage Sven Koenig

Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback Alekh Agarwal, Ofer Dekel, Lin Xiao

Principal Component Analysis with Contaminated Data: The High Dimensional Case Huan Xu, Constantine Caramanis, Shie Mannor

Quantum Predictive Learning and Communication Complexity with Single Input Dmitry Gavinsky

Ranking with Kernels in Fourier Space Risi Kondor, Marconi S. Barbosa

Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm Sascha Geulen, Berthold Vöcking, Melanie Winkler

Regret Minimization with Concept Drift Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jennifer Wortman Vaughan

Robust Efficient Conditional Probability Estimation John Langford

Robust Hierarchical Clustering Maria-Florina Balcan, Pramod Gupta

Robust Selective Sampling from Single and Multiple Teachers Ofer Dekel, Claudio Gentile, Karthik Sridharan

Robustness and Generalization Huan Xu, Shie Mannor

Sequence Prediction in Realizable and Non-Realizable Cases Daniil Ryabko

Sparse Recovery in Convex Hulls of Infinite Dictionaries Vladimir Koltchinskii, Stas Minsker

Strongly Non-U-Shaped Learning Results by General Techniques John Case, Timo Kötzing

The Convergence Rate of AdaBoost Robert E. Schapire

The Online Loop-Free Stochastic Shortest-Path Problem Gergely Neu, András György, Csaba Szepesvári

Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar, Deepayan Chakrabarti, Andrew W. Moore

Toward Learning Gaussian Mixtures with Arbitrary Separation Mikhail Belkin, Kaushik Sinha

Voting Paradoxes Noga Alon