OpenRaiser/Intern-Atlas huggingface dataset:
EVINET: Towards Open-World Graph Learning via Evidential Reasoning Network
Authors: Weijie Guan, Haohui Wang, Jian Kang, Lihui Liu, Dawei Zhou
Venue: KDD
Year: 2025

Graph learning has been crucial to many real-world tasks, but they are often studied with a closed-world assumption, with all possible labels of data known a priori. To enable effective graph learning in an open and noisy environment, it is critical to inform the model users when the model makes a wrong prediction to in-distribution data of a known class, i.e., misclassification detection or when the model encounters out-of-distribution from novel classes, i.e., out-of-distribution detection. This paper introduces Evidential Reasoning Network (EVINET), a framework that addresses these two challenges by integrating Beta embedding within a subjective logic framework. EVINET includes two key modules: Dissonance Reasoning for misclassification detection and Vacuity Reasoning for out-of-distribution detection. Extensive experiments demonstrate that EVINET outperforms state-of-the-art methods across multiple metrics in the tasks of in-distribution classification, misclassification detection, and out-of-distribution detection. EVINET demonstrates the necessity of uncertainty estimation and logical reasoning for misclassification detection and out-of-distribution detection and paves the way for open-world graph learning. Our code and data are available at https://github.com/SSSKJ/EviNET.
Effective Two-Stage Knowledge Transfer for Multi-Entity Cross-Domain Recommendation
Authors: Jianyu Guan, Zongming Yin, Tianyi Zhang, Leihui Chen, Yin Zhang, Fei Huang, Shuguang Han, Jufeng Chen
Venue: KDD
Year: 2025

In recent years, the recommendation content on e-commerce platforms has become increasingly rich -- a single user feed may contain multiple entities, such as selling products, short videos, and content posts. To deal with the multi-entity cross-domain recommendation problem, an intuitive solution is to adopt the shared-network-based architecture for joint training. The underlying idea is to transfer the knowledge from one type of entity (source entity) to another (target entity). However, different from the conventional same-entity cross-domain recommendation, multi-entity knowledge transfer encounters several important challenges: (1) data distributions of the source entity and target entity are naturally different, making the shared-network-based joint training susceptible to the negative transfer issue(2) the corresponding feature schema of each entity is not exactly aligned (e.g., price is an essential feature for selling product while missing for content posts), making the existing approaches no longer appropriate. Recent researchers have also experimented with the pre-training and fine-tuning paradigm. Again, they only take into account the scenarios with the same entity type and feature schemas, which is inappropriate in our case. To this end, we design a pre-training & fine-tuning based Multi-entity Knowledge Transfer framework called MKT. MKT utilizes a multi-entity pre-training module to extract transferable knowledge across different entities. In particular, a feature alignment module is first applied to scale and align different feature schemas. Afterward, a couple of knowledge extractors are employed to extract the common and independent knowledge. In the end, the extracted common knowledge is adopted for target entity model training. Through extensive offline and online experiments on public and industrial datasets, we demonstrated the superiority of MKT over multiple State-Of-The-Art methods. MKT has also been deployed for content post recommendations on our production system.
GRASP: Differentially Private Graph Reconstruction Defense with Structured Perturbation
Authors: Zhiyu Guo, Yang Liu, Xiang Ao, Qing He
Venue: KDD
Year: 2025

