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.
Ideal and finite-simulation synthetic likelihood
Definition
Let be a statistical experiment and let be a statistic, meaning a measurable map to its declared Borel target as in Statistics and estimators, where is finite. Expectations are Lebesgue integrals under as in Expectation of a nonnegative or integrable random variable, and variances and covariances use centered second moments as in Moments, variance, and covariance on a probability space. For every , assume The binding mean and summary covariance are the pointwise-defined quantities Each covariance entry is finite since and the coordinates are square-integrable. The matrix is symmetric and positive semidefinite because for , No measurability or continuity of or follows from these pointwise definitions.
Assume AC (The Axiom of Choice). If is positive definite, the ideal Gaussian synthetic likelihood for observed data is the Gaussian density evaluated at its summary, as supplied by Multivariate normal law, including singular covariance and A positive-definite multivariate normal law has its Gaussian density, Here is the Lebesgue density of . If is singular, this positive-definite-covariance density is not defined by this item.
Let be the pushforward law of the statistic under as in Law or distribution of a random element. For , let be IID simulated summaries with common law , where IID means a common law and mutual independence as in Identical distribution and IID families. Set The finite-simulation plug-in synthetic likelihood is the random quantity when is positive definite, and is unavailable otherwise. The finite plug-in quantity is a function of simulated summaries; it is not defined as an unbiased estimator of the ideal Gaussian density.
The exact experiment’s likelihood density, when the experiment is dominated as in Dominated statistical experiments and given a pointwise density as in Likelihood densities, and this Gaussian summary approximation are different objects. The latter density-selection interface assumes AC and does not assert a common exceptional null set across an arbitrary parameter set; the present definition adds no parameter-indexed measurability. This definition makes no claim that the actual summary law is Gaussian, that equals an exact likelihood, or that it yields posterior calibration, consistency, a Bernstein–von Mises theorem, or coverage. No optimizer or optimizer convergence property is included.
Remarks
If a positive-definite covariance matrix varies differentiably in a real matrix direction , Jacobi’s formula gives by The determinant differential is at every matrix, and Jacobi's formula holds on the invertible locus. This differentiates the determinant factor only; this definition assumes no differentiability of the binding mean or covariance.
A positive-definite matrix has the unique Cholesky factor used in numerical evaluation by A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique. This factorization does not ensure that a finite-simulation covariance is positive definite.
Depends on
- Statistics and estimators
- Law or distribution of a random element
- Identical distribution and IID families
- Expectation of a nonnegative or integrable random variable
- Moments, variance, and covariance on a probability space
- Dominated statistical experiments
- Likelihood densities
- The Axiom of Choice
- Multivariate normal law, including singular covariance
- A positive-definite multivariate normal law has its Gaussian density
- A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique
- The determinant differential is $D\det(A)[H]=\operatorname{tr}(\operatorname{adj}(A)H)$ at every matrix, and Jacobi's formula holds on the invertible locus
Used by
- Finite-simulation plug-in synthetic-likelihood evaluation Algorithm
- A Gaussian synthetic likelihood can change an exact posterior Counterexample
- A Gaussian synthetic likelihood for a Bernoulli summary is not exact Example
- Two simulated square summaries give a random singular covariance Example
- Finite-simulation synthetic likelihood is a random approximation Remark
Dependency tree · two levels
65 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Victor M.-H. Ong et al., Variational Bayes with Synthetic Likelihood, Statistics and Computing 28(4), 971–988 (2018) (standard reference, not scraped)
- Christopher C. Drovandi et al., Approximating the Likelihood in Approximate Bayesian Computation, Handbook of Approximate Bayesian Computation (2020) (standard reference, not scraped)
- David T. Frazier et al., Bayesian Inference Using Synthetic Likelihood: Asymptotics and Adjustments, Journal of the American Statistical Association 118(544), 2821–2832 (2023) (standard reference, not scraped)