Skip to main content

Statistics

Search results for “”

Results 31 to 32 of 32

Robin Ryder (Imperial College London) – Saddlepoint Monte Carlo and its application to exact Ecological Inference

Date
@ MALL 1, online
Category

Assuming X is a random vector and A a non-invertible matrix, one sometimes need to perform inference while only having access to samples of Y=AX. The corresponding likelihood is typically intractable. One may still be able to perform exact Bayesian inference using a pseudo-marginal sampler, but this requires an unbiased estimator of the intractable likelihood. We propose saddlepoint Monte Carlo, a method for obtaining an unbiased estimate of the density of Y with very low variance, for any model belonging to an exponential family. Our method relies on importance sampling and characteristic functions, with insights brought by the standard saddlepoint approximation scheme with exponential tilting.  We show that saddlepoint Monte Carlo makes it possible to perform exact inference on particularly challenging problems and datasets. We focus on the ecological inference problem, where one observes only aggregates at a fine level. We present in particular a study of the carryover of votes between the two rounds of various French elections, using the finest available data (number of votes for each candidate in about 60,000 polling stations over most of the French territory).

Joint work with Théo Voldoire, Nicolas Chopin, and Guillaume Rateau. Preprint: https://arxiv.org/abs/2410.18243

Andrea Bovo (University of Turin) – An overview on recent results on Stopper vs. Singular-controller games

Date
@ Clothworkers South Building LT 3
Category

We study various formulation of zero-sum games between a singular-controller and a stopper with a finite-time horizon, where the underlying process is a multi-dimensional controlled stochastic differential equation evolving in an unbounded domain. We prove that such games admit a value and present an optimal strategy for the stopper. In some cases, we show the game's value is the maximal solution, in a suitable Sobolev class, of a variational inequality of 'min-max' type with both obstacle and gradient constraint. Under stricter assumptions, we provide an optimal strategy for the controller and establish a connection between the space derivative of the value function and the solution of an optimal stopping problem with absorption.