The reviewed record of science sign in
Pith

arxiv: 2408.08628 · v1 · pith:SIZHCIGH · submitted 2024-08-16 · cs.LG · math.OC

A survey on secure decentralized optimization and learning

Reviewed by Pithpith:SIZHCIGHopen to challenge →

classification cs.LG math.OC
keywords optimizationdecentralizedlearningalgorithmssurveyadvancementsaggregationconsensus
0
0 comments X
read the original abstract

Decentralized optimization has become a standard paradigm for solving large-scale decision-making problems and training large machine learning models without centralizing data. However, this paradigm introduces new privacy and security risks, with malicious agents potentially able to infer private data or impair the model accuracy. Over the past decade, significant advancements have been made in developing secure decentralized optimization and learning frameworks and algorithms. This survey provides a comprehensive tutorial on these advancements. We begin with the fundamentals of decentralized optimization and learning, highlighting centralized aggregation and distributed consensus as key modules exposed to security risks in federated and distributed optimization, respectively. Next, we focus on privacy-preserving algorithms, detailing three cryptographic tools and their integration into decentralized optimization and learning systems. Additionally, we examine resilient algorithms, exploring the design and analysis of resilient aggregation and consensus protocols that support these systems. We conclude the survey by discussing current trends and potential future directions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Dangerous Liaisons of Convex Learning and Non-Affine Aggregation

    cs.LG 2026-06 unverdicted novelty 8.0

    Monotonicity of aggregated gradients holds if and only if the aggregation rule is positively affine; non-affine rules therefore prevent steady convergence and degrade stability.

  2. Byzantine-Resilient Consensus via Active Reputation Learning

    math.OC 2026-05 unverdicted novelty 6.0

    An active reputation learning mechanism integrated into consensus protocols enables simultaneous Byzantine agent identification and resilient agreement among normal agents in distributed systems.

  3. Communication-Efficient Distributed Learning with Differential Privacy

    cs.LG 2026-04 unverdicted novelty 6.0

    A local-training algorithm for nonconvex distributed optimization achieves communication efficiency and differential privacy via gradient clipping plus additive noise, with proven convergence to a stationary point wit...