1974 search results - page 129 / 395 » Online learning in online auctions |
COLT
2010
Springer
13 years 8 months ago
2010
Springer
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...
COMBINATORICA
2010
13 years 7 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
JMLR
2010
13 years 5 months ago
2010
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
The problem of signature verification is considered within the bounds of the kernel-based methodology of pattern recognition, more specifically, SVM principle of machine learning....
COLT
2003
Springer
14 years 3 months ago
2003
Springer
This paper extends the game-theoretic notion of internal regret to the case of on-line potfolio selection problems. New sequential investment strategies are designed to minimize th...