Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guojun Zhu

dblp:30/8331 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 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
Efficient and distributed learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › federated learning › federated continual learning
federated class-incremental learning
1.012026
Enhancing Federated Class-Incremental Learning via Spatial-Temporal Statistics Aggregation · WWW 2026
Machine learning › Efficient and distributed learning
federated learning
1.012026
Enhancing Federated Class-Incremental Learning via Spatial-Temporal Statistics Aggregation · WWW 2026
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
1.012026
Enhancing Federated Class-Incremental Learning via Spatial-Temporal Statistics Aggregation · WWW 2026

Methods — techniques the papers use, named apart from their topics

second-order statistics approximation · 1.0feature statistics aggregation · 1.0
YearPublicationVenuePosition
2026 Enhancing Federated Class-Incremental Learning via Spatial-Temporal Statistics Aggregation
abstract
The growing presence of mobile and IoT devices has led to massive decentralized and evolving data, driving the rise of Federated Learning (FL) to enable collaborative training without data sharing. However, traditional FL assumes static data distributions, which is unrealistic for dynamic real-world environments. To address this challenge, Federated Class-Incremental Learning (FCIL) has emerged as a promising framework that enables flexible adaptation to newly introduced classes over time. Existing FCIL methods typically integrate old knowledge preservation into local client training. However, these methods cannot avoid spatial-temporal client drift caused by data heterogeneity and often incur significant computational and communication overhead, limiting practical deployment. To address these challenges simultaneously, we propose a novel approach, Spatial-Temporal Statistics Aggregation (STSA), which provides a unified framework to aggregate feature statistics both spatially (across clients) and temporally (across stages). The aggregated feature statistics are unaffected by data heterogeneity and can be used to update the classifier in closed form at each stage. Additionally, we introduce STSA-E, a communication-efficient variant that enables the server to approximate global second-order feature statistics using first-order statistics uploaded from clients. Theoretical analysis shows that it achieves similar performance to STSA with much lower communication overhead. Extensive experiments on three widely used FCIL datasets, with varying degrees of data heterogeneity, show that our method outperforms state-of-the-art FCIL methods in terms of performance, flexibility, and both communication and computation efficiency. The code is available at https://github.com/Yuqin-G/STSA.
Zenghao Guan, Guojun Zhu, Yucan Zhou, Wu Liu 0005, Weiping Wang 0005, Jiebo Luo 0001, Xiaoyan Gu 0001
WWW2
2026 Delta-Net: Deep Dual-Domain Alternating Optimization Network for High Pitch Helical CT Reconstruction
abstract
High pitch helical Computed Tomography (CT) scanning significantly reduces radiation dose while improving temporal resolution, offering substantial clinical benefits. However, the incomplete scanning data commonly leads to artifacts in the reconstructed images, degrading image quality and potentially affecting clinical diagnosis. Existing high pitch reconstruction methods primarily operate within the image domain or combine image-domain networks with traditional iterative algorithms, yet their performance remains limited. To address such limitations, we propose Delta-Net, a deep dual-domain alternating iterative optimization network for high pitch helical CT reconstruction. We introduce a novel optimization objective and develop an alternating iterative optimization framework, where each sub iteration consists of projection domain correction and image domain refinement. To enhance generalization and robustness, deep neural networks are employed to learn domain-specific priors, which are incorporated as regularization terms, with all hyper-parameters automatically optimized during training. Specifically, the image domain residual refinement network (IRN) and projection domain consistency enhanced network (PCN) regularize the intermediate results across both domains. Additionally, to improve the capability of artifact suppression and structure restoration, a structure-aware joint loss is tailored for the optimization of Delta-Net. Quantitative and qualitative evaluations on clinical datasets demonstrate that Delta-Net outperforms other competitive methods in artifact suppression, fine structure recovery, and generalization.
Xinyun Zhong, Guojun Zhu, Yikun Zhang 0001, Qianjin Feng 0001, Yang Chen 0008
IEEE Trans. Medical Imaging2
2025 Conditional Generative Learning from Invariant Representations in Multi-Source: Robustness and Efficiency
abstract
Multi-source generative models have gained significant attention due to their ability to capture complex data distributions across diverse domains. However, existing approaches often struggle with limitations such as negative transfer and an over-reliance on large pre-trained models. To address these challenges, we propose a novel method that effectively handles scenarios with outlier source domains, while making weaker assumptions about the data, thus ensuring broader applicability. Our approach enhances robustness and efficiency, supported by rigorous theoretical analysis, including non-asymptotic error bounds and asymptotic guarantees. In the experiments, we validate our methods through numerical simulations and realworld data experiments, showcasing their practical effectiveness and adaptability.
Guojun Zhu, Sanguo Zhang, Mingyang Ren
AISTATS1
2010 The Networked Environment for Music Analysis (NEMA)
abstract
Conducting valid comparative evaluations of techniques in the field of Music Information Retrieval (MIR)presents particular challenges to MIR researchers due to issues of copyright and data sharing. Further, the interdisciplinary nature of MIR research and multi-faceted nature of human music perception make the sharing and reuse of techniques and implementations for particular facets of music perception and music information retrieval tasks highly desirable. In addition the field makes use of a diverse range of file formats, software environments and toolkits for extracting, encoding and accessing MIR data and services, making reuse extremely challenging. The NEMA project aims to provide the MIR field with a high-quality, secure and extensible workflow environment to facilitate: computation over remote audio and resource collections; optimal code reuse, interoperability between data formats and types, sharing and dissemination; standardised, high-quality evaluation procedures; and the encoding of metadata, data and results in a format suitable for distributed systems.
Kris West, Andrew Shirk, Guojun Zhu, J. Stephen Downie, Andreas F. Ehmann, Mert Bay
SERVICES4