JZJin Zhong

Jin Zhong

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jin Zhong has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Diffusion-Driven Data Replay: A Novel Approach to Combat Forgetting in Federated Class Continual Learning

    by Jinglin Liang, Jin Zhong, Hanlin Gu, Zhongqi Lu, Xingxing Tang, Gang Dai, Shuangping Huang, Lixin Fan, Qiang Yang


  • Open Access

    Diffusion-Driven Data Replay: A Novel Approach to Combat Forgetting in Federated Class Continual Learning

    by Jinglin Liang, Jin Zhong, Hanlin Gu, Zhongqi Lu, Xingxing Tang, Gang Dai, Shuangping Huang, Lixin Fan, Qiang Yang

    Federated Class Continual Learning (FCCL) merges the challenges of distributed client learning with the need for seamless adaptation to new classes without forgetting old ones. The key challenge in FCCL is catastrophic forgetting, an issue that has been explored to some extent in Continual Learning (CL). However, due to privacy preservation requirements, some conventional methods, such as experience replay, are not directly applicable to FCCL. Existing FCCL methods mitigate forgetting by generating historical data through federated training of GANs or data-free knowledge distillation. However, these approaches often suffer from unstable training of generators or low-quality generated data, limiting their guidance for the model. To address this challenge, we propose a novel method of data replay based on diffusion models. Instead of training a diffusion model, we employ a pre-trained conditional diffusion model to reverse-engineer each class, searching the corresponding input conditions for each class within the model's input space, significantly reducing computational resources and time consumption while ensuring effective generation. Furthermore, we enhance the classifier's domain generalization ability on generated and real data through contrastive learning, indirectly improving the representational capability of generated data for real data. Comprehensive experiments demonstrate that our method significantly outperforms existing baselines. Code is available at https://github.com/jinglin-liang/DDDR.

  • Open Access

    Nash equilibria of two-round auctions

    by Chulong Zhong, Xiang Yan, Yuyi Wang, Shuangping Huang, Jin Zhong

    In a two-round auction, a subset of bidders is selected (probabilistically), according to their bids in the first round, for the second round, where they can increase their bids. We formalize the two-round auction model, restricting the second round to a dominant strategy incentive compatible (DSIC) auction for the selected bidders. It turns out that, however, such two-round auctions are not directly DSIC, even if the probability of each bidder being selected for the second round is monotonic to its first bid, which is surprisingly counter-intuitive. We also illustrate the necessary and sufficient conditions of two-round auctions being DSIC. Besides, we characterize the Nash equilibria for untruthful two-round auctions. One can achieve better revenue performance by setting proper probability for selecting bidders for the second round compared with single-round auctions.