Bernstein-von Mises for Adaptively Collected Data
Kevin Du, Yash Nair, Lucas Janson

TL;DR
This paper extends the Bernstein-von Mises theorem to adaptively collected data, showing Bayesian uncertainty quantification is asymptotically equivalent to frequentist methods under certain conditions, with empirical validation.
Contribution
It is the first to prove Bernstein-von Mises theorem for adaptive data, establishing asymptotic equivalence between Bayesian and frequentist UQ in this setting.
Findings
Bayesian UQ matches frequentist UQ asymptotically when stability holds.
Bayesian UQ is not asymptotically valid when stability fails.
Empirical simulations confirm theoretical results.
Abstract
Uncertainty quantification (UQ) for adaptively collected data, such as that coming from adaptive experiments, bandits, or reinforcement learning, is necessary for critical elements of data collection such as ensuring safety and conducting after-study inference. The data's adaptivity creates significant challenges for frequentist UQ, yet Bayesian UQ remains the same as if the data were independent and identically distributed (i.i.d.), making it an appealing and commonly used approach. Bayesian UQ requires the (correct) specification of a prior distribution while frequentist UQ does not, but for i.i.d. data the celebrated Bernstein-von Mises theorem shows that as the sample size grows, the prior 'washes out' and Bayesian UQ becomes frequentist-valid, implying that the choice of prior need not be a major impediment to Bayesian UQ as it makes no difference asymptotically. This paper for the…
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
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Gaussian Processes and Bayesian Inference · Data Stream Mining Techniques
