835 search results - page 15 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
ML
1998
ACM
13 years 10 months ago
1998
ACM
We review the application of statistical mechanics methods to the study of online learning of a drifting concept in the limit of large systems. The model where a feed-forward netwo...
CDC
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— In this paper we consider the problem of optimizing over the switching times for a multi-modal dynamic system when the complete cost-to-go is not available. The instant...
COLT
2010
Springer
13 years 8 months ago
2010
Springer
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...
NIPS
2001
13 years 11 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
WOSS
2004
ACM
14 years 3 months ago
2004
ACM
