Sciweavers

1997 search results - page 39 / 400
» On the convergence of Hill's method
Sort
View
JAL
2002
69views more  JAL 2002»
13 years 8 months ago
Rates of convergence for Quicksort
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
Ralph Neininger, Ludger Rüschendorf
ICASSP
2011
IEEE
13 years 6 days ago
Relative proportionate NLMS: Improving convergence for acoustic channel identification
It is known that the proportionate normalized least mean square (PNLMS) algorithm outperforms traditional normalized least mean square(NLMS) algorithm, in terms of fast initial co...
Tao Yu, John H. L. Hansen
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
14 years 2 months ago
Local and global order 3/2 convergence of a surrogate evolutionary algorithm
A Quasi-Monte-Carlo method based on the computation of a surrogate model of the fitness function is proposed, and its convergence at super-linear rate 3/2 is proved under rather ...
Anne Auger, Marc Schoenauer, Olivier Teytaud
JMLR
2006
143views more  JMLR 2006»
13 years 8 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
JMLR
2010
128views more  JMLR 2010»
13 years 7 months ago
On the Rate of Convergence of the Bagged Nearest Neighbor Estimate
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...
Gérard Biau, Frédéric C&eacut...