291 search results - page 22 / 59 » The Convergence of Contrastive Divergences |
141
click to vote
WSC
2004
15 years 7 months ago
2004
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
154
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
135
click to vote
SIAMMAX
2010
15 years 24 days ago
2010
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
139
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
170
click to vote
ICML
2001
IEEE
16 years 6 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...