Sciweavers

1974 search results - page 234 / 395
» Online learning in online auctions
Sort
View
COLT
2010
Springer
15 years 4 months ago
Robust Selective Sampling from Single and Multiple Teachers
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...
Ofer Dekel, Claudio Gentile, Karthik Sridharan
ICASSP
2011
IEEE
14 years 10 months ago
Multiple instance tracking based on hierarchical maximizing bag's margin boosting
In online tracking, the tracker evolves to reflect variations in object appearance and surroundings. This updating process is formulated as a supervised learning problem, thus a ...
Chunxiao Liu, Guijin Wang, Xinggang Lin, Bobo Zeng
UAI
2008
15 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 6 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná
CCS
2009
ACM
16 years 1 months ago
A framework for quantitative security analysis of machine learning
We propose a framework for quantitative security analysis of machine learning methods. Key issus of this framework are a formal specification of the deployed learning model and a...
Pavel Laskov, Marius Kloft