REVIEW 2 cited by
A survey on secure decentralized optimization and learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 2 Pith papers
-
Decentralized Optimization with Amplified Privacy via Efficient Communication
Random activation and Top-k sparsification are claimed to amplify differential privacy in decentralized non-convex optimization, reducing required noise by a factor of the sparsification ratio times the square of the ...
-
On Convergence Analysis of Network-GIANT: An approximate Hessian-based fully distributed optimization algorithm
Network-GIANT converges linearly with rate equal to the spectral radius of an explicit 3×3 matrix, and, under a Hessian-approximation assumption, achieves an approximate local rate of 1−η.
Discussion (0). Continue with ORCID to comment.