Sciweavers

COLT
2010
Springer
13 years 1 months ago
Learning with Global Cost in Stochastic Environments
We consider an online learning setting where at each time step the decision maker has to choose how to distribute the future loss between k alternatives, and then observes the los...
Eyal Even-Dar, Shie Mannor, Yishay Mansour
COLT
2010
Springer
13 years 1 months ago
Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Alekh Agarwal, Ofer Dekel, Lin Xiao
COLT
2010
Springer
13 years 1 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
COLT
2010
Springer
13 years 1 months ago
Quantum Predictive Learning and Communication Complexity with Single Input
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
Dmitry Gavinsky
COLT
2010
Springer
13 years 1 months ago
Sparse Recovery in Convex Hulls of Infinite Dictionaries
Let S be an arbitrary measurable space, T R and (X, Y ) be a random couple in S
Vladimir Koltchinskii, Stas Minsker
COLT
2010
Springer
13 years 1 months ago
Voting Paradoxes
Noga Alon
COLT
2010
Springer
13 years 1 months ago
The Convergence Rate of AdaBoost
Abstract. We pose the problem of determining the rate of convergence at which AdaBoost minimizes exponential loss. Boosting is the problem of combining many "weak," high-...
Robert E. Schapire
COLT
2010
Springer
13 years 1 months ago
Theoretical Justification of Popular Link Prediction Heuristics
Purnamrita Sarkar, Deepayan Chakrabarti, Andrew W....
COLT
2010
Springer
13 years 1 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
COLT
2010
Springer
13 years 1 months ago
The Online Loop-free Stochastic Shortest-Path Problem
Gergely Neu, András György, Csaba Szep...