34 search results - page 7 / 7 » colt 2005 |
COLT
2005
Springer
14 years 7 days ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
COLT
2005
Springer
13 years 8 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
COLT
2005
Springer
14 years 7 days ago
2005
Springer
The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of algorithmic learning? Returning to wrong conjectures complements t...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
In the multi-view learning paradigm, the input variable is partitioned into two different views X1 and X2 and there is a target variable Y of interest. The underlying assumption i...