A Multi-Index Markov Chain Monte Carlo Method
Ajay Jasra, Kengo Kamatani, Kody Law, Yan Zhou

TL;DR
This paper introduces a modified multi-index MCMC method that efficiently computes expectations for complex stochastic systems with multi-dimensional discretizations, improving over traditional sampling methods.
Contribution
It develops a novel MIMC algorithm that integrates standard MCMC to handle complex probability laws, enhancing efficiency over existing methods.
Findings
Proves a variance reduction theorem for the MIMC method.
Demonstrates the method's effectiveness on a stochastic PDE problem.
Shows improved computational efficiency compared to i.i.d. sampling.
Abstract
In this article we consider computing expectations w.r.t.~probability laws associated to a certain class of stochastic systems. In order to achieve such a task, one must not only resort to numerical approximation of the expectation, but also to a biased discretization of the associated probability. We are concerned with the situation for which the discretization is required in multiple dimensions, for instance in space and time. In such contexts, it is known that the multi-index Monte Carlo (MIMC) method can improve upon i.i.d.~sampling from the most accurate approximation of the probability law. Indeed by a non-trivial modification of the multilevel Monte Carlo (MLMC) method and it can reduce the work to obtain a given level of error, relative to the afore mentioned i.i.d.~sampling and relative even to MLMC. In this article we consider the case when such probability laws are too…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Probabilistic and Robust Engineering Design · Statistical Methods and Inference
