mlsanityData to 14 Oct 2026

The Risk-Sensitive Schr"odinger Bridge: Is Not a KL Projection

arXiv 2609.27250 ↗First posted 23 Sep 2026cs.IT cs.AI math.ITcited by 0

Not on the map. Why?

Abstract (arXiv)

The Schr"odinger bridge owes its computational power to a single structural fact: by Girsanov's theorem the controlled problem is a Kullback--Leibler (KL) projection onto a fixed reference measure, solvable by alternating projections. This letter shows that the fact does not survive risk sensitivity. When the expected path cost is replaced by the entropic risk measure and both endpoint marginals are kept as hard constraints, the resulting fixed-point bridge value Jθ (the soft-problem value at the multiplier that enforces the terminal constraint) admits no representation as a constrained KL minimum against any fixed path-space reference with a regular endpoint law (a class strictly larger than the uniformly elliptic diffusion references: no Markov property is required), even allowing an additive normalisation depending on the initial marginal. Moreover, no single reference generates the one-parameter family in the risk parameter. The obstruction is computed in closed form: the Gaussian bridge value violates, by exactly θ/2, a heat equation that any Gaussian smoothing of a fixed endpoint density must obey. In place of the projection, the theory rests on a terminal-multiplier fixed point and an asymmetric factorisation penalising the score energy of the backward factor.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 12 references that are in the map. First posted on arXiv 23 Sep 2026.

Builds on

3 of 12 references.

References · 3

  1. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
  2. 2024Risk-sensitive control as inference with R'enyi divergencecited by 3
  3. 2018Relaxed Schroedinger bridges and robust network routingcited by 2

Built on by

Not cited yet.