Author name cluster

Haihong E

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

9 papers

2 author rows

AAAI Conference 2026 Conference Paper

FinMMDocR: Benchmarking Financial Multimodal Reasoning with Scenario Awareness, Document Understanding, and Multi-Step Computation

Zichen Tang
Haihong E
Rongjin Li
Jiacheng Liu
Linwei Jia
Zhuodi Hao
Zhongjun Yang
Yuanze Li

We introduce FinMMDocR, a novel bilingual multimodal benchmark for evaluating multimodal large language models (MLLMs) on real-world financial numerical reasoning. Compared to existing benchmarks, our work delivers three major advancements. (1) Scenario Awareness: 57.9% of 1,200 expert-annotated problems incorporate 12 types of implicit financial scenarios (e.g., Portfolio Management), challenging models to perform expert-level reasoning based on assumptions; (2) Document Understanding: 837 Chinese/English documents spanning 9 types (e.g., Company Research) average 50.8 pages with rich visual elements, significantly surpassing existing benchmarks in both breadth and depth of financial documents; (3) Multi-Step Computation: Problems demand 11-step reasoning on average (5.3 extraction + 5.7 calculation steps), with 65.0% requiring cross-page evidence (2.4 pages average). The best-performing MLLM achieves only 58.0% accuracy, and different retrieval-augmented generation (RAG) methods show significant performance variations on this task. We expect FinMMDocR to drive improvements in MLLMs and reasoning-enhanced methods on complex multimodal reasoning tasks in real-world scenarios.

PDF Details DOI

NeurIPS Conference 2025 Conference Paper

HyperGraphRAG: Retrieval-Augmented Generation via Hypergraph-Structured Knowledge Representation

Haoran Luo
Haihong E
Guanting Chen
Yandan Zheng
Xiaobao Wu
Yikai Guo
Qika Lin
Yu Feng

Standard Retrieval-Augmented Generation (RAG) relies on chunk-based retrieval, whereas GraphRAG advances this approach by graph-based knowledge representation. However, existing graph-based RAG approaches are constrained by binary relations, as each edge in an ordinary graph connects only two entities, limiting their ability to represent the n-ary relations (n >= 2) in real-world knowledge. In this work, we propose HyperGraphRAG, the first hypergraph-based RAG method that represents n-ary relational facts via hyperedges. HyperGraphRAG consists of a comprehensive pipeline, including knowledge hypergraph construction, retrieval, and generation. Experiments across medicine, agriculture, computer science, and law demonstrate that HyperGraphRAG outperforms both standard RAG and previous graph-based RAG methods in answer accuracy, retrieval efficiency, and generation quality.

PDF Details

ICLR Conference 2025 Conference Paper

INFER: A Neural-symbolic Model For Extrapolation Reasoning on Temporal Knowledge Graph

Ningyuan Li 0002
Haihong E
Tianyu Yao
Tianyi Hu
Yuhan Li
Haoran Luo 0001
Meina Song
Yifan Zhu 0001

Temporal Knowledge Graph(TKG) serves as an efficacious way to store dynamic facts in real-world. Extrapolation reasoning on TKGs, which aims at predicting possible future events, has attracted consistent research interest. Recently, some rule-based methods have been proposed, which are considered more interpretable compared with embedding-based methods. Existing rule-based methods apply rules through path matching or subgraph extraction, which falls short in inference ability and suffers from missing facts in TKGs. Besides, during rule application period, these methods consider the standing of facts as a binary 0 or 1 problem and ignores the validity as well as frequency of historical facts under temporal settings. In this paper, by designing a novel paradigm for rule application, we propose INFER, a neural-symbolic model for TKG extrapolation. With the introduction of Temporal Validity Function, INFER firstly considers the frequency and validity of historical facts and extends the truth value of facts into continuous real number to better adapt for temporal settings. INFER builds Temporal Weight Matrices with a pre-trained static KG embedding model to enhance its inference ability. Moreover, to facilitates potential integration with existing embedding-based methods, INFER adopts a rule projection module which enables it apply rules through conducting matrices operation on GPU. This feature also improves the efficiency of rule application. Experimental results show that INFER achieves state-of-the-art performance on various TKG datasets and significantly outperforms existing rule-based models on our modified, more sparse TKG datasets, which demonstrates the superiority of our model in inference ability.

Details

JBHI Journal 2025 Journal Article

Intradialytic Hypotension Frequency Prediction Using Generalizable Neighborhood Reasoning on Temporal Patient Knowledge Graph

Gengxian Zhou
Haihong E
Zemin Kuang
Ling Tan
Tianyu Yao
Meina Song

Intradialytic hypotension (IDH) is a common complication among hemodialysis patients, adversely affecting quality of life and elevating mortality risk. IDH prediction enables physicians to take proactive measures, effectively reducing its occurrence. However, most prediction works rely on machine learning models, with a focus on real-time or session-level IDH. Hemodialysis patient data is multi-type and temporal, necessitating research on patient condition representation and temporal information utilization. Knowledge graphs (KGs) offer flexible data modeling and encompass rich structured information. This study represents patients using KGs and reason on graph structures to predict IDH. To study monthly IDH and utilize temporal information, a temporal patient KG is constructed. Patient KGs are first built at the monthly granularity based on data of 532 patients between January 2017 and August 2022. Six sequential monthly KGs are then combined into an observation window, resulting in a temporal KG dataset of 15, 807 independent windows from 458 patients. The aim of this study is to utilize information from multiple months within a window to predict frequent IDH in the last month. However, the characteristics of IDH scenario and generalizability requirement pose challenges for the application of general KG reasoning models. Therefore, we adopt neighborhood-based KG reasoning and devise a visible feature guided patient-centric graph convolution to obtain patients' generalizable representations. Finally, patient representations in a window are fused using a sequential model, and processed by a prediction MLP to obtain the prediction results. Compared to 7 classic machine learning models, our model demonstrates superior performance in comprehensive metrics such as accuracy and F1 score.

Details DOI

ICML Conference 2025 Conference Paper

KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search

Haoran Luo 0001
Haihong E
Yikai Guo
Qika Lin
Xiaobao Wu
Xinyu Mu
Wenhao Liu
Meina Song

Knowledge Base Question Answering (KBQA) aims to answer natural language questions with a large-scale structured knowledge base (KB). Despite advancements with large language models (LLMs), KBQA still faces challenges in weak KB awareness, imbalance between effectiveness and efficiency, and high reliance on annotated data. To address these challenges, we propose KBQA-o1, a novel agentic KBQA method with Monte Carlo Tree Search (MCTS). It introduces a ReAct-based agent process for stepwise logical form generation with KB environment exploration. Moreover, it employs MCTS, a heuristic search method driven by policy and reward models, to balance agentic exploration’s performance and search space. With heuristic exploration, KBQA-o1 generates high-quality annotations for further improvement by incremental fine-tuning. Experimental results show that KBQA-o1 outperforms previous low-resource KBQA methods with limited annotated data, boosting Llama-3. 1-8B model’s GrailQA F1 performance to 78. 5% compared to 48. 5% of the previous sota method with GPT-3. 5-turbo. Our code is publicly available.

Details

NeurIPS Conference 2024 Conference Paper

Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction

Haoran Luo
Haihong E
Yuhao Yang
Tianyu Yao
Yikai Guo
Zichen Tang
Wentai Zhang
Shiyao Peng

Beyond traditional binary relational facts, n-ary relational knowledge graphs (NKGs) are comprised of n-ary relational facts containing more than two entities, which are closer to real-world facts with broader applications. However, the construction of NKGs remains at a coarse-grained level, which is always in a single schema, ignoring the order and variable arity of entities. To address these restrictions, we propose Text2NKG, a novel fine-grained n-ary relation extraction framework for n-ary relational knowledge graph construction. We introduce a span-tuple classification approach with hetero-ordered merging and output merging to accomplish fine-grained n-ary relation extraction in different arity. Furthermore, Text2NKG supports four typical NKG schemas: hyper-relational schema, event-based schema, role-based schema, and hypergraph-based schema, with high flexibility and practicality. The experimental results demonstrate that Text2NKG achieves state-of-the-art performance in F1 scores on the fine-grained n-ary relation extraction benchmark. Our code and datasets are publicly available.

