Sciweavers

31 search results - page 1 / 7
» Sampled fictitious play for approximate dynamic programming
Sort
View
COR
2011
12 years 8 months ago
Sampled fictitious play for approximate dynamic programming
Marina A. Epelman, Archis Ghate, Robert L. Smith
NIPS
2007
13 years 5 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens
PLDI
2012
ACM
11 years 7 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
13 years 11 months ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar
ICLP
2010
Springer
13 years 8 months ago
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Daan Fierens