AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

How good is your Laplace approximation of the Bayesian posterior? Finite-sample computable error bounds for a variety of useful divergences

Mikolaj J. Kasprzak, Ryan Giordano, Tamara Broderick

JMLR 2025 · Learning theory and algorithms › Sample complexity · approach: Optimal mean estimation and subsampling

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use the computable Laplace bounds on posterior mean and variance difference for Poisson likelihood with gamma prior under exponential data (misspecified)MAP-centric Laplace bound · Poisson-gamma, exponential data with mean 10bound vs true difference of means and variances: close to true difference for sample sizes above around 250Improved
smaller condition number of the Hessian matrix (ablation)Laplace error bound · logistic regression with Student's t priorbound tightnessNo clear effect
small or moderate sample size (ablation)Laplace error bound · numerical examplesbound tightnessHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy