Zhuqing Liu

Orcid: 0000-0003-0146-5101

According to our database1, Zhuqing Liu authored at least 29 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Enhancing Privacy in Decentralized Min-Max Optimization: A Differentially Private Approach.
CoRR, August, 2025

Benchmarking Poisoning Attacks against Retrieval-Augmented Generation.
CoRR, May, 2025

Toward Malicious Clients Detection in Federated Learning.
CoRR, May, 2025

Practical Poisoning Attacks against Retrieval-Augmented Generation.
CoRR, April, 2025

Optimal pricing in fuzzy social networks with reference price effect.
Inf. Sci., 2025

Traceback of Poisoning Attacks to Retrieval-Augmented Generation.
Proceedings of the ACM on Web Conference 2025, 2025

Poisoning Attacks and Defenses to Federated Unlearning.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2025, 2025

Byzantine-Robust Federated Learning over Ring-All-Reduce Distributed Computing.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2025, 2025

STIMULUS: Achieving Fast Convergence and Low Sample Complexity in Stochastic Multi-Objective Learning.
Proceedings of the Conference on Uncertainty in Artificial Intelligence, 2025

Do We Really Need to Design New Byzantine-robust Aggregation Rules?
Proceedings of the 32nd Annual Network and Distributed System Security Symposium, 2025

DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024
Study on the suitable high-frequency PIV sample for centrifugal pump visualization based on impeller speed.
J. Vis., April, 2024

Optimisation of digital media technology for film and television animation post-production considering motion capture technology.
Int. J. Inf. Commun. Technol., 2024

Adversarial Attacks to Multi-Modal Models.
Proceedings of the 1st ACM Workshop on Large AI Systems and Models with Privacy and Safety Analysis, 2024

PILOT: An $\mathcal{O}(1/K)$-Convergent Approach for Policy Evaluation with Nonlinear Function Approximation.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Federated Multi-Objective Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities.
Proceedings of the Twenty-fourth International Symposium on Theory, 2023

DIAMOND: Taming Sample and Communication Complexities in Decentralized Bilevel Optimization.
Proceedings of the IEEE INFOCOM 2023, 2023

Prometheus: Taming Sample and Communication Complexities in Constrained Decentralized Stochastic Bilevel Learning.
Proceedings of the International Conference on Machine Learning, 2023

2022
SAGDA: Achieving O(ε<sup>-2</sup>) Communication Complexity in Federated Min-Max Learning.
CoRR, 2022

FD-GATDR: A Federated-Decentralized-Learning Graph Attention Network for Doctor Recommendation Using EHR.
CoRR, 2022

SAGDA: Achieving $\mathcal{O}(\epsilon^{-2})$ Communication Complexity in Federated Min-Max Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

NET-FLEET: achieving linear convergence speedup for fully decentralized federated learning with heterogeneous data.
Proceedings of the MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, Seoul, Republic of Korea, October 17, 2022

SYNTHESIS: a semi-asynchronous path-integrated stochastic gradient method for distributed learning in computing clusters.
Proceedings of the MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, Seoul, Republic of Korea, October 17, 2022

INTERACT: achieving low sample and communication complexities in decentralized bilevel learning over networks.
Proceedings of the MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, Seoul, Republic of Korea, October 17, 2022

2021
Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2019
Review on the sensitization of turbulence models to rotation/curvature and the application to rotating machinery.
Appl. Math. Comput., 2019

2017
Energy-Aware Material Selection for Product With Multicomponent Under Cloud Environment.
J. Comput. Inf. Sci. Eng., 2017

2016
Pendulum-like oscillation controller for UAV based on Lévy-flight pigeon-inspired optimization and LQR.
Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016


  Loading...