COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The geometry of optimal experiment design for vector-valued Ornstein-Uhlenbeck processes.
The geometry of optimal experiment design for vector-valued Ornstein-Uhlenbeck processes.Add to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. SNA - Theoretical foundations for statistical network analysis Ornstein-Uhlenbeck processes are commonly used as models in engineering, biology and finance. Consider the estimation of the state of such processes from linear, noisy measurements; the Kalman filter is known to be the minimum mean square error estimator when the measurement noise is Gaussian. We address here how to design the measurements that minimize the error afforded by the Kalman filter. This problem of optimal experiment design, which is almost as old as the Kalman filter itself, is however not convex. As a consequence, many ad hoc methods have been used over the years to solve it. We show in this talk how a geometric approach allows us to characterize and obtain the optimal designs exactly. This optimal design yields the lowest possible estimation error from linear measurements with a fixed signal to noise ratio. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsSocial Psychology Seminar Series (SPSS) baz21 science lists Gates Distinguished Lecture Series Genetics Seminar Type the title of a new list here Arrol Adam Lecture SeriesOther talksNo interpretation of probability Assessment of data completeness in the National Cancer Registry and the impact on the production of Cancer Survival Statistics Train and equip: British overseas security assistance in the Cold War Global South Designer Babies or Children of Frankenstein? Genome Editing and its Side Effects Polynomial approximation of high-dimensional functions on irregular domains |