SearcharxivSearch

arXiv · 2604.02312

A weak transport approach to the Schr\"odinger-Bass bridge

Abstract

We study the Schr\"odinger-Bass problem, a one-parameter family of semimartingale optimal transport problems indexed by $\beta>0$, whose limiting regimes interpolate between the classical Schr\"odinger bridge, the Brenier-Strassen problem, and, after rescaling, the martingale Benamou-Brenier (Bass) problem. For each $\beta>0$, we prove that the dynamic Schr\"odinger-Bass problem is equivalent to a static weak optimal transport (WOT) problem with explicit cost $C_{\mathrm{SB}}^\beta$. This yields primal and dual attainment, as well as a structural characterization of the optimal semimartingales. The cost $C_{\mathrm{SB}}^\beta$ is constructed via infimal convolution and deconvolution of the Schr\"odinger cost with the Wasserstein distance. In a broader setting, we show that such infimal convolutions preserve the WOT structure and inherit continuity, coercivity, and stability of both values and optimizers with respect to the marginals. Building on this formulation, we propose a dual ascent algorithm for numerical computation. We establish monotone improvement of the dual objective and convergence of the iteration to the unique optimizer under suitable integrability assumptions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manuel Hasenbichler, Gudmund Pammer, Stefan Thonhauser. 2026-04-02. A weak transport approach to the Schr\"odinger-Bass bridge. https://arxiv.org/abs/2604.02312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR