Pith. sign in

REVIEW 3 cited by

Conditional simulation via entropic optimal transport: Toward non-parametric estimation of conditional Brenier maps

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 2411.07154 v1 pith:ZB3TQVCJ submitted 2024-11-11 stat.ML cs.LGmath.OC

classification stat.MLcs.LGmath.OC
keywords conditionalmapsbrenierestimatorentropicnon-parametricoptimaltransport
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Conditional simulation is a fundamental task in statistical modeling: Generate samples from the conditionals given finitely many data points from a joint distribution. One promising approach is to construct conditional Brenier maps, where the components of the map pushforward a reference distribution to conditionals of the target. While many estimators exist, few, if any, come with statistical or algorithmic guarantees. To this end, we propose a non-parametric estimator for conditional Brenier maps based on the computational scalability of \emph{entropic} optimal transport. Our estimator leverages a result of Carlier et al. (2010), which shows that optimal transport maps under a rescaled quadratic cost asymptotically converge to conditional Brenier maps; our estimator is precisely the entropic analogues of these converging maps. We provide heuristic justifications for choosing the scaling parameter in the cost as a function of the number of samples by fully characterizing the Gaussian setting. We conclude by comparing the performance of the estimator to other machine learning and non-parametric approaches on benchmark datasets and Bayesian inference problems.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Sample complexity of Schr\"odinger potential estimation

    cs.LG 2025-06 conditional novelty 7.0 of 10

    An empirical KL minimizer over log-potentials estimates Schrödinger bridge potentials with terminal excess KL risk O(log^2 n / n) in the realizable case, even when the target distribution has unbounded support.

  2. The Monge optimal transport barycenter problem

    math.OC 2025-07 conditional novelty 6.0 of 10

    A new flow-based algorithm solves the data-driven Monge optimal transport barycenter problem by recasting the independence constraint as a singular-value penalty, yielding linear per-iteration cost and a closed-form m...

  3. Forward Reverse Kernel Regression for the Schr\"{o}dinger bridge problem

    stat.ML 2025-07 conditional novelty 6.0 of 10

    A kernel-regression iteration over forward and reverse simulated paths computes Schrödinger bridge potentials with provable, minimax-optimal convergence rates.

Pith tools