196 search results - page 4 / 40 » New Algorithms for Optimal Online Checkpointing |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
ML
2007
ACM
13 years 6 months ago
2007
ACM
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
ECCC
2006
13 years 7 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
ECCC
2007
13 years 7 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
ASIAN
2004
Springer
14 years 23 days ago
2004
Springer
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...