Sciweavers

6393 search results - page 986 / 1279
» Randomized Algorithms on the Mesh
Sort
View
162
Voted
NIPS
2001
15 years 6 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
135
Voted
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 6 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
UAI
2004
15 years 6 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...
UAI
2004
15 years 6 months ago
From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
Firas Hamze, Nando de Freitas
138
Voted
CEC
2010
IEEE
15 years 5 months ago
On the role of modularity in evolutionary dynamic optimisation
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...
Philipp Rohlfshagen, Xin Yao