SemFlowRAG: Directed Semantic Flow from Abstraction to Evidence for Complex Reasoning

• URL: http://arxiv.org/abs/2606.28447v1
• Date: Fri, 26 Jun 2026 08:40:08 GMT
• Title: SemFlowRAG: Directed Semantic Flow from Abstraction to Evidence for Complex Reasoning
• Abstract summary: SemFlowRAG is a framework that reconstructs the flat retrieval space into a corpus-adaptive gradient semantic graph.<n>By quantifying the semantic abstractness of entities through the embedding variance of their associated passages, we transform static undirected edges into directed semantic constraints.<n>We show that SemFlowRAG effectively mitigates the probability black holes'' issue, outperforming existing baselines in both retrieval and downstream reasoning performance.
• Score: 15.817479351881062
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Retrieval-Augmented Generation (RAG) enhanced by Knowledge Graphs has shown promise in complex multi-hop reasoning tasks. However, existing graph-based retrieval methods typically rely on flat, undirected topologies. During the retrieval process, the probability flow often gets trapped in high-degree abstract concept nodes which we define as ``probability black holes'', leading to semantic drift and noise accumulation. To address this, we propose SemFlowRAG, a framework that reconstructs the flat retrieval space into a corpus-adaptive semantic gradient graph. This data-driven self-organization enables a hierarchical structure to emerge naturally from the data distribution, capturing the intrinsic semantic granularity of the corpus to suppress structural noise. By quantifying the semantic abstractness of entities through the embedding variance of their associated passages, we transform static undirected edges into directed semantic constraints. Furthermore, we design an abstractness-guided directed PageRank algorithm that forces the retrieval trajectory to follow a ``high-to-low semantic abstractness'' gradient. This mechanism ensures layer-by-layer evidence convergence, smoothly guiding the retrieval process from abstract concepts to specific document evidence. Extensive experiments on complex QA datasets demonstrate that SemFlowRAG effectively mitigates the ``probability black holes'' issue, outperforming existing baselines in both retrieval and downstream reasoning performance.

Related papers

• DeCoRAG: Cognitive Decoupling and Semantic-Aware Cropping for Complex Document Understanding [9.340832029984703]
  We introduce DeCoRAG, a multimodal Graph RAG pipeline that shifts knowledge processing from coupled visual-semantic reasoning to "Cognitive Decoupling"<n>DeCoRAG improves the semantic pass rate by up to 12.5 percentage points over the strongest baseline.<n>RAP-Crop reduces offline graph-construction prompt tokens by 40.8% without sacrificing end-to-end accuracy.
  arXiv  Detail & Related papers  (2026-07-27T15:28:02Z)
• FlowRAG: Synergizing Explicit Reasoning via Frequency-Aware Multi-Granularity Graph Flow [18.283800518966945]
  Graph-based retrieval-augmented generation (GraphRAG) is effective for knowledge-intensive and multi-hop query tasks.<n>textttFlowRAG is a semantic-aware retrieval framework that improves both semantic recall and explicit reasoning.<n>textttFlowRAG obtains state-of-the-art performance on complex reasoning benchmarks.
  arXiv  Detail & Related papers  (2026-06-16T12:28:14Z)
• Topology-Aware State Abstraction with Tangle Cores for Markov Decision Processes [6.908972852063454]
  State abstraction in reinforcement learning is usually formulated as a partition of states based on reward and transition similarity.<n>This excludes a common structural pattern in navigation, graph, and hierarchical decision problems: interface states such as doors, hubs, and bottlenecks naturally participate in more than one region.<n>We introduce emphtangle-core abstraction, based on graph tangles of empirical transition graphs.
  arXiv  Detail & Related papers  (2026-05-29T23:29:49Z)
• Hierarchical Consistency Learning for Test-time Adaptation in Camouflage Perception [50.278200968044665]
  Camouflaged object detection (COD) aims to localize targets that exhibit minimal perceptual differences from backgrounds through physical attributes.<n>Existing methods, constrained by the static train-then-freeze paradigm, suffer from domain rigidity and dependency annotation.<n>We propose the hierarchical consistency learning framework, which integrates test-time adaptation for dynamic representation recalibration.
  arXiv  Detail & Related papers  (2026-05-25T09:57:46Z)
