Sciweavers

3475 search results - page 142 / 695
» Backbones in Optimization and Approximation
Sort
View
JMLR
2006
143views more  JMLR 2006»
15 years 6 months ago
Geometric Variance Reduction in Markov Chains: Application to Value Function and Gradient Estimation
We study a sequential variance reduction technique for Monte Carlo estimation of functionals in Markov Chains. The method is based on designing sequential control variates using s...
Rémi Munos
GECCO
2006
Springer
142views Optimization» more  GECCO 2006»
15 years 10 months ago
Classifier prediction based on tile coding
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 7 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
ALT
2006
Springer
16 years 3 months ago
Teaching Memoryless Randomized Learners Without Feedback
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Frank J. Balbach, Thomas Zeugmann
CDC
2008
IEEE
16 years 25 days ago
A monotonic algorithm for the optimal control of the Fokker-Planck equation
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...
Guillaume Carlier, Julien Salomon