In this paper, we reveal that existing Differentially Private Graph Neural Networks (DP-GNNs) are not effective against Graph Reconstruction Attack (GRA). We further attribute the ineffectiveness of existing DP-GNNs against GRA to their unstructured perturbation mechanism, which only induces unidirectional shift in the embedding similarity distribution. Specifically, this perturbation mechanism tends to decrease the embedding similarity of all node pairs without significantly disrupting the relative ranking, thus allowing GRA to still reconstruct the original graph structure by leveraging the relative ranking of similarities. To address this, we propose a novel Differentially Private Graph Neural Network based on Structured Perturbation (GRASP). Specifically, we observe that independent noise tends to decrease the embedding similarity, while identical noise tends to increase it. By integrating these two types of noise using a Bernoulli technique, we introduce a simple yet effective structured perturbation mechanism, which promotes bidirectional shift in the embedding similarity distribution, thereby effectively disrupting the relative ranking and defending against GRA. Extensive experiments on eight benchmark datasets demonstrate that GRASP effectively defends against GRA. Furthermore, GRASP achieves a superior privacy-utility trade-off compared to existing graph structure protection methods. The implementation of GRASP is available at https://github.com/ZhiyuZone/GRASP/.
Enhancing Text-Based Hierarchical Multilabel Classification for Mobile Applications via Contrastive Learning
Authors: Jiawei Guo, Yang Xiao, Weipéng Huáng, Guangyuan Piao
Venue: KDD
Year: 2025

A hierarchical labeling system for mobile applications (apps) benefits a wide range of downstream businesses that integrate the labeling with their proprietary user data, to improve user modeling. Such a label hierarchy can define more granular labels that capture detailed app features beyond the limitations of traditional broad app categories. In this paper, we address the problem of hierarchical multilabel classification for apps by using their textual information such as names and descriptions. We present: 1) HMCN (Hierarchical Multilabel Classification Network) for handling the classification from two perspectives: the first focuses on a multilabel classification without hierarchical constraints, while the second predicts labels sequentially at each hierarchical level considering such constraints; 2) HMCL (Hierarchical Multilabel Contrastive Learning), a scheme that is capable of learning more distinguishable app representations to enhance the performance of HMCN. Empirical results on our Tencent App Store dataset and two public datasets demonstrate that our approach performs well compared with state-of-the-art methods. The approach has been deployed at Tencent and the multilabel classification outputs for apps have helped a downstream task--credit risk management of users--improve its performance by 10.70% with regard to the Kolmogorov-Smirnov metric, for over one year.
S3GA: Towards Scalable Self-Supervised Learning for Large Scale Graph Alignment
Authors: Wenqi Guo, Shikui Tu, Lei Xu
Venue: KDD
Year: 2025

Graph Alignment (GA) is an NP-hard combinatorial challenge. The existing methods usually work on small-scale graphs because their computational complexity grows as the square of the number of nodes. Recent techniques relied on alignment labels to divide the large source and target graphs into small ones respectively, which are then aligned separately. However, the alignment labels in expansive real-world graphs are often scarce, which makes GA even more challenging. To address these issues, we propose a novel self-supervised learning framework that is able to work on the graphs of million nodes without any alignment labels, where the existing methods usually fail to output an answer within a reasonable time. Our method also falls in the divide-and-conquer paradigm. We do not cluster the source and target graph separately by the existing graph clustering algorithms, because it is difficult to pair and then align the cluster-induced source and target subgraphs in the absence of alignment labels. We devise an Alignment-Aware Clustering (AAC) method to partition the source and target nodes jointly and keep the ought-to-be-aligned pairs of nodes within the same cluster as much as possible. Furthermore, we develop a Topology-Aware Repartition (TAR) that leverages pseudo-alignment labels as anchors for re-clustering, preserving detailed structural information within clusters. This enables graph neural networks to effectively enhance the graph representation learning for node alignments which are self-supervised by a graph-matching solver. Extensive experiments have demonstrated that our method greatly reduces computational demands and sustains high alignment accuracies in large-scale graph applications.
FEZE: Alignment-Flexible Zero-Shot Vertical Federated Learning
Authors: Wei Guo, Yiqi Tong, Yiyang Duan, Fuzhen Zhuang, Xiao Zhang, Zhaojun Hu, Jin Dong
Venue: KDD
Year: 2025

