mlsanityData to 14 Oct 2026

JKO-RAG: Distributional Retrieval as Wasserstein Free-Energy Gradient Flow

arXiv 2607.24776 ↗First posted 15 Jun 2026cs.IR cs.LGcited by 0

On the map: Retrieval-augmented generation → Generation and context integration

Abstract (arXiv)

RAG pipelines return a ranked list of passages. We argue this is a mismatch: the downstream language model conditions on a set, and the selection problem is fundamentally geometric. We propose jko, which frames reranking as minimising a free-energy functional F(p)=relevance+entropy+redundancy under Wasserstein-2 gradient flow via the Jordan--Kinderlehrer--Otto proximal scheme. The ground metric Cij=(1-coslangle zi,zjrangle)2 encodes the semantic geometry of the embedding manifold. Our central contribution is a linear-response theory explaining why the Wasserstein geometry helps: the Wasserstein and KL retrieval maps differ only in their proximal Hessian -- dense and geometry-aware for W2, diagonal and geometry-blind for KL -- and this difference damps the mass transport that query paraphrase induces. The theory yields a falsifiable prediction: the stability advantage is monotonically decreasing in step size h. We verify this empirically via free-energy descent, frequency-resolved perturbation response, the predicted h-dependence, and a certified-radius analysis. Four extensions are introduced: nmjko (learned ground metric), bwjko (W2--KL interpolation), samjko (2× speedup), and dualrank (OT dual potentials as confidence signals). Across five BEIR benchmarks, jko outperforms the cross-encoder on all five; the decisive advantage is robustness -- 22--38% more stable under paraphrase, 2× fewer leaked distractors.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Generation and context integration, one of 15 directions in Retrieval-augmented generation. Builds on 14 of its 25 references that are in the map. First posted on arXiv 15 Jun 2026.

Builds on

14 of 25 references.

Closest ancestors · 1

Same direction, newest first

  1. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks22 May

Other references · 13

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  4. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
  5. 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,253
  6. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  7. 2019Passage Re-ranking with BERTcited by 645
  8. 2020Fact or Fiction: Verifying Scientific Claimscited by 554
  9. 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 360
  10. 2023Enhancing Retrieval-Augmented Large Language Models with Iterative Retrieval-Generation Synergycited by 346
  11. 2018Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distancecited by 56
  12. 2022A Unified Framework for Implicit Sinkhorn Differentiationcited by 28
1 more
  1. 2022No Parameter Left Behind: How Distillation and Model Size Affect Zero-Shot Retrievalcited by 17

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026HypRAG: Hyperbolic Dense Retrieval for Retrieval Augmented Generation
  2. 2026Beyond Similarity through Zero-Token Geometric Graphs for Multi-Hop RAG
  3. 2026Revisiting RAG Retrievers: An Information Theoretic Benchmark
  4. 2025HyperbolicRAG: Enhancing Retrieval-Augmented Generation with Hyperbolic Representations
  5. 2026Where Post-Training Quantization Breaks Text Embedders: A Measured Map Across Four Embedder Families
  6. 2024FunnelRAG: A Coarse-to-Fine Progressive Retrieval Paradigm for RAG
  7. 2026HAKARI-Bench: A Lightweight Benchmark for Comparing Retrieval Architectures and Efficiency Settings under Unified Conditions
  8. 2026Test-Time Compute for Frozen Embedding Models through Agentic Program Search