3050 search results - page 201 / 610 » On-line Algorithms in Machine Learning |
135
click to vote
ALT
2006
Springer
16 years 1 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
111
click to vote
ALT
2007
Springer
16 years 1 months ago
2007
Springer
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
139
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
115
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...
137
click to vote
ALT
2004
Springer
16 years 1 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...