Different from existing vertical federated learning (VFL), zero-shot VFL (ZVFL) is an under-explored scenario where test classes are absent from partial parties' training sets. In extreme cases, some test classes even have no training samples for all parties. Traditionally, existing zero-shot methods require abundant seen-class samples for effective knowledge transfer to recognize unseen classes. However, both the limited aligned samples and different seen classes pose several unique challenges to ZVFL. The primary challenge lies in the seen-to-unseen transfer insufficiency, as the scarcity of aligned samples and diverse seen-class distributions across parties severely limits the model's capability to learn discriminative features that can generalize to unseen classes. Moreover, the multi-party bias inconsistency arises as different parties tend to be biased towards their own seen classes during prediction, leading to skewed classification results at the active party. To address these challenges, we propose FEZE, an alignment-flexible zero-shot vertical federated learning framework. Specifically, we introduce a relation learning network to capture class-feature relationships between class labels and feature representations across heterogeneous feature spaces, enabling unseen class recognition through relationship inference. Additionally, we design a meta-relation learning mechanism that leverages diverse class-feature patterns to tackle the insufficient feature generalization from limited seen-class samples. Finally, we propose an alignment-flexible adaptive aggregation strategy that achieves adaptively aggregation based on inconsistent prediction spaces with arbitrary number of aligned samples. Theoretical analysis proves that FEZE can achieve a convergence rate of O(1/T). In the most challenging zero-shot scenario without aligned samples, FEZE surpasses state-of-the-art baselines by an average of 7.47% across three datasets.
Improving Subgraph Matching by Combining Algorithms and Graph Neural Networks
Authors: Shuyang Guo, Wenjin Xie, Ping Lu, Ting Deng, Richong Zhang, Jianxin Li, Xiangping Huang, Zhongyi Liu
Venue: KDD
Year: 2025

Homomorphism is an important structure-preserving mapping between graphs. Given a graph G and a pattern Q, the subgraph homomorphism problem is to find a mapping φ from Q to G such that adjacent vertices of Q are mapped to adjacent vertices in G. Unlike the subgraph isomorphic mapping that is injective, homomorphism allows multiple vertices in Q to map to the same vertex in G, increasing complexity. We develop HFrame, the first GNN-based framework for subgraph homomorphism, by combining algorithms and machine learning. We show that HFrame is more expressive than the vanilla GNN, i.e., HFrame can distinguish more graph pairs (Q, G) such that Q is not homomorphic to G. Moreover, we provide a generalization error bound for HFrame. Using real-life and synthetic graphs, we show that HFrame is up to 101.91× faster than exact matching algorithms, and its average accuracy can reach 0.962.
Efficient Multi-Expert Tabular Language Model for Banking
Authors: Yue Guo, Wentao Zhang, Xiaojun Zhang, Vincent W. Zheng, Yi Yang
Venue: KDD
Year: 2025

Pre-training large Tabular Language Models (TaLMs) on tabular data has shown effectiveness for table understanding tasks. However, training proprietary large TaLMs on a company's private databases requires substantial computational resources. This paper presents an efficient multi-expert TaLM architecture and training method tailored for multi-domain databases and modest infrastructure. This architecture leverages a divide-and-conquer pretraining approach and a sparsely activated fine-tuning paradigm to reduce computation. Using this architecture, we pre-train and fine-tune a TaLM with 10 billion parameters on a banking database under simple computational infrastructures. We apply our TaLM to support various important banking applications, including risk assessment, information prediction, and profit assessment. Compared with previous baselines, our model achieves +29.3% in precision@0.6% on risk assessment and +16.5% in accuracy on information prediction, showing great effectiveness and profitability of our model. This model is successfully deployed in WeBank and now supports many real business scenarios.
Persona Identification in E-Commerce with Scarce Labels and In-Context Graph Learning
Authors: Anjali Gupta, Prashant Kumar, Aniket Mishra, Abhishek Singh, Surender Kumar, Muthusamy Chelliah, Abhijnan Chakraborty, Sayan Ranu
Venue: KDD
Year: 2025

