University of Cambridge > Talks.cam > Probabilistic Systems, Information, and Inference Group Seminars > Lookahead in Sequential Monte Carlo

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Lookahead in Sequential Monte Carlo

Download to your calendar using vCal

If you have a question about this talk, please contact Rachel Fogg .

Dynamic systems and state space models are widely used in many fields of applications. Most of them are nonlinear and non-Gaussian. Sequential Carlo methods (Monte Carlo filters) have been developed for dealing with such systems efficiently. It is noticed that most of the dynamic systems process strong memory. In such systems, future observations often contain significant amount of information on the current system state. Hence, lookahead (estimation with future observations) can often produce more accurate inferences on the current state. In this talk we present several efficient lookahead Sequential Monte Carlo algorithms that utilize the future information with manageable computational cost. Some theoretical justifications and applications in signal processing will be presented.

This talk is part of the Probabilistic Systems, Information, and Inference Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on Saturdays: 7838.89506173 kWh In-person (venue TBC) Goldsmiths 2, Lecture Theatre, Department of Materials Science & Metallurgy

Other talks

Morning Break Title TBC Optimal metric and approximation of free boundary minimal surfaces Title to be confirmed CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body Nationalising Oil and Knowledge in Iran: Labour, Decolonisation and Colonial Modernity, 1933–51
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity