Sciweavers

1974 search results - page 118 / 395
» Online learning in online auctions
Sort
View
ADCM
2007
114views more  ADCM 2007»
13 years 10 months ago
Convergence analysis of online algorithms
In this paper, we are interested in the analysis of regularized online algorithms associated with reproducing kernel Hilbert spaces. General conditions on the loss function and st...
Yiming Ying
WWW
2009
ACM
14 years 10 months ago
Adaptive bidding for display advertising
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...
Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Va...
ITRE
2006
IEEE
14 years 4 months ago
A Knowledge Building Community Constructing a Knowledge Model Using Online Concept Maps
Knowledge models are structured representations of knowledge using symbols to represent pieces of knowledge and relationships between them, while a knowledge building community inv...
Moshe Leiba, Rafi Nachmias
COLT
2008
Springer
13 years 12 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
ALT
2010
Springer
13 years 11 months ago
Optimal Online Prediction in Adversarial Environments
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Peter L. Bartlett