User personas play a crucial role in shaping shopping behavior, making persona identification an essential task for e-commerce platforms to personalize user experiences. However, this problem remains highly challenging due to several key factors: (1) users often exhibit multiple personas simultaneously (e.g., a fashion enthusiast who is also a sports lover)(2) labeled data is scarce, as annotation requires extensive human supervision(3) real-world user-product interaction data is inherently noisy, as accounts may be shared among multiple individuals, complicating persona assessment, and (4) user-product interactions form a dynamic, heterogeneous bipartite graph where product features are diverse, and personas evolve due to shifts in interests, seasons, and external events. In this work, we study the problem of persona identification on an extensive real-world user-product interaction dataset spanning six months (August 2023 to January 2024), capturing user behavior influenced by real-world factors such as seasonal changes, festivals (e.g., Christmas, New Year), and major sales events. To model persona identification in this evolving interaction graph, we reformulate the multi-label node classification task as a link prediction problem, enabling a structured decoupling of user and persona representations. To this end, we propose TRIPER, a novel TRIpartite graph neural network specifically designed to enhance multi-label PERsona classification along with in-context inference capabilities. Extensive evaluations on our real-world dataset demonstrate that TRIPER achieves high predictive accuracy in user persona identification, exhibits strong generalization over time, and effectively learns from limited labeled data, outperforming state-of-the-art baselines.
SIGEM: A Simple yet Effective Similarity based Graph Embedding Method
Authors: Masoud Reyhani Hamedani, Jeong-Seok Oh, Seong-Un Cho, Sang-Wook Kim
Venue: KDD
Year: 2025

In the literature, various graph embedding methods have been proposed. Although they have pioneered notable techniques in the field, we point out their four drawbacks as follows: (1) inability to consider global graph structure(2) undermining learning quality(3) impairing in/out-degree distributions in directed graphs, and (4) limited applicability. Inspired by these drawbacks, we first propose LINOW, a recursive LI nk-based similarity measure for graphs by utilizing NO des' Weights, which is applicable to both directed and undirected graphs. Then, we provide a matrix form that dramatically accelerates LINOW's computation without approximation. Furthermore, to enhance its scalability, we provide two variants, LINOW-sn and LINOW-bn, to compute similarity scores w.r.t. a single node and a batch of nodes, respectively. Finally, we propose SIGEM, a simple yet effective self-supervised and contrastive-free SI milarity based Graph EM bedding method that employs LINOW-bn to compute similarity scores of nodes in the graph, thereby ranking them. Then, it tries to preserve the original ranks of nodes in the graph within their corresponding vectors in the embedding space, by employing a single-layer neural network. The results of our extensive experiments with eight real-world datasets and thirteen state-of-the-art and conventional embedding methods demonstrate that (1) LINOW-sn and LINOW-bn successfully improve the scalability of naive LINOW(2) LINOW is beneficial to similarity based graph embedding, and (3) SIGEM consistently achieves the highest accuracy in both graph reconstruction and node classification tasks compared to other methods, while it significantly outperforms them in most cases of the link prediction task.
Controlling Diversity at Inference: Guiding Diffusion Recommender Models with Targeted Category Preferences
Authors: Gwangseok Han, Wonbin Kweon, Minsoo Kim, Hwanjo Yu
Venue: KDD
Year: 2025

Diversity control is an important task to alleviate bias amplification and filter bubble problems. The desired degree of diversity may fluctuate based on users' daily moods or business strategies. However, existing methods for controlling diversity often lack flexibility, as diversity is decided during training and cannot be easily modified during inference. We propose D3Rec (Disentangled Diffusion model for Diversified Recommendation), an end-to-end method that controls the accuracy-diversity trade-off at inference. D3Rec meets our three desiderata by (1) generating recommendations based on category preferences, (2) controlling category preferences during the inference phase, and (3) adapting to arbitrary targeted category preferences. In the forward process, D3Rec removes category preferences lurking in user interactions by adding noises. Then, in the reverse process, D3Rec generates recommendations through denoising steps while reflecting desired category preferences. Extensive experiments on real-world and synthetic datasets validate the effectiveness of D3Rec in controlling diversity at inference.
SGD-DyG: Self-Reliant Global Dependency Apprehending on Dynamic Graphs
Authors: Minglian Han, Ling Wang, Ye Yuan, Xin Luo
Venue: KDD
Year: 2025

