Zhiping Xiao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhiping Xiao has a total of 134 co-authors. Here are the top co-authors by number of shared publications:
- Ming Zhang
State Key Laboratory for Multimedia Information Processing, School of Computer Science, PKU-Anker LLM Lab, Peking University, Beijing, China
28 shared publications - Wei Ju
Sichuan University, Chengdu, China
19 shared publications - Xiao Luo
University of Wisconsin–Madison, Madison, WI, USA
16 shared publications - Yifan Wang
University of International Business and Economics, Beijing, China
11 shared publications - Yifang Qin
State Key Laboratory for Multimedia Information Processing, School of Computer Science, PKU-Anker LLM Lab, Peking University, Beijing, China
9 shared publications - Yiyang Gu
Peking University, Beijing, China
9 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5910-5921
POLAR: Policy Optimization through Larger Reasoners
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5910-5921
Open AccessPOLAR: Policy Optimization through Larger Reasoners
- Open Access
- 26 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Interests Burn-down Diffusion Process for Personalized Collaborative Filtering
Generative methods have gained widespread attention in Collaborative Filtering (CF) tasks for their ability to produce high-quality personalized samples aligned with users’ interests. Among them, diffusion generative models have raised increasing attention in recommendation field. Despite that the pioneering efforts have applied the conventional diffusion process to model diffusive user interests, the incongruity between the Gaussian noise and the subtle nature of user's personalized interaction behavior has led to sub-optimal results. To this end, we introduce a specifically-tailored diffusion scheme for interaction systems, namely the interests burn-down process . The interests burn-down process delineates the decay of user interests towards candidate items, complemented by its reverse burn-up process that yields personalized recommendation for users. The inherent burn-down nature of this process adeptly models the diffusive user interests, aligning seamlessly with the requirements of CF tasks. We present a novel recommendation method StageCF to illustrate the superiority of this newly proposed diffusion process. Experimental results have demonstrated the effectiveness of StageCF against existing generative and diffusion-based baseline methods. Furthermore, comprehensive studies validate the functionality of interests burn-down process, shedding light on its capacity to generate personalized interactions.
- 26 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Open AccessInterests Burn-down Diffusion Process for Personalized Collaborative Filtering
Generative methods have gained widespread attention in Collaborative Filtering (CF) tasks for their ability to produce high-quality personalized samples aligned with users’ interests. Among them, diffusion generative models have raised increasing attention in recommendation field. Despite that the pioneering efforts have applied the conventional diffusion process to model diffusive user interests, the incongruity between the Gaussian noise and the subtle nature of user's personalized interaction behavior has led to sub-optimal results. To this end, we introduce a specifically-tailored diffusion scheme for interaction systems, namely the interests burn-down process . The interests burn-down process delineates the decay of user interests towards candidate items, complemented by its reverse burn-up process that yields personalized recommendation for users. The inherent burn-down nature of this process adeptly models the diffusive user interests, aligning seamlessly with the requirements of CF tasks. We present a novel recommendation method StageCF to illustrate the superiority of this newly proposed diffusion process. Experimental results have demonstrated the effectiveness of StageCF against existing generative and diffusion-based baseline methods. Furthermore, comprehensive studies validate the functionality of interests burn-down process, shedding light on its capacity to generate personalized interactions.
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1358-1368
PROBE: VLM-Guided Discrete Structural Reconfiguration for Customized and Efficient Video Retrieval
Existing self-supervised video hashing methods achieve high efficiency by encoding videos into compact binary representations, but they typically rely on a fixed global similarity geometry that enforces a single notion of similarity across all queries. In many real-world retrieval scenarios, however, the same videos may need to be compared under different semantic criteria, such as action, scene, object, emotion, or intent. This requirement gives rise to criterion-dependent video comparison, which remains largely unexplored in efficient hashing-based retrieval frameworks. To this end, we propose an efficient VLM-guided video retrieval paradigm PROBE that leverages a frozen vision–language model (VLM) to inject rich semantic structure into a reusable hash index. Each video is encoded once into a compact binary representation, while prompts act as discrete operators that select criterion-relevant semantic subspaces within the hash space, inducing discrete structural reconfiguration of similarity geometry and enabling customized video–video comparison via efficient masked distance computation. Guided by prompt-conditioned representations from the vision–language teacher, we introduce criterion-induced subspace regularization that transfers semantic geometry into criterion-conditioned hash subspaces while preserving local relational consistency. We further employ a global unconditional alignment and reconstruction objective to stabilize the full hash space across views and datasets. A single model trained jointly on heterogeneous video datasets consistently outperforms strong video hashing baselines and generalizes effectively to unseen datasets and diverse retrieval criteria, demonstrating that VLM-guided discrete structural reconfiguration is key to efficient, customized, and reusable video retrieval. The source code is available at https://github.com/liamgu06/PROBE.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1358-1368
Open AccessPROBE: VLM-Guided Discrete Structural Reconfiguration for Customized and Efficient Video Retrieval
Existing self-supervised video hashing methods achieve high efficiency by encoding videos into compact binary representations, but they typically rely on a fixed global similarity geometry that enforces a single notion of similarity across all queries. In many real-world retrieval scenarios, however, the same videos may need to be compared under different semantic criteria, such as action, scene, object, emotion, or intent. This requirement gives rise to criterion-dependent video comparison, which remains largely unexplored in efficient hashing-based retrieval frameworks. To this end, we propose an efficient VLM-guided video retrieval paradigm PROBE that leverages a frozen vision–language model (VLM) to inject rich semantic structure into a reusable hash index. Each video is encoded once into a compact binary representation, while prompts act as discrete operators that select criterion-relevant semantic subspaces within the hash space, inducing discrete structural reconfiguration of similarity geometry and enabling customized video–video comparison via efficient masked distance computation. Guided by prompt-conditioned representations from the vision–language teacher, we introduce criterion-induced subspace regularization that transfers semantic geometry into criterion-conditioned hash subspaces while preserving local relational consistency. We further employ a global unconditional alignment and reconstruction objective to stabilize the full hash space across views and datasets. A single model trained jointly on heterogeneous video datasets consistently outperforms strong video hashing baselines and generalizes effectively to unseen datasets and diverse retrieval criteria, demonstrating that VLM-guided discrete structural reconfiguration is key to efficient, customized, and reusable video retrieval. The source code is available at https://github.com/liamgu06/PROBE.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3753-3758
EviRAG: Evidence-Guided Retrieval-Augmented Generation for Medical Vision-Language Models
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3753-3758
Open AccessEviRAG: Evidence-Guided Retrieval-Augmented Generation for Medical Vision-Language Models
- Open Access
A multi-agent system for spine MRI report generation from multi-sequence imaging
Spinal pathology is a leading cause of pain and disability worldwide. Spine magnetic resonance imaging (MRI) is central to clinical evaluation, yet its interpretation remains complex and time-consuming, requiring integration of information across multiple imaging sequences and anatomical regions. Despite recent advances in automated MRI analysis, effectively combining multi-sequence data while preserving sequence-specific diagnostic information remains an open challenge. Here we present SpineAgent , a multi-agent framework for spine MRI report generation built upon a multi-sequence foundation model trained on routine clinical data from 32,047 patients and 453,683 MRI series, comprising a total of 13,441,191 MRI slices. To accommodate diverse modalities of sequences, we first pre-train two DINOv3-based encoders separately on T1- and T2-weighted sequences. We then introduce a continual training strategy that learns a synthesizer to embed images of other sequences using the T1 and T2 encoders, producing patient-level embedding that integrates various signals across MRI sequences. Using these embeddings, SpineAgent achieves state-of-the-art performance, with mean 10.8% AUROC improvement across 17 spinal condition-prediction tasks compared to the best competing method, and demonstrates strong generalizability under cross-manufacturer and cross-cohort evaluation. Beyond classification, SpineAgent enables pathology localization by identifying findings-relevant slices and segmenting pathological regions. It also supports multimodal image–report retrieval, providing a solid foundation for scalable and explainable MRI report generation. We further integrate these validated capabilities of SpineAgent into 37 specialized agents for condition diagnosis, pathological-region localization, and clinically-similar-cases retrieval. Finally, we incorporate their outputs as structured tokens within a Medical Report Agent trained end-to-end for report generation. Through both automated metrics and expert evaluation by five radiologists, SpineAgent achieves leading performance in spine MRI report generation. Together, SpineAgent introduces a continual training approach for multi-sequence spine MRI understanding. By decomposing report generation into clinically grounded subtasks addressed by specialized agents, the SpineAgent framework enables accurate, interpretable and generalizable spine MRI reporting across diverse imaging sequences and anatomical regions.
Open AccessA multi-agent system for spine MRI report generation from multi-sequence imaging
Spinal pathology is a leading cause of pain and disability worldwide. Spine magnetic resonance imaging (MRI) is central to clinical evaluation, yet its interpretation remains complex and time-consuming, requiring integration of information across multiple imaging sequences and anatomical regions. Despite recent advances in automated MRI analysis, effectively combining multi-sequence data while preserving sequence-specific diagnostic information remains an open challenge. Here we present SpineAgent , a multi-agent framework for spine MRI report generation built upon a multi-sequence foundation model trained on routine clinical data from 32,047 patients and 453,683 MRI series, comprising a total of 13,441,191 MRI slices. To accommodate diverse modalities of sequences, we first pre-train two DINOv3-based encoders separately on T1- and T2-weighted sequences. We then introduce a continual training strategy that learns a synthesizer to embed images of other sequences using the T1 and T2 encoders, producing patient-level embedding that integrates various signals across MRI sequences. Using these embeddings, SpineAgent achieves state-of-the-art performance, with mean 10.8% AUROC improvement across 17 spinal condition-prediction tasks compared to the best competing method, and demonstrates strong generalizability under cross-manufacturer and cross-cohort evaluation. Beyond classification, SpineAgent enables pathology localization by identifying findings-relevant slices and segmenting pathological regions. It also supports multimodal image–report retrieval, providing a solid foundation for scalable and explainable MRI report generation. We further integrate these validated capabilities of SpineAgent into 37 specialized agents for condition diagnosis, pathological-region localization, and clinically-similar-cases retrieval. Finally, we incorporate their outputs as structured tokens within a Medical Report Agent trained end-to-end for report generation. Through both automated metrics and expert evaluation by five radiologists, SpineAgent achieves leading performance in spine MRI report generation. Together, SpineAgent introduces a continual training approach for multi-sequence spine MRI understanding. By decomposing report generation into clinically grounded subtasks addressed by specialized agents, the SpineAgent framework enables accurate, interpretable and generalizable spine MRI reporting across diverse imaging sequences and anatomical regions.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1160-1170
KEGOD: Kernel-enhanced Latent Substructure Learning for Graph Out-Of-Distribution Detection
Out-of-Distribution (OOD) detection, which seeks to identify samples deviating from the In-Distribution (ID) training distribution at test time, is crucial for building robust machine learning systems. While extensive efforts have been made for Euclidean data, OOD detection on graph-structured data remains relatively underexplored. On the one hand, the specific properties of a graph may be attributed to its substructures. On the other hand, acquiring labeled data for graph learning is typically time-consuming and labor-intensive. Toward this end, in this paper, we propose a novel kernel-enhanced graph substructure learning framework termed KEGOD for unsupervised graph OOD detection. Specifically, we introduce a learnable graph generator to construct the augmented graph view that preserves distinguishable structure information. Then, for both the input graph and augmented view, a graph neural network (GNN) branch and a graph kernel (GK) branch are incorporated to explore graph latent patterns. By performing multi-branch concordance learning on the extracted graph patterns, our KEGOD captures complementary ID structural semantics in both implicit and explicit manners, enabling reliable detection of OOD graphs through semantic inconsistency. Finally, we build a self-adaptive training mechanism to automatically control diverse sensitivities of the graph patterns. Experimental results on several public graph datasets reveal the superiority of our KEGOD. Our code is available at~ https://github.com/jamesyifan/KEGOD.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1160-1170
Open AccessKEGOD: Kernel-enhanced Latent Substructure Learning for Graph Out-Of-Distribution Detection
Out-of-Distribution (OOD) detection, which seeks to identify samples deviating from the In-Distribution (ID) training distribution at test time, is crucial for building robust machine learning systems. While extensive efforts have been made for Euclidean data, OOD detection on graph-structured data remains relatively underexplored. On the one hand, the specific properties of a graph may be attributed to its substructures. On the other hand, acquiring labeled data for graph learning is typically time-consuming and labor-intensive. Toward this end, in this paper, we propose a novel kernel-enhanced graph substructure learning framework termed KEGOD for unsupervised graph OOD detection. Specifically, we introduce a learnable graph generator to construct the augmented graph view that preserves distinguishable structure information. Then, for both the input graph and augmented view, a graph neural network (GNN) branch and a graph kernel (GK) branch are incorporated to explore graph latent patterns. By performing multi-branch concordance learning on the extracted graph patterns, our KEGOD captures complementary ID structural semantics in both implicit and explicit manners, enabling reliable detection of OOD graphs through semantic inconsistency. Finally, we build a self-adaptive training mechanism to automatically control diverse sensitivities of the graph patterns. Experimental results on several public graph datasets reveal the superiority of our KEGOD. Our code is available at~ https://github.com/jamesyifan/KEGOD.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1286-1297
Long-Tailed Recognition of Evidential Experts for Graph-level Classification
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1286-1297
Open AccessLong-Tailed Recognition of Evidential Experts for Graph-level Classification
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1529-1539
Space-based Parameter Evolving with Lightweight Optimization for Graph Adaptation to Evolving Shifts
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1529-1539
Open AccessSpace-based Parameter Evolving with Lightweight Optimization for Graph Adaptation to Evolving Shifts
- 3 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (4) , 2394-2407
Robust Cross Supervision With Target Mining for Source-Free Graph Domain Adaptation
Graph domain adaptation has emerged as a critical challenge in real-world applications, where labeled graph data is often scarce and expensive to obtain. While existing methods have shown promise, they typically require access to source domain data, which may be restricted due to privacy concerns or data regulations. To address these limitations, we investigate the challenging yet practical problem of source-free graph domain adaptation. We propose a new approach named Robust Cross Supervision with Target Mining (ROSE) for this problem. ROSE achieves robustness by considering the complementary topology of graphs. The model consists of a message-passing branch for local semantic learning and a graph-kernel branch for global structural capture. Both branches are incorporated into a unified cross-supervision framework. To improve the robustness of the optimization process, we explore the context of the target domain, and divide the target data into discriminant set and anchor set. Then we incorporate the two tasks into a meta-learning optimization framework. Extensive experiments on benchmark datasets have demonstrated that our ROSE, compared with a wide range of baselines, always yields superior performance.
- 3 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (4) , 2394-2407
Robust Cross Supervision With Target Mining for Source-Free Graph Domain Adaptation
Graph domain adaptation has emerged as a critical challenge in real-world applications, where labeled graph data is often scarce and expensive to obtain. While existing methods have shown promise, they typically require access to source domain data, which may be restricted due to privacy concerns or data regulations. To address these limitations, we investigate the challenging yet practical problem of source-free graph domain adaptation. We propose a new approach named Robust Cross Supervision with Target Mining (ROSE) for this problem. ROSE achieves robustness by considering the complementary topology of graphs. The model consists of a message-passing branch for local semantic learning and a graph-kernel branch for global structural capture. Both branches are incorporated into a unified cross-supervision framework. To improve the robustness of the optimization process, we explore the context of the target domain, and divide the target data into discriminant set and anchor set. Then we incorporate the two tasks into a meta-learning optimization framework. Extensive experiments on benchmark datasets have demonstrated that our ROSE, compared with a wide range of baselines, always yields superior performance.
- Open Access
- 21 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-22
SPOT: Spectral Optimal Transport for Graph Domain Generalization
Graph neural networks (GNNs) have essentially taken over as the de facto model for learning graph-structured data. However, the majority of existing methods perform transductive learning in a known graph, which is unable to tackle abundant in-the-wild unseen graphs with potential domain shifts. Even worse, these graphs, accompanied by domain shifts on structural topology and node attributes, bring in vulnerable data bias and thus a huge drop in performance. To tackle this, we propose a novel GNN method named spectral optimal transport (SPOT) for effective domain generalization on graphs. Our method is motivated by the fact that the high-frequency graph spectrum is more likely to indicate domain differences. In particular, we formulate the structural augmentation as an optimal transport problem to retain low-frequency key knowledge and solve the problem using Sinkhorn-Knopp algorithm. In addition, we incorporate an adaptive perturbation strategy to deep features, where the direction of the additive noise is determined by the homophily degrees to maintain semantic properties. Accordingly, we meticulously construct a collection of real-world benchmark datasets to assess the domain generalization capability of our model on graphs, and extensive experiments confirm the effectiveness of our proposed SPOT.
- 21 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-22
Open AccessSPOT: Spectral Optimal Transport for Graph Domain Generalization
Graph neural networks (GNNs) have essentially taken over as the de facto model for learning graph-structured data. However, the majority of existing methods perform transductive learning in a known graph, which is unable to tackle abundant in-the-wild unseen graphs with potential domain shifts. Even worse, these graphs, accompanied by domain shifts on structural topology and node attributes, bring in vulnerable data bias and thus a huge drop in performance. To tackle this, we propose a novel GNN method named spectral optimal transport (SPOT) for effective domain generalization on graphs. Our method is motivated by the fact that the high-frequency graph spectrum is more likely to indicate domain differences. In particular, we formulate the structural augmentation as an optimal transport problem to retain low-frequency key knowledge and solve the problem using Sinkhorn-Knopp algorithm. In addition, we incorporate an adaptive perturbation strategy to deep features, where the direction of the additive noise is determined by the homophily degrees to maintain semantic properties. Accordingly, we meticulously construct a collection of real-world benchmark datasets to assess the domain generalization capability of our model on graphs, and extensive experiments confirm the effectiveness of our proposed SPOT.