701 search results - page 80 / 141 » Self Bounding Learning Algorithms |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We study the problem of online learning of multiple tasks in parallel. On each online round, the algorithm receives an instance and makes a prediction for each one of the parallel ...