Sciweavers

1077 search results - page 86 / 216
» Approximate reduction of dynamic systems
Sort
View
TPHOL
2000
IEEE
15 years 8 months ago
Proving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
Catherine Dubois
UAI
1998
15 years 5 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
ATAL
2007
Springer
15 years 10 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
168
Voted
ATAL
2005
Springer
15 years 9 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
CDC
2008
IEEE
157views Control Systems» more  CDC 2008»
15 years 10 months ago
Balancing of partially-observed stochastic differential equations
Abstract— We study Balanced Truncation for stochastic differential equations. In doing so, we adopt ideas from large deviations theory and discuss notions of controllability and ...
Carsten Hartmann, Christof Schütte