How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Identifiability and approximation bias in computational inference — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Approximate Bayesian computation and summary-based inference
- Areas of Elementary Plane Figures
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Identifiability and approximation bias in computational inference
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Laplace approximation and deterministic quadrature
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed effects and longitudinal models
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- Statistical, resampling, simulation, and numerical error ledger
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Synthetic likelihood and indirect inference
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Variational inference and the evidence lower bound
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
Examples
The examples use the exact target and metric conventions from the companion A page. They isolate five distinct mechanisms: local curvature overlooks a second posterior mode; optimizing within a mean-field family can lose dependence; matching only Gaussian summary moments can change a synthetic-likelihood posterior; a nonconstant summary can have a parameter-independent law; and positive tolerance changes even an identity-summary target.
All finite probability calculations give explicit sample spaces, probability weights, priors, observed data, acceptance events, and posterior normalizers. ABC rejection output is identified with its tolerance-conditioned target only under the supplier theorem's IID premise and positive-acceptance condition. The Laplace example assumes Countable Choice through its Gaussian and Lebesgue change-of-variables suppliers; its total-variation comparison concerns the full posterior and a single-mode Gaussian on the common real parameter space.
The Gaussian mean-field example uses its supplied reference area measure and its induced length measure; its compact Darboux and Gaussian moment calculations add no choice axiom.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A full-rank local Hessian does not capture both posterior modes
Statement refuted
A nondegenerate local Hessian at one mode does not by itself ensure that a one-mode Laplace Gaussian approximates the full posterior law in total variation, even when the full-data model identifies the parameter.
Facts & Assumptions
Given: Assume Countable Choice. Let with its Borel sigma-algebra, let be an integer, and set Give the data space its power-set sigma-algebra and counting measure, and define the th experiment by Use the uniform prior on Borel , observe in the th experiment, and use the likelihood version . Let be the exact target and let be its image on under the inclusion . Define the one-mode Laplace proxy on by the density
Countable Choice means every countable family of nonempty sets has a choice function. The Axiom of Countable Choice ()
A fixed measurable likelihood version and finite positive evidence define ; the likelihood version here is the density relative to the stated counting measure. Exact inferential targets and approximation chains Dominated statistical experiments A measurable function between measurable spaces
In the parametric model, observational equivalence means equality of sampling laws, and the identity estimand is identifiable when equivalent parameters agree. Statistical experiments Parametric statistical models Observational equivalence Estimands on a statistical model Identifiability of an estimand
The cited Laplace asymptotic theorem assumes a unique interior global maximizer in addition to a positive-definite negative Hessian and local and global domination conditions. Laplace asymptotic under a unique nondegenerate interior maximum
Under Countable Choice, the one-dimensional Gaussian integral gives , and the positive-definite Gaussian integral lemma includes its normalization. Gaussian integral for a positive-definite quadratic form
Under Countable Choice, an affine diffeomorphism changes a nonnegative Lebesgue integral by its absolute Jacobian. A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
For increasing measurable sets, measure of the union is the supremum of their measures. Continuity from below for measures
Total variation is the supremum of event-probability differences. Total variation distance for probability laws
Borel subsets of Euclidean space are Lebesgue measurable, bounded boxes have their usual volume, and the Borel sigma-algebra on is the trace of the one on . Assuming countable choice, every Borel subset of is Lebesgue measurable A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included The Borel sigma-algebra of a subspace is the trace of the ambient Borel sigma-algebra
The real numbers form a complete ordered field, so their natural numbers are unbounded; and , and squaring is strictly increasing on nonnegative numbers. Uniqueness of nonnegative square roots therefore makes the square root order-preserving. The Cauchy-sequence reals have the least-upper-bound property The reals form a totally ordered field Every complete ordered field is Archimedean Basic properties of the absolute value Squaring is monotone on the nonnegatives Square roots exist: a unique with ; the positives are
Counterexample
Given: The hypotheses and explicit model in Facts & Assumptions.
On , , so . Also , hence ; the three entries are nonnegative and sum to one. Thus each is a probability measure on . Since is injective, implies , so the identity estimand is identifiable by [F2].
The Borel sets of are Lebesgue measurable, , and is continuous and satisfies . Therefore is a probability measure, is measurable, and . By [F1], is the exact posterior target with density proportional to relative to .
The phase has exactly two global maxima, at , because exactly there and is positive elsewhere. Direct differentiation gives , so ; each local negative Hessian is full rank, but [F3]'s unique-maximum hypothesis fails. Writing gives , so its quadratic term at is . The one-mode Laplace density is therefore proportional to , exactly the stated , and integrates to one by [A1, F4].
Under the affine change , [F5] sends to the standard normal probability of . These sets are increasing. Given any , choose by [F9]; positivity and monotonicity of the square root then give , so their union is all of . Continuity from below [F6] therefore gives .
Define on ; it is a nonnegative even Borel function. Apply [F5] to the reflection diffeomorphism on , using the function : the unnormalized integrals of over and are equal. The singleton has Lebesgue measure zero by [F8], so these two integrals split the prior-weighted posterior normalizer equally. Thus .
Using event in [F7], , whose right side tends to by steps 2.1 and 2.2. Thus , proving that the local curvature at one mode misses persistent posterior mass at the other.
An optimized mean-field law can lose posterior correlation
Statement refuted
Optimizing an independent Gaussian mean-field family by the evidence lower bound need not recover the marginal variances or dependence structure of the exact inferential target.
Facts & Assumptions
Given: The reference area measure is supplied, as in the example's Lebesgue integration setting. Its Borel restriction has the half-open rectangle volume formula. Define for Borel ; this supplies the needed length measure without an existence or completion construction. On with the supplied area measure, put and define the target density This target is an exact inferential target by taking prior density , the sample space with for every , and likelihood version . The variational family consists of independent Gaussian factors
A fixed measurable likelihood and positive finite evidence define the exact target; the displayed target density is its prior density when the likelihood is identically one. Exact inferential targets and approximation chains
ELBO admissibility requires support on the target support and finite log integrals, and . Variational family and evidence lower bound
Under the supplied length/area measures' box-volume contract, compact bounded Borel Riemann integrals equal the corresponding measure integrals, and the density has mass one, mean , and variance . The proof uses explicit cutoffs and finite integration by parts and assumes no choice axiom. Gaussian density integrals for supplied length measures
Tonelli applies to nonnegative product-measurable functions on sigma-finite product spaces. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Absolutely integrable functions on sigma-finite product spaces may be integrated in either order. Fubini's theorem for L^1 functions on a sigma-finite product
A nonnegative measurable density defines a measure, which is a probability when its total mass is one. Integrating against that density measure agrees with integrating the product against the base measure. The indefinite integral of a nonnegative measurable function is a measure, Probability measures and probability spaces, Integrating against a density agrees with integrating the product
Sigma-finite factors have a product measure with the rectangle formula. Measures agreeing on a generating pi-system and its increasing finite-mass exhaustion agree everywhere. Rational half-open boxes generate the Euclidean Borel sigma-algebra. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system, For n at least one, open sets, closed sets, compact sets, open balls, boxes, rational open boxes, and rational half-open boxes generate the Borel sigma-algebra on R^n
For , , and derivatives obey the sum and scalar-multiple rules. The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t Sums, scalar multiples, products and quotients: , , , and when
A function differentiable on is continuous there, and the mean value theorem applies on each compact interval with . A function differentiable at is continuous at The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with
Counterexample
Given: The supplied reference measures and explicit target and variational densities above.
Let , so , and write . Countable additivity of the supplied area measure makes a Borel measure, with by rectangle volume. The explicit intervals exhaust and have supplied measure , so the factor measure is sigma-finite. Its product exists by [F7]. It and the supplied agree on half-open boxes by the volume formula and on the finite-mass exhaustion ; [F7] and [F8] identify their Borel measures. All displayed densities and polynomial moment integrands are continuous and hence Borel: inverse images of open sets are open, and inverse-image preservation of sigma-algebra operations gives the Borel assertion. Thus [F8] makes them product-measurable. The compact comparison and Gaussian integral statements in [F3] now apply to these supplied measures. Direct algebra gives . Each inner Gaussian density has mass one by [F3], so Tonelli [F4] proves that has mass one and both marginals . By [F3] and density integration [F6], the marginal means are zero and second moments are one. Since , the cross moment is absolutely integrable. Fubini [F5], [F6] and the mean of in [F3] give . Thus the target has marginal variances and covariance . With likelihood one the evidence is , so [F1] identifies as the exact target.
For and , [F3] supplies the normalized Lebesgue densities and their means and variances . Tonelli [F4] gives total mass one for . The logarithms of and are quadratic; the finite second moments and make their absolute values integrable under . Both densities are everywhere positive, so is admissible by [F2]. Fubini [F5] and [F6] give , , and .
One has and , using the mean and variance in step 2.1. Substituting these expressions and the second moments from step 2.1 into [F2] yields , where is independent of . The mean quadratic equals , so its unique minimum and the ELBO-maximizing means are .
For either variance the variable part is . The identity has derivative and constants have derivative by their difference quotients; [F9] then gives that is differentiable on with . If , the mean value theorem [F10] gives with . If , it gives with . Thus is the unique global maximum. The target variance is and covariance is by step 1.1, whereas the optimizing independent factors have variance and covariance by step 2.1. Thus the unique ELBO optimizer differs from the exact target.
A Gaussian synthetic likelihood can change an exact posterior
Statement refuted
An identifiable discrete summary model's Gaussian synthetic likelihood need not preserve the exact posterior, even when the ideal Gaussian uses the exact first two summary moments.
Facts & Assumptions
Given: Let with equal prior mass and let the summary/data space be with its power-set sigma-algebra. Regard the identity summary as a map into . Define the two sampling laws by and observe . Define the exact posterior from this likelihood, and define the synthetic-likelihood posterior by normalizing the ideal Gaussian synthetic likelihood against the same prior.
An exact target is for an explicitly measurable likelihood and finite positive evidence. Exact inferential targets and approximation chains
A statistic is a measurable map to a declared measurable target, and the ideal synthetic likelihood is the Gaussian density at the observed summary using the exact summary mean and covariance when that covariance is positive definite. Statistics and estimators A measurable function between measurable spaces The Borel sigma-algebra of a topological space Ideal and finite-simulation synthetic likelihood
The identity estimand is identifiable when equal sampling laws imply equal parameter values. Parametric statistical models Observational equivalence Identifiability of an estimand
Under the Axiom of Choice, positive-definite summary covariance supplies the ideal Gaussian density; no equality with the exact summary law is part of that definition. The Axiom of Choice Ideal and finite-simulation synthetic likelihood
Total variation is the event-probability supremum. Total variation distance for probability laws
Counterexample
Given: The finite model and prior in Facts & Assumptions.
Each row is nonnegative and sums to one. The laws differ because whereas ; hence the identity estimand is identifiable by [F3]. The finite identity summary is measurable because the source and target carry their stated power-set and Borel sigma-algebras.
Under , and . Under , the corresponding weighted sums are and . Thus both variances equal , so the one-dimensional covariance is positive definite and the ideal Gaussian synthetic likelihood is defined by [F2], [F4].
The exact likelihoods at are and , so the equal-prior exact posterior mass at is . The ideal Gaussian synthetic likelihoods coincide because their means and variances coincide. Their common positive value cancels in normalization against the equal prior, so the synthetic-likelihood posterior has mass at .
The two posterior measures differ on event by , so their total-variation distance is at least by [F5]. Thus matching the first two moments does not remove this posterior target bias.
A nonconstant summary can lose an identifiable parameter
Statement refuted
Full-data identifiability and nonconstancy of a summary do not imply that the summary retains information about the identifiable parameter or that the ABC target equals the exact posterior.
Facts & Assumptions
Given: Let have equal prior mass, let have the power-set sigma-algebra, and for parameter define Take , observe , and use zero tolerance .
For standard Borel parameter/data spaces and a positive acceptance event, the indicator ABC target is the prior-simulator law conditioned on the closed summary-tolerance ball. Approximate Bayesian computation and the tolerance-conditioned target
A probability kernel assigns a probability measure at each parameter and measurable event probabilities in the parameter; a statistic is a measurable map. Measure kernel and probability kernel Statistics and estimators
Observational equivalence means equality of the full sampling laws, and the identity estimand is identifiable when equivalent parameters must agree. Parametric statistical models Observational equivalence Identifiability of an estimand
A fixed measurable likelihood with finite positive evidence defines the exact target by normalizing its prior-weighted integral. Exact inferential targets and approximation chains
A finite discrete space is standard Borel when its discrete metric is complete and separable and its Borel sigma-algebra is its power set; is standard Borel because its Euclidean metric is complete and is countable and dense. Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric Complete metric space: every Cauchy sequence converges in the space Separability: the existence of an at most countable dense subset Polish spaces are separable completely metrizable spaces Standard Borel spaces and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in is countably infinite The rationals embed densely in the reals
The TV distance is the supremum of event-probability differences. Total variation distance for probability laws
Counterexample
Given: The finite prior, model, summary, observation, and tolerance in Facts & Assumptions.
Put the discrete metric on and . A Cauchy sequence is eventually constant because its tail has pairwise distances below ; each finite space is separable since the whole finite set is a countable dense subset. Every subset is open, so the Borel sigma-algebra is the power set. Thus both are standard Borel by [F5]. The real target is standard Borel by [F5].
The event has probabilities and . Thus the two full-data laws are not observationally equivalent, and the identity parameter is identifiable by [F3].
The full-data likelihood at is under and under . Its prior evidence is , so [F4] gives exact posterior .
For each , exactly two pairs have , each with mass , so is a probability law; because the parameter sigma-algebra is also the power set, the displayed family is a probability kernel. The map is nonconstant, since and , and it is measurable because every subset of the finite source is measurable.
The summary law is Bernoulli under each parameter. The zero-tolerance ball in centered at is , and each parameter has acceptance probability , so prior-predictive acceptance is . Conditioning the equal prior on this event leaves by [F1].
On event the exact posterior gives mass and the zero-tolerance ABC target gives mass . By [F6], their total-variation distance is at least . The full model is identifiable, but the nonconstant summary has parameter-independent law and its ABC target remains the prior.
Positive ABC tolerance changes an identity-summary target
Statement refuted
With the identity summary and positive prior-predictive acceptance probability, the tolerance gives an ABC target whose mass at is , while the exact posterior mass is ; the total-variation distance is exactly .
Facts & Assumptions
Given: Let have equal prior mass, let , and define Give and their discrete sigma-algebras, take into , observe , and set .
The ABC target is the prior-simulator law conditioned on the closed ball event when its prior-predictive probability is positive. Approximate Bayesian computation and the tolerance-conditioned target
If the proposal-simulator pairs are IID and acceptance probability is positive, ABC rejection terminates almost surely and its accepted parameter has exactly the tolerance-conditioned target. ABC rejection returns the tolerance-conditioned posterior
A finite discrete space with its discrete metric is complete and separable, and its Borel sigma-algebra is its power set; a function from this finite measurable space into is measurable because every preimage is a subset of the finite source. Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric Complete metric space: every Cauchy sequence converges in the space Separability: the existence of an at most countable dense subset Polish spaces are separable completely metrizable spaces Standard Borel spaces The Borel sigma-algebra of a topological space
Exact fixed-data posterior probabilities are obtained by normalizing likelihood times prior when evidence is finite and positive. Exact inferential targets and approximation chains
Total variation is the supremum over measurable events. Total variation distance for probability laws
A probability kernel assigns a probability measure at each parameter, and its probabilities of measurable events are measurable functions of the parameter. Measure kernel and probability kernel
Counterexample
Given: The table, equal prior, identity summary, observation, and positive tolerance in Facts & Assumptions.
Each row sums to one and has nonnegative entries, so it defines a probability measure at each parameter. Every event probability is measurable in the finite parameter space, hence the table defines a probability kernel by [F6]. Under the discrete metric a Cauchy sequence is eventually constant (take tail distances below ); each finite set is separable and all of its subsets are open. Hence both are standard Borel. The summary map is measurable to the real Borel sigma-algebra because every preimage is a subset of the finite measurable data space, by [F3].
At observation , the likelihoods are and , so the exact posterior mass at is by [F4]. The closed -ball around is . Its conditional probabilities are and . Therefore the prior-predictive acceptance probability is .
Conditioning the prior-simulator law on this ball gives ABC mass at equal to by [F1]. The exact and ABC posterior masses differ by .
The measurable events in are , , , and . The exact and ABC probabilities agree on and ; on their difference has absolute value , and on it has the same absolute value because both are probability measures. Thus [F5] gives total-variation distance exactly . If the proposal-simulator pairs are IID under the prior-kernel joint law, [F2] identifies this ABC target as the accepted-parameter law; the finite calculations make no additional convergence or efficiency claim.
Sources
- Laplace method for integrals, PHYS 2400 – Mathematical methods for the physical sciences, University of Connecticut
- NIST Digital Library of Mathematical Functions, §2.3(iii), Laplace's Method
- Francis Bach, Approximating Integrals with Laplace's Method
- David M. Blei, Alp Kucukelbir, and Jon D. McAuliffe, Variational Inference: A Review for Statisticians (2017)
- Michael I. Jordan, Zoubin Ghahramani, Tommi S. Jaakkola, and Lawrence K. Saul, An Introduction to Variational Methods for Graphical Models (1999)
- Ronghuo Zheng, Zhiting Hu, and Yuntian Deng, 10-708 Probabilistic Graphical Models, Lecture 13: Variational Inference II (2015)
- Victor M.-H. Ong et al., Variational Bayes with Synthetic Likelihood, Statistics and Computing 28(4), 971–988 (2018)
- Christopher C. Drovandi, Clara Grazian, Kerrie Mengersen, and Christian Robert, Approximating the Likelihood in Approximate Bayesian Computation, Handbook of Approximate Bayesian Computation (2020)
- David T. Frazier, David J. Nott, Christopher Drovandi, and Robert Kohn, Bayesian Inference Using Synthetic Likelihood: Asymptotics and Adjustments, 2019 arXiv preprint arXiv:1902.04827
- Christian P. Robert, Jean-Marie Cornuet, Jean-Michel Marin, and Natesh S. Pillai, Lack of Confidence in Approximate Bayesian Computation Model Choice (2011)
- Jarno Lintusaari et al., Fundamentals and Recent Developments in Approximate Bayesian Computation (2017)
- Paul Fearnhead and Dennis Prangle, Constructing Summary Statistics for Approximate Bayesian Computation: Semi-automatic ABC (2012)
- Michael G. B. Blum, Approximate Bayesian Computation: A Nonparametric Perspective (2010)