Demo Data from EDBT 2026 / reviewers in the wild / expert
Xingrun Li
dblp:381/1214
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-0128-0414ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Graph learning · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network
graph transformer |
0.9 | 1 | 2025 | Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering · ICML 2025 |
Machine learning › Graph learning › graph neural network › geometric graph neural network
hyperbolic graph neural network |
0.9 | 1 | 2025 | Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering · ICML 2025 |
Recommender systems
collaborative filtering |
0.9 | 1 | 2025 | Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering · ICML 2025 |
Recommender systems › collaborative filtering › graph collaborative filtering
graph neural network-based collaborative filtering |
0.9 | 1 | 2025 | Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
hyperbolic graph convolution · 1.7cross-attention · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Hgformer: Hyperbolic Graph Transformer for Collaborative FilteringabstractRecommender systems are increasingly spreading to different areas like e-commerce or video streaming to alleviate information overload. One of the most fundamental methods for recommendation is Collaborative Filtering (CF), which leverages historical user-item interactions to infer user preferences. In recent years, Graph Neural Networks (GNNs) have been extensively studied to capture graph structures in CF tasks. Despite this remarkable progress, local structure modeling and embedding distortion still remain two notable limitations in the majority of GNN-based CF methods. Therefore, in this paper, we propose a novel Hyperbolic Graph Transformer architecture, to tackle the long-tail problems in CF tasks. Specifically, the proposed framework is comprised of two essential modules: 1) Local Hyperbolic Graph Convolutional Network (LHGCN), which performs graph convolution entirely in the hyperbolic manifold and captures the local structure of each node; 2) Hyperbolic Transformer, which is comprised of hyperbolic cross-attention mechanisms to capture global information. Furthermore, to enable its feasibility on large-scale data, we introduce an unbiased approximation of the cross-attention for linear computational complexity, with a theoretical guarantee in approximation errors. Empirical experiments demonstrate that our proposed model outperforms the leading collaborative filtering methods and significantly mitigates the long-tail issue in CF tasks. Our implementations are available in https://github.com/EnkiXin/Hgformer. Xin Yang 0041, Xingrun Li, Heng Chang, Jinze Yang, Xihong Yang, Shengyu Tao, Maiko Shigeno, Ningkang Chang, Junfeng Wang 0009, Dawei Yin 0001, Erxue Min |
ICML | 2 |
| 2024 | Hyperbolic Contrastive Learning for Cross-Domain RecommendationabstractCross-Domain Recommendation (CDR) seeks to utilize knowledge from different domains to alleviate the problem of data sparsity in the target recommendation domain, and has been gaining more attention in recent years. Although there have been notable advances in this area, most current methods represent users and items in Euclidean space, which is not ideal for handling long-tail distributed data in recommendation systems. Additionally, adding data from other domains can worsen the long-tail characteristics of the entire dataset, making it harder to train CDR models effectively. Recent studies have shown that hyperbolic methods are particularly suitable for modeling long-tail distributions, which has led us to explore hyperbolic representations for users and items in CDR scenarios. However, due to the distinct characteristics of the different domains, applying hyperbolic representation learning to CDR tasks is quite challenging. In this paper, we introduce a new framework called Hyperbolic Contrastive Learning (HCTS), designed to capture the unique features of each domain while enabling efficient knowledge transfer between domains. We achieve this by embedding users and items from each domain separately and mapping them onto distinct hyperbolic manifolds with adjustable curvatures for prediction. To improve the representations of users and items in the target domain, we develop a hyperbolic contrastive learning module for knowledge transfer. Extensive experiments on real-world datasets demonstrate that hyperbolic manifolds are a promising alternative to Euclidean space for CDR tasks. The codes are available at https://github.com/EnkiXin/hcts. Xin Yang 0041, Heng Chang, Zhijian Lai, Jinze Yang, Xingrun Li, Yu Lu 0009, Shuaiqiang Wang, Dawei Yin 0001, Erxue Min |
CIKM | 5 |