Asymmetric Dynamic Routing: Balancing Reasoning Depth and Computational Efficiency in Hypergraph RAG
Asymmetric Dynamic Routing is proposed, an intent-conditioned retrieval framework operating over hierarchical knowledge graphs that maintains strong reasoning performance while reducing prompt token consumption and end-to-end query latency, yielding a favorable quality--efficiency trade-off for query-adaptive Hypergrap...