Pith. sign in

REVIEW 1 cited by

Localized Schr\"odinger Bridge Sampler

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.07968 v3 pith:DEJKJXPX submitted 2024-09-12 stat.ML cs.LGcs.NAmath.NAstat.CO

classification stat.MLcs.LGcs.NAmath.NAstat.CO
keywords odingerschrbridgeconditionalproblemsamplinglocalizationsampler
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We consider the problem of sampling from an unknown distribution for which only a sufficiently large number of training samples are available. In this paper, we build on previous work combining Schr\"odinger bridges and plug & play Langevin samplers. A key bottleneck of these approaches is the exponential dependence of the required training samples on the dimension, $d$, of the ambient state space. We propose a localization strategy which exploits conditional independence of conditional expectation values. Localization thus replaces a single high-dimensional Schr\"odinger bridge problem by $d$ low-dimensional Schr\"odinger bridge problems over the available training samples. In this context, a connection to multi-head self attention transformer architectures is established. As for the original Schr\"odinger bridge sampling approach, the localized sampler is stable and geometric ergodic. The sampler also naturally extends to conditional sampling and to Bayesian inference. We demonstrate the performance of our proposed scheme through experiments on a high-dimensional Gaussian problem, on a temporal stochastic process, and on a stochastic subgrid-scale parametrization conditional sampling problem. We also extend the idea of localization to plug & play Langevin samplers using kernel-based denoising in combination with Tweedie's formula.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning dynamical systems with hit-and-run random feature maps

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A deep, localized random feature map with hit-and-run initialization matches or beats reservoir computing forecast skill on three chaotic benchmarks with orders of magnitude fewer parameters.

Pith tools