Sciweavers

424 search results - page 29 / 85
» Boosted sampling: approximation algorithms for stochastic op...
Sort
View
SAC
2008
ACM
13 years 7 months ago
Bayesian inference for a discretely observed stochastic kinetic model
The ability to infer parameters of gene regulatory networks is emerging as a key problem in systems biology. The biochemical data are intrinsically stochastic and tend to be observ...
Richard J. Boys, Darren J. Wilkinson, Thomas B. L....
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 19 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SIGPRO
2010
73views more  SIGPRO 2010»
13 years 6 months ago
Continuous-time and continuous-discrete-time unscented Rauch-Tung-Striebel smoothers
This article considers the application of the unscented transformation to approximate fixed-interval optimal smoothing of continuous-time non-linear stochastic systems. The propo...
Simo Särkkä
ICML
1999
IEEE
14 years 8 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
NIPS
2001
13 years 9 months ago
Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
Evan Greensmith, Peter L. Bartlett, Jonathan Baxte...