Sciweavers

30 search results - page 4 / 6
» Bayesian Monte Carlo for the Global Optimization of Expensiv...
Sort
View
UAI
2000
13 years 7 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
ANOR
2007
92views more  ANOR 2007»
13 years 6 months ago
Portfolio selection with probabilistic utility
We present a novel portfolio selection technique, which replaces the traditional maximization of the utility function with a probabilistic approach inspired by statistical physics....
Robert Marschinski, Pietro Rossi, Massimo Tavoni, ...
CVPR
2000
IEEE
14 years 8 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
AE
2005
Springer
13 years 12 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
13 years 11 months ago
An Improved Diversity Mechanism for Solving Constrained Optimization Problems Using a Multimembered Evolution Strategy
This paper presents an improved version of a simple evolution strategy (SES) to solve global nonlinear optimization problems. As its previous version, the approach does not require...
Efrén Mezura-Montes, Carlos A. Coello Coell...