1206 search results - page 33 / 242 » Convergence analysis of online algorithms |
NIPS
2007
14 years 11 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
85
Voted
NIPS
2008
14 years 11 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
127
click to vote
JMLR
2012
13 years 2 days ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
ICONIP
2008
14 years 11 months ago
2008
Abstract. While injecting fault during training has long been demonstrated as an effective method to improve fault tolerance of a neural network, not much theoretical work has been...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...