PDF Details DOI

AAAI Conference 2023 Conference Paper

DHGE: Dual-View Hyper-Relational Knowledge Graph Embedding for Link Prediction and Entity Typing

Haoran Luo
Haihong E
Ling Tan
Gengxian Zhou
Tianyu Yao
Kaiyang Wan

In the field of representation learning on knowledge graphs (KGs), a hyper-relational fact consists of a main triple and several auxiliary attribute-value descriptions, which is considered more comprehensive and specific than a triple-based fact. However, currently available hyper-relational KG embedding methods in a single view are limited in application because they weaken the hierarchical structure that represents the affiliation between entities. To overcome this limitation, we propose a dual-view hyper-relational KG structure (DH-KG) that contains a hyper-relational instance view for entities and a hyper-relational ontology view for concepts that are abstracted hierarchically from the entities. This paper defines link prediction and entity typing tasks on DH-KG for the first time and constructs two DH-KG datasets, JW44K-6K, extracted from Wikidata, and HTDM based on medical data. Furthermore, we propose DHGE, a DH-KG embedding model based on GRAN encoders, HGNNs, and joint learning. DHGE outperforms baseline models on DH-KG, according to experimental results. Finally, we provide an example of how this technology can be used to treat hypertension. Our model and new datasets are publicly available.

PDF Details DOI

AAAI Conference 2023 Conference Paper

NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs

Haoran Luo
Haihong E
Yuhao Yang
Gengxian Zhou
Yikai Guo
Tianyu Yao
Zichen Tang
Xueyuan Lin

Complex query answering (CQA) is an essential task for multi-hop and logical reasoning on knowledge graphs (KGs). Currently, most approaches are limited to queries among binary relational facts and pay less attention to n-ary facts (n≥2) containing more than two entities, which are more prevalent in the real world. Moreover, previous CQA methods can only make predictions for a few given types of queries and cannot be flexibly extended to more complex logical queries, which significantly limits their applications. To overcome these challenges, in this work, we propose a novel N-ary Query Embedding (NQE) model for CQA over hyper-relational knowledge graphs (HKGs), which include massive n-ary facts. The NQE utilizes a dual-heterogeneous Transformer encoder and fuzzy logic theory to satisfy all n-ary FOL queries, including existential quantifiers (∃), conjunction (∧), disjunction (∨), and negation (¬). We also propose a parallel processing algorithm that can train or predict arbitrary n-ary FOL queries in a single batch, regardless of the kind of each query, with good flexibility and extensibility. In addition, we generate a new CQA dataset WD50K-NFOL, including diverse n-ary FOL queries over WD50K. Experimental results on WD50K-NFOL and other standard CQA datasets show that NQE is the state-of-the-art CQA method over HKGs with good generalization capability. Our code and dataset are publicly available.

PDF Details DOI

NeurIPS Conference 2023 Conference Paper

TFLEX: Temporal Feature-Logic Embedding Framework for Complex Reasoning over Temporal Knowledge Graph

Xueyuan Lin
Haihong E
Chengjin Xu
Gengxian Zhou
Haoran Luo
Tianyi Hu
Fenglong Su
Ningyuan Li

Multi-hop logical reasoning over knowledge graph plays a fundamental role in many artificial intelligence tasks. Recent complex query embedding methods for reasoning focus on static KGs, while temporal knowledge graphs have not been fully explored. Reasoning over TKGs has two challenges: 1. The query should answer entities or timestamps; 2. The operators should consider both set logic on entity set and temporal logic on timestamp set. To bridge this gap, we introduce the multi-hop logical reasoning problem on TKGs and then propose the first temporal complex query embedding named Temporal Feature-Logic Embedding framework (TFLEX) to answer the temporal complex queries. Specifically, we utilize fuzzy logic to compute the logic part of the Temporal Feature-Logic embedding, thus naturally modeling all first-order logic operations on the entity set. In addition, we further extend fuzzy logic on timestamp set to cope with three extra temporal operators ( After, Before and Between ). Experiments on numerous query patterns demonstrate the effectiveness of our method.

PDF Details