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.
Dimension-uniform conditional flow error for function-valued Bayesian posteriors
Open problem
Assume the Axiom of Choice. Its implications supply Dependent Choice and Countable Choice for the finite-dimensional ODE flow assumptions.
Let be a separable real Hilbert space, let be compact, and let be the pointwise potential posterior of a proper Bayesian inverse model, with positive finite evidence and finite second moment for every . Let be finite-rank orthogonal projections on with for every , let , and let be proper posteriors defined by declared finite-rank forward/potential approximations on , with finite second moments for every . Write for inclusion and define the posterior model error where is the infimum, over joint laws with marginals , of the square root of the expected squared Hilbert distance. This term includes both posterior-potential and finite-rank model error; the known Hellinger potential/discretization estimates would need an explicit moment or tail argument to control it in .
Let be the prior-predictive joint law of and assume the global prior-predictive moment condition Let be an independent reference probability on with finite second moment, and use the product training law . Let and let be a chosen continuum conditional regression version. For projected endpoints, define and the finite-rank conditional-target discrepancy The conditional expectation versions at must be chosen on all for these suprema. For a measurable vector field , define its pointwise conditional population loss by using the selected conditional-law version. For a finite training sample of size , let be an empirical-risk minimizer in the specified vector-field class, when it exists. On realizations where the declared optimizer returns a field (status criterion-met or budget-exhausted), let be that field; the optimizer-failed case has no learned field and is outside this formulation. Define the uniform conditional statistical and optimizer excess-risk terms by where is the chosen class and is its population conditional squared regression loss at datum . Let be a certified coupling bound between the numerical endpoint law at solver budget and the exact learned-flow endpoint law. Finally, let be a proposed bound, uniform in and , for the time-integrated spatial Lipschitz constants of the learned drifts.
Find checkable assumptions under which the learned finite-rank flow defines a posterior sampler and, for each training realization satisfying explicit risk certificates (or with a stated probability over training data), satisfies a dimension-uniform bound of the form with independent of . The result should derive usable bounds for the posterior model term from the Bayesian potential and discretization hypotheses, establish the uniform-in- training terms from prior-predictive data, and state the required flow regularity and numerical coupling assumptions. It must not assume that a finite-sample learned field or numerical solver already has the exact joint pushforward property; that property is the conclusion to be certified through the displayed error terms.
Open problem references
Status
Status reviewed 2026-10-19 against the inspected full texts. The older broad wording that function-space flow-matching error theory is simply open is stale: Blechschmidt et al. give finite-dimensional inverse-problem CFM theory and function-valued numerical experiments; Zhai, Jeong, and Ročková prove finite-dimensional posterior Wasserstein accuracy in expectation and uniform-in-data consistency under compact-domain, bounded-velocity, smooth-flow and Sobolev assumptions; Shikhman proves generic Hilbert-space functional-flow discretization and end-to-end Wasserstein bounds with sensing, excess-risk, optimizer and solver terms under controlled reconstruction and stability assumptions. Shikhman's stated scope excludes infinite-dimensional likelihoods and arbitrary refinement, while Blechschmidt et al. identify a function-space Wasserstein error analysis as future work. The precise combined posterior-potential, function-space, finite-rank and uniform-conditional result formulated above is not supplied by these inspected sources. This is a bounded source review, not an exhaustive proof that no resolution exists.
Depends on
- The Axiom of Choice
- AC implies DC implies countable choice
- Misfit evidence and the potential posterior law
- Function-space posterior propriety from a common lower envelope
- Hellinger stability of function-space posteriors under data perturbations
- Hellinger error bound for posterior potential discretization
- Posterior computation error budget
- Bounded posterior functionals and stationary sample error
- Global Lipschitz ODE flows and the C1 density formula
- An exact triangular transport disintegrates to the posterior
- Conditional flow matching for inverse posteriors
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
109 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
- Jan Blechschmidt, Oliver G. Ernst, Moritz Poguntke, and Björn Sprungk, Flow Matching for Fast Posterior Sampling in Bayesian Inverse Problems (standard reference, not scraped)
- Percy S. Zhai, So Won Jeong, and Veronika Ročková, Conditional Flow Matching for Bayesian Posterior Inference (standard reference, not scraped)
- Lennon J. Shikhman, Discretization and Statistical Consistency of Functional Flow Matching (standard reference, not scraped)
- Jannis Chemseddine, Paul Hagemann, Gabriele Steidl, and Christian Wald, Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching, Journal of Machine Learning Research 26(141) (2025) (standard reference, not scraped)