873 search results - page 9 / 175 » Rates of convergence for Quicksort |
JMLR
2010
13 years 6 months ago
2010
Bagging is a simple way to combine estimates in order to improve their performance. This method, suggested by Breiman in 1996, proceeds by resampling from the original data set, c...
MOC
2002
13 years 8 months ago
2002
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
SIAMJO
2008
13 years 8 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the...
NIPS
2001
13 years 9 months ago
2001
We address two open theoretical questions in Policy Gradient Reinforcement Learning. The first concerns the efficacy of using function approximation to represent the state action ...