Search arXivSearch

arXiv · 2512.12971

A Regime-Switching Approach to the Unbalanced Schr\"odinger Bridge Problem

Abstract

The unbalanced Schr\"odinger bridge problem (uSBP) seeks to interpolate between a probability measure $\rho_0$ and a sub-probability measure $\rho_T$ while minimizing KL divergence to a reference measure $\mathbf{R}$ on a path space. In this work, we investigate the case where $\mathbf{R}$ is the path measure of a diffusion process with killing, which we interpret as a regime-switching diffusion. In addition to matching the initial and terminal distributions of trajectories that survive up to time $T$, we consider a general constraint $\psi(t,x)$ on the distribution of killing times and/or killing locations. We investigate the uSBPs corresponding to four choices of $\psi$ in detail which reflect different levels of information available to an observer. We also provide a rigorous analysis of the connections and the comparisons among the outcomes of these four cases. Our results are novel in the field of uSBP. The regime-switching approach proposed in this work provides a unified framework for tackling different uSBP scenarios, which not only reconciles but also extends the existing literature on uSBP.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrei Zlotchevski, Linan Chen. 2025-12-15. A Regime-Switching Approach to the Unbalanced Schr\"odinger Bridge Problem. https://arxiv.org/abs/2512.12971

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