Sciweavers

701 search results - page 95 / 141
» Self Bounding Learning Algorithms
Sort
View
COLT
2007
Springer
14 years 1 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
COLT
2000
Springer
13 years 12 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...
COLT
2006
Springer
13 years 11 months ago
Online Learning with Constraints
In this paper, we study a sequential decision making problem. The objective is to maximize the total reward while satisfying constraints, which are defined at every time step. The...
Shie Mannor, John N. Tsitsiklis
AAAI
2007
13 years 10 months ago
Learning Equilibrium in Resource Selection Games
We consider a resource selection game with incomplete information about the resource-cost functions. All the players know is the set of players, an upper bound on the possible cos...
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
UAI
2004
13 years 9 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby