Bocheng Han
Author directory2026
HyperSU: Corpus-Driven Semantic-Unit Hypergraph for Retrieval-Augmented Generation
Jiate Liu | Liuyi Chen | Zhengyi Yang | Chuan He | Mingchen Ju | Bocheng Han | Ruyi Liu | Xu Zhou
Findings of the Association for Computational Linguistics: EMNLP 2026
Jiate Liu | Liuyi Chen | Zhengyi Yang | Chuan He | Mingchen Ju | Bocheng Han | Ruyi Liu | Xu Zhou
Findings of the Association for Computational Linguistics: EMNLP 2026
Recent Hypergraph-based retrieval-augmented generation (HyperRAG) methods use hyperedges to connect multiple entities simultaneously, enabling more efficient multi-entity evidence organization than pairwise graph structures. However, existing HyperRAG methods often rely on LLM-generated summaries to construct hyperedges, which can introduce hallucinations while also incurring high indexing costs. In addition, during retrieval, existing methods typically rely on either one-hop neighbor expansion or PageRank diffusion. The former may miss useful multi-hop evidence, while the latter can suffer from uncontrolled propagation over excessive hub nodes, leading to semantic drift and noisy reasoning chains. To address these challenges, we propose HyperSU, a novel hypergraph-based RAG framework featuring semantic-unit hyperedges and clue-guided bidirectional retrieval. During construction, HyperSU formulates hyperedge construction as an entity-aware minimum-description-length (MDL) optimization problem, inducing source-grounded semantic-unit hyperedges that balance sentence-level semantic coherence and entity compactness. It then constructs a hypergraph by modeling each semantic unit as a hyperedge over its co-mentioned entities. During retrieval, HyperSU performs clue-guided bidirectional expansion over the semantic-unit hypergraph, enabling both multi-hop evidence discovery and evidence-anchored noise reduction. Experiments show that HyperSU consistently improves answer accuracy over standard, graph-based, and hypergraph-based RAG baselines, raising average accuracy on GraphRAG-Bench by 5.5 points over the strongest baseline (68.7 vs. 63.2), with larger gains on reasoning-intensive tasks, where the relative improvement reaches 14.1%. Our code is available at https://github.com/RAIDSLab/HyperSU.
2023
A Structure-Aware Generative Adversarial Network for Bilingual Lexicon Induction
Bocheng Han | Qian Tao | Lusi Li | Zhihao Xiong
Findings of the Association for Computational Linguistics: EMNLP 2023
Bocheng Han | Qian Tao | Lusi Li | Zhihao Xiong
Findings of the Association for Computational Linguistics: EMNLP 2023
Bilingual lexicon induction (BLI) is the task of inducing word translations with a learned mapping function that aligns monolingual word embedding spaces in two different languages. However, most previous methods treat word embeddings as isolated entities and fail to jointly consider both the intra-space and inter-space topological relations between words. This limitation makes it challenging to align words from embedding spaces with distinct topological structures, especially when the assumption of isomorphism may not hold. To this end, we propose a novel approach called the Structure-Aware Generative Adversarial Network (SA-GAN) model to explicitly capture multiple topological structure information to achieve accurate BLI. Our model first incorporates two lightweight graph convolutional networks (GCNs) to leverage intra-space topological correlations between words for generating source and target embeddings. We then employ a GAN model to explore inter-space topological structures by learning a global mapping function that initially maps the source embeddings to the target embedding space. To further align the coarse-grained structures, we develop a pair-wised local mapping (PLM) strategy that enables word-specific transformations in an unsupervised manner. Extensive experiments conducted on public datasets, including languages with both distant and close etymological relationships, demonstrate the effectiveness of our proposed SA-GAN model.