Sciweavers

COLT
2007
Springer
15 years 6 months ago
Regret to the Best vs. Regret to the Average
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, ...
COLT
2007
Springer
15 years 4 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
COLT
2007
Springer
15 years 6 months ago
On-Line Estimation with the Multivariate Gaussian Distribution
We consider on-line density estimation with the multivariate Gaussian distribution. In each of a sequence of trials, the learner must posit a mean µ and covariance Σ; the learner...
Sanjoy Dasgupta, Daniel Hsu
COLT
2007
Springer
15 years 6 months ago
How Good Is a Kernel When Used as a Similarity Measure?
Recently, Balcan and Blum [1] suggested a theory of learning based on general similarity functions, instead of positive semi-definite kernels. We study the gap between the learnin...
Nathan Srebro
COLT
2007
Springer
15 years 6 months ago
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
Peter Auer, Ronald Ortner, Csaba Szepesvári
Machine Learning
Top of PageReset Settings