908 search results - page 37 / 182 » Stochastic Finite Learning |
ISCIS
2003
Springer
14 years 1 months ago
2003
Springer
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
NIPS
1993
13 years 10 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 ...
JSAI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...