Weihao Han

Weihao Han

Auto-generated profile, based on publicly available information

Weihao Han

Microsoft, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 April 2025
Verified
Conference Paper
Open access
JYJun Yin
Jun Yin
ZZZhengxin Zeng
Zhengxin Zeng
MLMingzheng Li
Mingzheng Li
HYHao Yan
Hao Yan
CLChaozhuo Li
Chaozhuo Li
WSWang Senzhang
Wang Senzhang


13 May 2024
Verified
Conference Paper
Open access
YCYaoqi Chen
Yaoqi Chen
RZRuicheng Zheng
Ruicheng Zheng
QCQi Chen
Qi Chen
SXShuotao Xu
Shuotao Xu
QZQianxi Zhang
Qianxi Zhang
MYMao Yang
Mao Yang
Multi-index vector search has become the cornerstone for many applications, such as recommendation systems. Efficient search in such a multi-modal hybrid vector space is challenging since no single index design performs well for all kinds of vector data. Existing approaches to processing multi-index hybrid queries either suffer from algorithmic limitations or processing inefficiency. In this paper, we propose OneSparse, a unified multi-vector index query system that incorporates multiple posting-based vector indices, which enables highly efficient retrieval of multi-modal data-sets. OneSparse introduces a novel multi-index query engine design of inter-index intersection push-down. It also optimizes the vector posting format to expedite multi-index queries. Our experiments show OneSparse achieves more than 6x search performance improvement while maintaining comparable accuracy. OneSparse has already been integrated into Microsoft online web search and advertising systems with 5x+ latency gain for Bing web search and 2.0% Revenue Per Mille (RPM) gain for Bing sponsored search.

10 March 2025
Verified
Conference Paper
Open access
HYHao Yan
Hao Yan
CLChaozhuo Li
Chaozhuo Li
JYJun Yin
Jun Yin
WHWeihao Han
Weihao Han
HSHao Sun
Hao Sun
JWJianxin Wang
Jianxin Wang
Text-Attributed Graphs (TAGs) are prevalent in various real-world scenarios, where each node is associated with a text attribute. Representation learning on TAGs relies on a comprehensive understanding of both the textual attributes associated with nodes and the topological connections between nodes. Recent works have tried to enhance graph neural networks (GNNs) with pre-trained language models (PLMs) for textual attribute learning, which has achieved promising result compared with shallow text representation learning models such as BoW. With the advent of more powerful LLMs, it is worth to further exploring how to effectively and efficiently incorporate the generic knowledge in LLMs to enhance GNNs. To this aim, we for the first time investigate whether the mainstream generative LLMs can provide high-quality generic text embedding for GNNs. To simultaneously use the generic knowledge in the LLM and the task-specific knowledge in the tuned PLM (TLM), we propose a dual channel knowledge fusion framework, named MoKGNN, to enhance the representation learning on TAGs. Specifically, we first propose a dual channel feature extraction stage to derive text embeddings that contain generic knowledge and task-specific knowledge separately. Next, we introduce a Knowledge Alignment Network to align the higher-dimensional General Embedding with the lower-dimensional Task-Specific Embedding. Finally, we adopt a mix-up operation to integrate the generic and task-specific textual attribute representation to enhance downstream GNNs. Extensive experiments on four TAG datasets demonstrate the effectiveness of our approach in improving the performance of GNNs in the tasks of node classification and link prediction.

19 July 2026
Verified
Conference Paper
Open access
HBHaotong Bao
Haotong Bao
JZJianjin Zhang
Jianjin Zhang
WHWeihao Han
Weihao Han
XWXue Wu
Xue Wu
QCQi Chen
Qi Chen
QZQi Zhang
Qi Zhang

30 September 2026 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
HYHao Yan
Hao Yan
CLChaozhuo Li
Chaozhuo Li
JYJun Yin
Jun Yin
WHWeihao Han
Weihao Han
HSHao Sun
Hao Sun
JWJianxin Wang
Jianxin Wang
Text-Attributed Graphs (TAGs) are prevalent in various real-world scenarios, where each node is associated with a text attribute. Representation learning on TAGs relies on a comprehensive understanding of both the textual attributes and the topological connections. Recent works have enhanced graph neural networks (GNNs) with pre-trained language models (PLMs) for textual attribute modeling, achieving promising results compared with shallow text representations such as BoW. With the advent of more powerful LLMs, how to effectively and efficiently inject the generic knowledge in LLMs into representation learning on TAGs still calls for systematic investigation. To this end, we first examine whether mainstream generative LLMs can provide high-quality generic text embeddings that can be directly used by downstream GNNs, and further explore their complementarity with the task-specific knowledge from a tuned PLM (TLM). Based on these observations, we propose a dual-channel knowledge fusion framework, named MoKGNN, to simultaneously leverage the generic semantic knowledge from LLMs and the task adaptation capability of TLM. Specifically, we design a dual-channel feature extraction module to learn generic and task-specific text representations separately. Next, we introduce a Knowledge Alignment Network to align the LLM embeddings with the TLM representations. Finally, MoKGNN adopts a global mixing weight to fuse the two channels, obtaining a unified node embedding for downstream GNN training. Moreover, we further analyze a key limitation of such early feature fusion under message passing: once heterogeneous text features are merged before neighborhood aggregation, source-specific noise and non-aligned semantics may be diffused together and become harder to disentangle and correct. Motivated by this observation, we propose IMoKGNN, a decoupled dual-stream framework that propagates LLM and TLM features in parallel with a shared GNN backbone and performs late fusion in logit space. Extensive experiments on five TAG datasets demonstrate the effectiveness of our approaches for both node classification and link prediction, and show that IMoKGNN yields more reliable improvements than MoKGNN.