Pith. sign in

REVIEW 2 cited by

Feedback Schr\"odinger Bridge Matching

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 2410.14055 v3 pith:46SDJL26 submitted 2024-10-17 stat.ML cs.LG

classification stat.MLcs.LG
keywords matchingscalabilityfeedbackframeworksoptimaltrainingtransportbridge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent advancements in diffusion bridges for distribution transport problems have heavily relied on matching frameworks, yet existing methods often face a trade-off between scalability and access to optimal pairings during training. Fully unsupervised methods make minimal assumptions but incur high computational costs, limiting their practicality. On the other hand, imposing full supervision of the matching process with optimal pairings improves scalability, however, it can be infeasible in many applications. To strike a balance between scalability and minimal supervision, we introduce Feedback Schr\"odinger Bridge Matching (FSBM), a novel semi-supervised matching framework that incorporates a small portion (less than 8% of the entire dataset) of pre-aligned pairs as state feedback to guide the transport map of non coupled samples, thereby significantly improving efficiency. This is achieved by formulating a static Entropic Optimal Transport (EOT) problem with an additional term capturing the semi-supervised guidance. The generalized EOT objective is then recast into a dynamic formulation to leverage the scalability of matching frameworks. Extensive experiments demonstrate that FSBM accelerates training and enhances generalization by leveraging coupled pairs guidance, opening new avenues for training matching frameworks with partially aligned datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Generalized Schr\"odinger Bridge on Graphs

    cs.LG 2026-02 conditional novelty 6.0 of 10

    GSBoG learns topology-respecting controlled CTMC policies for graph transport that match endpoint distributions and optimize running costs via a data-driven IPF and temporal-difference training scheme.

  2. Variational Entropic Optimal Transport

    cs.LG 2026-02 conditional novelty 5.0 of 10

    VarEOT rewrites the EOT weak-dual objective so the log-partition is optimized via an auxiliary normalizer, enabling simulation-free neural training with provable finite-sample guarantees.

Pith tools