2711 search results - page 173 / 543 » Convergence of the Wake-Sleep Algorithm |
152
click to vote
SIAMSC
2011
14 years 11 months ago
2011
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
129
click to vote
WSC
2007
15 years 6 months ago
2007
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
117
click to vote
WSC
2004
15 years 5 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
117
click to vote
FSS
2006
15 years 4 months ago
2006
Convergence of blind delayed source separation algorithms, which use constant learning rates, is known to be slow. We propose a fuzzy logic based approach to adaptively select the...
123
click to vote
TWC
2008
15 years 4 months ago
2008
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...