Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 54 min ago
PreprintarXiv licencearXiv

Latent Annealed Posterior Sampling with a Variance-Preserving Bridge for Sparsely Observed Random Fields

Abstract

Posterior inference for random fields from sparse observations presents two major challenges: accurately characterizing complex spatial uncertainty and preventing conditional sampling costs from growing substantially as the spatial grid is refined. To address these challenges, we propose latent annealed posterior sampling (LAPS). LAPS first maps the random field into a latent space with reduced dimensionality, while a coordinate decoder composed of Branch and Trunk networks enables field evaluation at arbitrary spatial locations. Flow matching is then used to learn the latent prior distribution. Based on this learned prior, posterior sampling is performed entirely in the latent space, with the observation likelihood incorporated progressively through an annealing procedure. To control local covariance inflation, we introduce a variance-preserving (VP) bridge that allocates a covariance budget between the transported latent state and a Gaussian perturbation. Numerical experiments demonstrate that LAPS accurately approximates posterior distributions, preserves distinct posterior modes, and reduces the dependence of conditional sampling costs on spatial resolution. Across two Gaussian benchmarks, LAPS attains small errors against exact posterior references, with sliced Wasserstein distances only 2 to 3 percent higher than the reference values obtained from exact posterior samples. In a bimodal posterior problem, LAPS reduces the sliced Wasserstein distance from 0.2693 to 0.1499 and consistently recovers both modes across all test scenarios. For a two dimensional Navier-Stokes random field, LAPS substantially improves marginal posterior calibration, while its evaluation time remains nearly constant as the output grid is refined from 64^2 to 512^2. These results demonstrate that LAPS achieves a favorable tradeoff among posterior accuracy, uncertainty calibration, and computational efficiency.

Related

  1. Posterior Tempering Explains Variance Inflation in Linear and Generalized Linear Thompson Sampling
    Prateek Jaiswal, Debdeep Pati, Anirban Bhattacharya +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Generalized Posterior Calibration via Infinitesimal-Jackknife Variance Matching
    Masahiro Tanaka
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Accelerating posterior sampling in Bayesian inverse problems with diffusion models: an online-offline perspective
    Duc-Lam Duong
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingStatisticsarXiv
  4. Rank-one variance inflation in polynomial estimation of signal parameters with a sign-preserving fractional-power basis
    Serhii Zabolotnii
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Learning to Replace MCMC in Split-Gibbs Diffusion Posterior Sampling via Deep Unfolding
    Yi Zhang, Rui Guo, Mengchu Xu +2
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{lei2026latent,
  title = {{Latent Annealed Posterior Sampling with a Variance-Preserving Bridge for Sparsely Observed Random Fields}},
  author = {Jiankun Lei and Tian Qi},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.20659},
  eprint = {2610.20659},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.20659},
}
RIS
TY  - UNPB
TI  - Latent Annealed Posterior Sampling with a Variance-Preserving Bridge for Sparsely Observed Random Fields
AU  - Jiankun Lei
AU  - Tian Qi
PY  - 2026
DA  - 2026/10/14
PB  - arXiv
DO  - 10.48550/arxiv.2610.20659
UR  - https://arxiv.org/abs/2610.20659
AB  - Posterior inference for random fields from sparse observations presents two major challenges: accurately characterizing complex spatial uncertainty and preventing conditional sampling costs from growing substantially as the spatial grid is refined. To address these challenges, we propose latent annealed posterior sampling (LAPS). LAPS first maps the random field into a latent space with reduced dimensionality, while a coordinate decoder composed of Branch and Trunk networks enables field evaluation at arbitrary spatial locations. Flow matching is then used to learn the latent prior distribution. Based on this learned prior, posterior sampling is performed entirely in the latent space, with the observation likelihood incorporated progressively through an annealing procedure. To control local covariance inflation, we introduce a variance-preserving (VP) bridge that allocates a covariance budget between the transported latent state and a Gaussian perturbation. Numerical experiments demonstrate that LAPS accurately approximates posterior distributions, preserves distinct posterior modes, and reduces the dependence of conditional sampling costs on spatial resolution. Across two Gaussian benchmarks, LAPS attains small errors against exact posterior references, with sliced Wasserstein distances only 2 to 3 percent higher than the reference values obtained from exact posterior samples. In a bimodal posterior problem, LAPS reduces the sliced Wasserstein distance from 0.2693 to 0.1499 and consistently recovers both modes across all test scenarios. For a two dimensional Navier-Stokes random field, LAPS substantially improves marginal posterior calibration, while its evaluation time remains nearly constant as the output grid is refined from 64^2 to 512^2. These results demonstrate that LAPS achieves a favorable tradeoff among posterior accuracy, uncertainty calibration, and computational efficiency.
ER  -