Dynamic graphs offer more precise modeling of real-world applications compared to static graphs. Therefore, learning on dynamic graphs has garnered significant research attention in recent years. Unfortunately, the current approaches for learning dynamic graphs remain inadequate in capturing global spatial-temporal dependency. This issue arises from capturing biased spatial and temporal dependencies, thereby weakening the coupling between spatial and temporal dimensions. To overcome it, we propose a Self-Reliant Global Dependency Apprehending Framework on Dynamic Graphs, namely SGD-DyG. Specifically, we first design a frequency self-enhanced learning module that examines the global inherent interactions of the node features hidden in the frequency domain. Furthermore, we propose a global-local-mixed self-supervised learning module that maximizes spatial-temporal mutual information between local node and global graph embeddings. Extensive experiments on seven real-world dynamic graph datasets validate that the proposed SGD-DyG consistently exceeds state-of-the-art models.
Practical Contextual Bandits for Large-Scale Structured Discrete Constrained Optimization Problems
Authors: Pavithra Harsha, Chitra Subramanian, Naoki Abe, Shivaram Subramanian, Amadou Ba, Kevin Arturo Fernández Román, Mauricio Longinos Garrido, Chandrasekhar Narayanaswami
Venue: KDD
Year: 2025

We address the contextual bandit problem for high-dimensional combinatorial action spaces involving a class of structured discrete constrained optimization problems. In this setting, key quantities within the optimization formulation, such as performance indicators contributing to the objective or constraints, must be estimated from data during the trial sequence of optimized actions. These problems frequently arise in the many operations management domains including IT resource allocation and retail assortment price optimization. We propose a novel, practical, and transparent approach based on general-purpose regression oracles, leveraging Inverse Gap Weighting (IGW) for seamless integration within an optimization framework. IGW sampling is efficiently managed by: (a) a column generation reformulation of the underlying Mixed Integer Programming (MIP) model which allows for flexible lower-level predictors, causal coherence, and efficient representation of large action spaces;(b) a diverse solution pool generation to balance the exploration-exploitation trade-off in large action spaces. To address non-smoothness in the reward function due to optimization constraints, we incorporate a risk-averse phased learning strategy. We validate our approach on a real-world auto-scaling problem in IT automation, achieving a significant reduction in cumulative regret through skillful exploration, with additional gains from risk-averse methods that effectively manage constraint violations.
Collaborative Filtering Meets Spectrum Shift: Connecting User-Item Interaction with Graph-Structured Side Information
Authors: Yunhang He, Cong Xu, Jun Wang, Wei Zhang
Venue: KDD
Year: 2025

Graph Neural Networks (GNNs) have demonstrated their superiority in collaborative filtering, where the user-item (U-I) interaction bipartite graph serves as the fundamental data format. However, when graph-structured side information (e.g., multimodal similarity graphs or social networks) is integrated into the U-I bipartite graph, existing graph collaborative filtering methods fall short of achieving satisfactory performance. We quantitatively analyze this problem from a spectral perspective. Recall that a bipartite graph possesses a full spectrum within the range of [-1, 1], with the highest frequency exactly achievable at -1 and the lowest frequency at 1; however, we observe as more side information is incorporated, the highest frequency of the augmented adjacency matrix progressively shifts rightward. This spectrum shift phenomenon has caused previous approaches built for the full spectrum [-1, 1] to assign mismatched importance to different frequencies. To this end, we propose Spectrum Shift Correction (dubbed SSC), incorporating shifting and scaling factors to enable spectral GNNs to adapt to the shifted spectrum. Unlike previous paradigms of leveraging side information, which necessitate tailored designs for diverse data types, SSC directly connects traditional graph collaborative filtering with any graph-structured side information. Experiments on social and multimodal recommendation demonstrate the effectiveness of SSC, achieving relative improvements of up to 23% without incurring any additional computational overhead. Our code is available at https://github.com/yhhe2004/SSC-KDD.