Sciweavers

92 search results - page 15 / 19
» A General Convergence Method for Reinforcement Learning in t...
Sort
View
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
12 years 10 months ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
NIPS
1992
13 years 7 months ago
Hidden Markov Model} Induction by Bayesian Model Merging
This paper describes a technique for learning both the number of states and the topologyof Hidden Markov Models from examples. The inductionprocess starts with the most specific m...
Andreas Stolcke, Stephen M. Omohundro
IJON
2007
184views more  IJON 2007»
13 years 6 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
13 years 10 months ago
Efficiently Learning Mixtures of Two Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
TNN
1998
100views more  TNN 1998»
13 years 6 months ago
A dynamical system perspective of structural learning with forgetting
—Structural learning with forgetting is an established method of using Laplace regularization to generate skeletal artificial neural networks. In this paper we develop a continu...
D. A. Miller, J. M. Zurada