• TERGAD: Structure-Aware Text-Enhanced Representations for Graph Anomaly Detection [15.051477921035264]
  Graph Anomaly Detection (GAD) aims to identify atypical graph entities, such as nodes, edges, or substructures, that deviate significantly from the majority.<n>Existing text-rich approaches typically integrate structural context into the data representation pipeline using raw textual features.<n>We propose TERGAD, a novel data augmentation framework that enriches structural semantics for GAD via the semantic reasoning capabilities of Large Language Models.
  arXiv  Detail & Related papers  (2026-05-19T12:09:36Z)
• ModuSeg: Decoupling Object Discovery and Semantic Retrieval for Training-Free Weakly Supervised Segmentation [8.671473711194741]
  Weakly supervised semantic segmentation aims to achieve pixel-level predictions using image-level labels.<n>We present ModuSeg, a training-free weakly supervised semantic segmentation framework centered on explicitly decoupling object discovery and semantic assignment.
  arXiv  Detail & Related papers  (2026-04-08T12:38:07Z)
• Counterexample Guided Branching via Directional Relaxation Analysis in Complete Neural Network Verification [10.808953992870954]
  Deep Neural Networks demonstrate exceptional performance but remain vulnerable to adversarial perturbations.<n>Current dataflow approaches operate with blind refinement processes that rely on statics.<n>We propose DRG-BaB, a framework that introduces the Directional Gap to prioritize branching on neurons actively contributing to falsification.
  arXiv  Detail & Related papers  (2026-03-16T04:57:44Z)
• Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression [55.51959317490934]
  Large language models (LLMs) have demonstrated promising capabilities in Text-Attributed Graph (TAG) understanding.<n>We argue that graphs inherently contain rich structural and semantic information, and that their effective exploitation can unlock potential gains in LLMs reasoning performance.<n>We propose Homophily-aware Structural and Semantic Compression for LLMs (HS2C), a framework centered on exploiting graph homophily.
  arXiv  Detail & Related papers  (2026-01-13T03:35:18Z)
• Unifying Tree Search Algorithm and Reward Design for LLM Reasoning: A Survey [92.71325249013535]
  Deliberative tree search is a cornerstone of Large Language Model (LLM) research.<n>This paper introduces a unified framework that deconstructs search algorithms into three core components.
  arXiv  Detail & Related papers  (2025-10-11T03:29:18Z)
• Cross-Granularity Hypergraph Retrieval-Augmented Generation for Multi-hop Question Answering [49.43814054718318]
  Multi-hop question answering (MHQA) requires integrating knowledge scattered across multiple passages to derive the correct answer.<n>Traditional retrieval-augmented generation (RAG) methods primarily focus on coarse-grained textual semantic similarity.<n>We propose a novel RAG approach called HGRAG for MHQA that achieves cross-granularity integration of structural and semantic information via hypergraphs.
  arXiv  Detail & Related papers  (2025-08-15T06:36:13Z)
• Learning the Implicit Semantic Representation on Graph-Structured Data [57.670106959061634]
  Existing representation learning methods in graph convolutional networks are mainly designed by describing the neighborhood of each node as a perceptual whole. We propose a Semantic Graph Convolutional Networks (SGCN) that explores the implicit semantics by learning latent semantic-paths in graphs.
  arXiv  Detail & Related papers  (2021-01-16T16:18:43Z)
• Towards Efficient Scene Understanding via Squeeze Reasoning [71.1139549949694]
  We propose a novel framework called Squeeze Reasoning. Instead of propagating information on the spatial map, we first learn to squeeze the input feature into a channel-wise global vector. We show that our approach can be modularized as an end-to-end trained block and can be easily plugged into existing networks.
  arXiv  Detail & Related papers  (2020-11-06T12:17:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.