231 search results - page 6 / 47 » Stochastic Optimization is (Almost) as easy as Deterministic... |
AAAI
2000
13 years 8 months ago
2000
Recent research has demonstrated the strong performance of hidden Markov models applied to information extraction--the task of populating database slots with corresponding phrases...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Optimal control and estimation are dual in the LQG setting, as Kalman discovered, however this duality has proven difficult to extend beyond LQG. Here we obtain a more natural...
NIPS
1993
13 years 8 months ago
1993
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
FOCI
2007
IEEE
14 years 1 months ago
2007
IEEE
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
CP
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...