Sciweavers

1822 search results - page 126 / 365
» Risk-Sensitive Online Learning
Sort
View
ADCM
2007
114views more  ADCM 2007»
13 years 8 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
NIPS
2000
13 years 9 months ago
Incremental and Decremental Support Vector Machine Learning
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously se...
Gert Cauwenberghs, Tomaso Poggio
ITRE
2006
IEEE
14 years 2 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 10 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 9 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