17 citations · 54 across the 6 of their papers we have counts for
4 papers · 2 filters
Improving Gradient Estimation by Incorporating Sensor Data
Gregory Lawrence, Stuart Russell
An efficient policy search algorithm should estimate the local gradient of the objective function, with respect to the policy parameters, from as few trials as possible. Whereas mo…
RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains
Emma Brunskill, Stuart Russell
Despite the intractability of generic optimal partially observable Markov decision process planning, there exist important problems that have highly structured models. Previous res…
Gibbs Sampling in Open-Universe Stochastic Languages
Nimar S. Arora, Rodrigo de Salvo Braz, Erik B. Sudderth +1
Languages for open-universe probabilistic models (OUPMs) can represent situations with an unknown number of objects and iden- tity uncertainty. While such cases arise in a wide ran…
A temporally abstracted Viterbi algorithm
Shaunak Chatterjee, Stuart Russell
Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. Previous work on coarse-to-fine dynamic programming (CFDP) has demo…