Sciweavers

1617 search results - page 219 / 324
» Using Gaussian Processes to Optimize Expensive Functions
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 2 months ago
Runtime analysis of binary PSO
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...
Dirk Sudholt, Carsten Witt
NIPS
2001
15 years 2 months ago
Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
Evan Greensmith, Peter L. Bartlett, Jonathan Baxte...
IJCAI
2001
15 years 2 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
NIPS
1996
15 years 2 months ago
Early Brain Damage
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...
Volker Tresp, Ralph Neuneier, Hans-Georg Zimmerman...
GECCO
2005
Springer
133views Optimization» more  GECCO 2005»
15 years 6 months ago
Parsing and translation of expressions by genetic programming
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
David Jackson