BridgeRAG: Training-Free Bridge-Conditioned Retrieval for Multi-Hop Question Answering
Andre Bacellar

TL;DR
BridgeRAG introduces a training-free, bridge-conditioned retrieval method for multi-hop question answering that improves retrieval accuracy by explicitly modeling reasoning chains without requiring graph databases or training.
Contribution
It proposes a novel, training-free retrieval approach that conditions on reasoning bridges, outperforming previous methods on multiple benchmarks without training or graph structures.
Findings
Achieves state-of-the-art training-free R@5 on three benchmarks.
Bridge conditioning significantly improves retrieval accuracy.
Method is selective, irreplaceable, predictable, and mechanistically precise.
Abstract
Multi-hop retrieval is not a single-step relevance problem: later-hop evidence should be ranked by its utility conditioned on retrieved bridge evidence, not by similarity to the original query alone. We present BridgeRAG, a training-free, graph-free retrieval method for retrieval-augmented generation (RAG) over multi-hop questions that operationalizes this view with a tripartite scorer s(q,b,c) over (question, bridge, candidate). BridgeRAG separates coverage from scoring: dual-entity ANN expansion broadens the second-hop candidate pool, while a bridge-conditioned LLM judge identifies the active reasoning chain among competing candidates without any offline graph or proposition index. Across four controlled experiments we show that this conditioning signal is (i) selective: +2.55pp on parallel-chain queries (p<0.001) vs. ~0 on single-chain subtypes; (ii) irreplaceable: substituting the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
