Decentralized personalized federated learning: lower bounds and optimal algorithm for all personalization modes (Q6170035): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Eigenvalues of the Laplacian of a graph<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Decentralized Finite-Sum Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances and Open Problems in Federated Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decentralized Accelerated Gradient Methods With Increasing Penalty Parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Subgradient Methods for Multi-Agent Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algorithms for Non-Smooth Distributed Optimization in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Machine Learning / rank
 
Normal rank

Revision as of 16:45, 1 August 2024

scientific article; zbMATH DE number 7711260
Language Label Description Also known as
English
Decentralized personalized federated learning: lower bounds and optimal algorithm for all personalization modes
scientific article; zbMATH DE number 7711260

    Statements

    Decentralized personalized federated learning: lower bounds and optimal algorithm for all personalization modes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 July 2023
    0 references
    federated learning
    0 references
    decentralized optimization
    0 references
    distributed optimization
    0 references
    lower and upper bounds
    0 references
    accelerated algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references