77 search results - page 13 / 16 » Sample Size Lower Bounds in PAC Learning by Algorithmic Comp... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
TNN
2010
13 years 2 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
VIS
2004
IEEE
14 years 8 months ago
2004
IEEE
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...