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

arXiv:2609.27250 · cs.IT, cs.AI, math.IT · Submitted 2026-09-23 · Read on arXiv

cs.IT, cs.AI, math.IT

Submitted: 2026-09-23

Updated: 2026-09-23

Terminology

• Optimal Transport — 2× in this paper · explained in 5 episodes
• Decoupling — 1× in this paper · explained in 2 episodes

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions