Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization | Paper Citation Record

Observation 3822d646-3a0f-42eb-84b6-32daca8bb002 · outbound

This paper cites Deep learning with differential privacy.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Deep learning with differential privacy

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.239948Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 600cd291-0063-4844-9da8-36b1fd188b10 · outbound

This paper cites Federated learning in edge computing: a systematic survey.Sensors, 22(2):450, 2022.(Cited on page 24).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Federated learning in edge computing: a systematic survey.Sensors, 22(2):450, 2022.(Cited on page 24)

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.244276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 273a8dbd-da51-42e0-a1dc-56abce94b229 · outbound

This paper cites Distributed delayed stochastic optimiza- tion.Advances in neural information processing systems, 24, 2011.(Cited on page 350).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Distributed delayed stochastic optimiza- tion.Advances in neural information processing systems, 24, 2011.(Cited on page 350)

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.247870Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c037580d-f24e-4570-9790-0529512d6d44 · outbound

This paper cites Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.251062Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce1f0373-7106-4b05-a835-fd2e8aded92d · outbound

This paper cites an unresolved cited work.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.255038Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 083da089-c0d7-4c23-aade-eb09445b5529 · outbound

This paper cites On the Convergence of SGD with Biased Gradients.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization On the Convergence of SGD with Biased Gradients

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.258448Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 373f3b4e-67df-40f0-b582-71335b705a37 · outbound

This paper cites QSGD: Communication-efficient SGD via gradient quantization and encoding.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization QSGD: Communication-efficient SGD via gradient quantization and encoding

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.262286Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aecb71cf-1f76-4a56-8dd4-ed5a8d4b214a · outbound

This paper cites Byzantine stochastic gradi- ent descent.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Byzantine stochastic gradi- ent descent

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.265782Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d5ba978-feaa-4f67-909f-804e58013d64 · outbound

This paper cites The convergence of sparsified gradient methods.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization The convergence of sparsified gradient methods

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.268733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 301963da-b610-40e3-b1f0-bb884db3d823 · outbound

This paper cites Byzantine-resilient non-convex stochastic gradient descent.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Byzantine-resilient non-convex stochastic gradient descent

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.271324Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59c7da2c-b3c0-4aee-a554-e677efd1fa34 · outbound

This paper cites Fixing by mixing: A recipe for optimal byzantine ml under heterogeneity.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Fixing by mixing: A recipe for optimal byzantine ml under heterogeneity

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.273868Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f31d589e-462b-494e-935f-b28a49059d6f · outbound

This paper cites Byzantine-Robust Federated Learning: Impact of Client Subsampling and Local Updates.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Byzantine-Robust Federated Learning: Impact of Client Subsampling and Local Updates

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.276427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29787a14-b3c9-4a28-8e99-d22cd4814ae6 · outbound

This paper cites an unresolved cited work.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.279479Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b68e4f2-6608-49ce-9237-5136c45f2cda · outbound

This paper cites Federated learning for healthcare: Systematic review and architecture proposal.ACM Transactions on Intel- ligent Systems and Technology (TIST), 13(4):1–23, 2022.(Cited on page 104).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Federated learning for healthcare: Systematic review and architecture proposal.ACM Transactions on Intel- ligent Systems and Technology (TIST), 13(4):1–23, 2022.(Cited on page 104)

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.282022Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f6142c0f-3921-4caa-ac43-5caaf7bd4c2e · outbound

This paper cites Communication complexity of distributed convex learning and optimization.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Communication complexity of distributed convex learning and optimization

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.284694Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba4ce198-d626-45f5-9f00-7ba3180ebecb · outbound

This paper cites Lower bounds for non-convex stochastic optimiza- tion.Mathematical Programming, 199(1-2):165–214, 2023.(Cited on pages 123 and 125).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Lower bounds for non-convex stochastic optimiza- tion.Mathematical Programming, 199(1-2):165–214, 2023.(Cited on pages 123 and 125)

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.288012Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f5de97c-06ab-4259-b31e-0784aa000f6d · outbound

This paper cites Distributed Deep Learning Using Volunteer Computing-Like Paradigm.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Distributed Deep Learning Using Volunteer Computing-Like Paradigm

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.291333Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a5dfccd-b09a-4827-a168-34c457a765a7 · outbound

This paper cites A little is enough: Cir- cumventing defenses for distributed learning.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization A little is enough: Cir- cumventing defenses for distributed learning

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.294822Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e06ae32-c56e-46f3-bb57-4729b0bcdf14 · outbound

This paper cites Qsparse- local-SGD: Distributed SGD with quantization, sparsification and local computations.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Qsparse- local-SGD: Distributed SGD with quantization, sparsification and local computations

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.297750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a6c75a6d-950e-40b4-a300-481cb8f2c167 · outbound

This paper cites Generalized mono- tone operators and their averaged resolvents.Mathematical Programming, 189(1):55–74, 2021.(Cited on page 49).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Generalized mono- tone operators and their averaged resolvents.Mathematical Programming, 189(1):55–74, 2021.(Cited on page 49)

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.300706Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b852965a-fc8f-4d71-9147-18ad2490ff35 · outbound

This paper cites MOS-SIAM Series on Optimization, 2017.(Cited on pages 43 and 63).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization MOS-SIAM Series on Optimization, 2017.(Cited on pages 43 and 63)

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.303826Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b165bf5a-a6db-4fe1-9f22-1c7edd7a663d · outbound

This paper cites Demystifying parallel and distributed deep learning: An in-depth concurrency analysis.ACM Computing Surveys (CSUR), 52(4):1–43, 2019.(Cited on page 23).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Demystifying parallel and distributed deep learning: An in-depth concurrency analysis.ACM Computing Surveys (CSUR), 52(4):1–43, 2019.(Cited on page 23)

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.306845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de813356-f3cb-4d2a-b44a-f10c77aeaacd · outbound

This paper cites Practical recommendations for gradient-based training of deep architectures.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Practical recommendations for gradient-based training of deep architectures

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.309975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0230b716-1afc-4184-80bb-fa3e79711ee2 · outbound

This paper cites signSGD with Majority Vote is Communication Efficient And Fault Tolerant.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization signSGD with Majority Vote is Communication Efficient And Fault Tolerant

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.313033Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a5b19f17-f587-4c0a-b44c-66b1decba71e · outbound

This paper cites Incremental proximal methods for large scale convex optimization.Mathematical Programming, 129(2):163–195, 2011.(Cited on page 423).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Incremental proximal methods for large scale convex optimization.Mathematical Programming, 129(2):163–195, 2011.(Cited on page 423)

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.317457Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f66fa8c-92c2-41e0-9495-383763095f74 · outbound

This paper cites On biased compression for distributed learning.Journal of Machine Learning Research, 24(276):1–50, 2023.(Cited on pages 114, 121, 269, and 350).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization On biased compression for distributed learning.Journal of Machine Learning Research, 24(276):1–50, 2023.(Cited on pages 114, 121, 269, and 350)

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.320477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3062fa6c-744f-4f90-bb04-56cdb9857e29 · outbound

This paper cites LoRA Learns Less and Forgets Less.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization LoRA Learns Less and Forgets Less

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.323602Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4ad7a4b-43f2-4639-8271-e0aaaa85dd90 · outbound

This paper cites Machine learning with adversaries: Byzantine tolerant gradient descent.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Machine learning with adversaries: Byzantine tolerant gradient descent

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.327099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9585973-869d-45a4-ba77-0788aebf6169 · outbound

This paper cites Brendan McMahan, Sarvar Patel, Daniel Ramage, Aaron Segal, and Karn Seth.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Brendan McMahan, Sarvar Patel, Daniel Ramage, Aaron Segal, and Karn Seth

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.330265Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 957d9540-c62c-44bf-bdd1-a95b219de095 · outbound

This paper cites Towards federated learning at scale: System design.Proceedings of machine learning and systems, 1:374–388, 2019.(Cited on page 24).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Towards federated learning at scale: System design.Proceedings of machine learning and systems, 1:374–388, 2019.(Cited on page 24)

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.333254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e30da65c-2b94-42e6-bb85-7a67ccc691ee · outbound

This paper cites Curiously fast convergence of some stochastic gradient descent algorithms.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Curiously fast convergence of some stochastic gradient descent algorithms

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.336427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd92d279-3d4b-4eb3-b21a-97ffd506b1c4 · outbound

This paper cites Democratizing machine learning: Resilient distributed learning with heterogeneous participants.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Democratizing machine learning: Resilient distributed learning with heterogeneous participants

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.339648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a60a09f8-7400-43b9-bc1d-66facd631b4b · outbound

This paper cites Minibatch stochastic three points method for unconstrained smooth minimization.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Minibatch stochastic three points method for unconstrained smooth minimization

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.343167Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98845fd0-8120-4089-adf0-e318fa4a6c53 · outbound

This paper cites Flpytorch: optimization research simulator for federated learning.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Flpytorch: optimization research simulator for federated learning

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.345640Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0600f874-9cad-4c69-92ae-0d1881f37a5a · outbound

This paper cites Tighter lower bounds for shuffling SGD: Random permutations and beyond.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Tighter lower bounds for shuffling SGD: Random permutations and beyond

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.348090Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e351160-cffb-4db7-9861-b02bd68a115d · outbound

This paper cites A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of Mathematical Imaging and Vision, 40(1):120–145, 2011.(Cited on page 78).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of Mathematical Imaging and Vision, 40(1):120–145, 2011.(Cited on page 78)

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.350708Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af79b4c7-4815-4ca3-b09c-ceedc52d1cb4 · outbound

This paper cites LIBSVM: A library for support 151 vector machines.ACM transactions on intelligent systems and technology (TIST), 2(3):1–27, 2011.(Cited on pages 57, 71, 87, 102, 129, and 269).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization LIBSVM: A library for support 151 vector machines.ACM transactions on intelligent systems and technology (TIST), 2(3):1–27, 2011.(Cited on pages 57, 71, 87, 102, 129, and 269)

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.353739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63122e3e-f66f-4d91-b03e-1042ccb195b2 · outbound

This paper cites On the Outsized Importance of Learning Rates in Local Update Methods.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization On the Outsized Importance of Learning Rates in Local Update Methods

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.356201Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 072b9a17-ffaf-4c27-a479-6a3ba9ea0f6a · outbound

This paper cites On Large-Cohort Training for Federated Learning.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization On Large-Cohort Training for Federated Learning

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.358958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e6bc20e-b4c4-44db-842a-0bde68b49562 · outbound

This paper cites Draco: Byzantine-resilient distributed training via redundant gradi- ents.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Draco: Byzantine-resilient distributed training via redundant gradi- ents

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.362756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30a75e98-f211-456d-9b9e-64a8eb716522 · outbound

This paper cites A primal–dual fixed point algorithm for convex separable minimization with applications to im- age restoration.Inverse Problems, 29(2):025011, 2013.(Cited on page 186).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization A primal–dual fixed point algorithm for convex separable minimization with applications to im- age restoration.Inverse Problems, 29(2):025011, 2013.(Cited on page 186)

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.365724Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37c625f0-09de-431d-9476-77e7106427f5 · outbound

This paper cites Optimal client sampling for federated learning.Privacy Preserving Machine Learning (NeurIPS 2020 Workshop), 2020a.(Cited on pages 27, 30, 60, 75, and 90).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Optimal client sampling for federated learning.Privacy Preserving Machine Learning (NeurIPS 2020 Workshop), 2020a.(Cited on pages 27, 30, 60, 75, and 90)

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.368718Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9977c3c-9fb0-441d-97d2-3479dc7fcbf1 · outbound

This paper cites Understanding gradient clipping in private SGD: A geometric perspective.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Understanding gradient clipping in private SGD: A geometric perspective

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.371598Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2681aab6-511b-439d-a6e5-2354dd99b915 · outbound

This paper cites an unresolved cited work.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Unresolved cited work

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.374737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ecbaf52-b436-45a3-88a4-b2f6926b5d19 · outbound

This paper cites Client Selection in Federated Learning: Convergence Analysis and Power-of-Choice Selection Strategies.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Client Selection in Federated Learning: Convergence Analysis and Power-of-Choice Selection Strategies

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.378853Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2895380d-d36c-43d6-b151-26b1873483a6 · outbound

This paper cites On the convergence of federated averaging with cyclic client participation.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization On the convergence of federated averaging with cyclic client participation

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.382252Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ec6e413-538c-40d6-8e82-12141ebaaff4 · outbound

This paper cites Emerging trends: A gentle introduction to fine-tuning.Natural Language Engineering, 27(6): 763–778, 2021.(Cited on page 131).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Emerging trends: A gentle introduction to fine-tuning.Natural Language Engineering, 27(6): 763–778, 2021.(Cited on page 131)

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.385306Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac78e289-b439-4779-aa56-19590cd47797 · outbound

This paper cites Proximal splitting methods in signal processing.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Proximal splitting methods in signal processing

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.388427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0fb944f-5fa1-44ae-9486-16bd55422fe8 · outbound

This paper cites Combettes, Laurent Condat, Jean-Christophe Pesquet, and B˘ ang C.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Combettes, Laurent Condat, Jean-Christophe Pesquet, and B˘ ang C

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.391372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6e99eb70-a8bf-4b0a-8c2d-1a7f4a1bcb57 · outbound

This paper cites MURANA: A Generic Framework for Stochastic Variance-Reduced Optimization.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization MURANA: A Generic Framework for Stochastic Variance-Reduced Optimization

Reference 50

Resolution: verified exact; local_arxiv, observed 2026-08-15T14:39:16.722949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 8e8c59c8-18b3-4542-8759-5828255fd41f · outbound

This paper cites RandProx: Primal-Dual Optimization Algorithms with Randomized Proximal Updates.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization RandProx: Primal-Dual Optimization Algorithms with Randomized Proximal Updates

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.397597Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20e41091-570e-4177-b2f7-384b14a15fea · outbound

This paper cites Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists

Reference 52

Resolution: verified exact; local_arxiv, observed 2026-08-15T14:39:16.700545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation ec2b8597-2075-47c3-a425-2b96969b4706 · outbound

This paper cites Distributed proximal splitting algorithms with rates and acceleration.Frontiers in Sig- nal Processing, page 12, 2022.(Cited on page 186).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Distributed proximal splitting algorithms with rates and acceleration.Frontiers in Sig- nal Processing, page 12, 2022.(Cited on page 186)

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.403779Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d263ad1-c0ef-4183-aca2-2959d032467d · outbound

This paper cites TAMUNA: Doubly Accelerated Distributed Optimization under Partial Participation.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization TAMUNA: Doubly Accelerated Distributed Optimization under Partial Participation

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.406150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3bf18e55-5419-46ef-8ce3-0c236088da1d · outbound

This paper cites Importance sampling for minibatches.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Importance sampling for minibatches

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.409008Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7099af46-8835-4d4c-9019-3304609c4b70 · outbound

This paper cites Momentum-based variance re- duction in non-convex SGD.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Momentum-based variance re- duction in non-convex SGD

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.412140Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd868ca3-fa3f-4930-9a79-88d61e34c5f8 · outbound

This paper cites Asynchronous byzantine machine learning (the case of sgd).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Asynchronous byzantine machine learning (the case of sgd)

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.415902Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57402cd9-959f-4e8b-892d-4bff3054207f · outbound

This paper cites Aggregathor: Byzantine machine learn- ing via robust gradient aggregation.Proceedings of Machine Learning and Systems, 1:81–106, 2019.(Cited on page 118).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Aggregathor: Byzantine machine learn- ing via robust gradient aggregation.Proceedings of Machine Learning and Systems, 1:81–106, 2019.(Cited on page 118)

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.419207Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 329717b0-9cbb-433d-a0f1-4589a9a892d5 · outbound

This paper cites Re- cent theoretical advances in non-convex optimization.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Re- cent theoretical advances in non-convex optimization

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.423242Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 803df5b7-9039-456f-853f-4d31c653f279 · outbound

This paper cites Byzantine-resilient high-dimensional SGD with local iterations on heterogeneous data.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Byzantine-resilient high-dimensional SGD with local iterations on heterogeneous data

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.426304Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 102ae155-77d6-43fc-a40f-522a77bf53a4 · outbound

This paper cites A three-operator splitting scheme and its optimization applications.Set-Val.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization A three-operator splitting scheme and its optimization applications.Set-Val

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.429487Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b93ec3c9-dbcf-4e32-8523-790d594ac15f · outbound

This paper cites Large scale distributed deep networks.Advances in neural information processing systems, 25, 2012.(Cited on page 23).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Large scale distributed deep networks.Advances in neural information processing systems, 25, 2012.(Cited on page 23)

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.432520Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 413550d4-17cc-483f-8013-2dbb524a043f · outbound

This paper cites A simple practical accelerated method for finite sums.29th Conference on Neural Information Processing Systems (NeurIPS), 2016.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization A simple practical accelerated method for finite sums.29th Conference on Neural Information Processing Systems (NeurIPS), 2016

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.435614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2917509a-abef-4645-a5df-2bce3add0361 · outbound

This paper cites On the ineffectiveness of variance reduced optimization for deep learning.Advances in Neural Information Processing Systems, 32, 2019.(Cited on page 129).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization On the ineffectiveness of variance reduced optimization for deep learning.Advances in Neural Information Processing Systems, 32, 2019.(Cited on page 129)

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.438473Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3d76e7f-4cca-4c8d-91a4-b90f38acbfce · outbound

This paper cites SAGA: A fast incremental gradient method with support for non-strongly convex com- posite objectives.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization SAGA: A fast incremental gradient method with support for non-strongly convex com- posite objectives

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.441391Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d10e0071-7c9c-4dfd-8171-356b2a73873c · outbound

This paper cites Optimal dis- tributed online prediction using mini-batches.Journal of Machine Learning Research, 13(1):165–202, January 2012.(Cited on pages 30 and 53).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Optimal dis- tributed online prediction using mini-batches.Journal of Machine Learning Research, 13(1):165–202, January 2012.(Cited on pages 30 and 53)

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.444400Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c362c72-a511-4beb-9e96-b96c0a3d9663 · outbound

This paper cites Mast: Model-agnostic sparsified training.arXiv preprint arXiv:2311.16086, 2023a.(Cited on page 39).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Mast: Model-agnostic sparsified training.arXiv preprint arXiv:2311.16086, 2023a.(Cited on page 39)

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.447341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 701a9742-b520-49ef-bed8-3fb7dbafbe82 · outbound

This paper cites A guide through the Zoo of biased SGD.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization A guide through the Zoo of biased SGD

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.451515Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a8dc9673-dca5-4fa6-9fa7-52710fde2d31 · outbound

This paper cites Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction

Reference 69

Resolution: verified exact; local_arxiv, observed 2026-08-15T14:39:16.601338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 3a9c108e-17e0-4d89-ae90-aadf73cd8384 · outbound

This paper cites Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization

Reference 70

Resolution: verified exact; local_arxiv, observed 2026-08-15T14:39:16.588570Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e7692ab1-8f9e-4c32-a8b3-95141eb679c7 · outbound

This paper cites Distributed deep learning in open collaborations.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Distributed deep learning in open collaborations

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.461988Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90513fe8-1277-41db-864d-8bd872bb7169 · outbound

This paper cites A simple algorithm for a class of nonsmooth convex–concave saddle-point problems.Operations Research Letters, 43(2):209–214, 2015.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization A simple algorithm for a class of nonsmooth convex–concave saddle-point problems.Operations Research Letters, 43(2):209–214, 2015

Reference 72

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.464980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e2942f1-3b96-4683-81fc-969d60ec853d · outbound

This paper cites The algorithmic foundations of differential privacy.Foundations and trends®in theoretical computer science, 9(3-4): 211–487, 2014.(Cited on pages 23, 26, and 28).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization The algorithmic foundations of differential privacy.Foundations and trends®in theoretical computer science, 9(3-4): 211–487, 2014.(Cited on pages 23, 26, and 28)

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.467374Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 462db7c5-f08d-4a75-8279-31b0a9fa18ee · outbound

This paper cites Cali- brating noise to sensitivity in private data analysis.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Cali- brating noise to sensitivity in private data analysis

Reference 74

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.469835Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 845998f0-7c53-43fd-8211-0740d797255f · outbound

This paper cites Eichner, T.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Eichner, T

Reference 75

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.472283Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ede8a3ce-054f-4b48-8df5-e4070b01e7d0 · outbound

This paper cites an unresolved cited work.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Unresolved cited work

Reference 76

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.474648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a5277e9b-2d54-4ca2-b023-afec68448b38 · outbound

This paper cites Spider: Near- optimal non-convex optimization via stochastic path-integrated differential estimator.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Spider: Near- optimal non-convex optimization via stochastic path-integrated differential estimator

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.477164Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dfe02a52-ed10-4548-a311-cb65346e1921 · outbound

This paper cites AFLGuard: Byzantine-robust asynchronous federated learning.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization AFLGuard: Byzantine-robust asynchronous federated learning

Reference 78

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.479558Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38bcc988-12ed-4bf9-948a-ccde50506231 · outbound

This paper cites EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedback.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedback

Reference 79

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.481867Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b44f6ca-300b-47e4-b505-cd88d09797dd · outbound

This paper cites Efficient evaluation of scaled proxi- mal operators.Electronic Transactions on Numerical Analysis, 46:1–23, 03 2016.(Cited on page 44).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Efficient evaluation of scaled proxi- mal operators.Electronic Transactions on Numerical Analysis, 46:1–23, 03 2016.(Cited on page 44)

Reference 80

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.485070Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76beb639-582a-4c1c-acde-11e3152683ec · outbound

This paper cites Stochastic first-and zeroth-order meth- ods for nonconvex stochastic programming.SIAM journal on optimization, 23(4):2341–2368, 2013.(Cited on page 406).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Stochastic first-and zeroth-order meth- ods for nonconvex stochastic programming.SIAM journal on optimization, 23(4):2341–2368, 2013.(Cited on page 406)

Reference 81

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.488048Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f48c4445-310c-47e6-b104-f1c98fbbb567 · outbound

This paper cites Distributed new- ton can communicate less and resist Byzantine workers.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Distributed new- ton can communicate less and resist Byzantine workers

Reference 82

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.491232Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9850626d-ae01-4164-9414-dc731dab4b76 · outbound

This paper cites Communication-efficient and byzantine-robust dis- tributed learning with error feedback.IEEE Journal on Selected Areas in Information Theory, 2(3):942–953, 2021.(Cited on page 350).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Communication-efficient and byzantine-robust dis- tributed learning with error feedback.IEEE Journal on Selected Areas in Information Theory, 2(3):942–953, 2021.(Cited on page 350)

Reference 83

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.494311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98b6c306-b56b-4b6f-8632-905cca1ad46b · outbound

This paper cites Sharp bounds for federated averaging (local sgd) and continuous perspective.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Sharp bounds for federated averaging (local sgd) and continuous perspective

Reference 84

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.497443Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e13a42c0-db6a-4167-afac-bcc88db021a9 · outbound

This paper cites Television by pulse code modulation.Bell System Technical Journal, 30(1):33–49, 1951.(Cited on page 121).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Television by pulse code modulation.Bell System Technical Journal, 30(1):33–49, 1951.(Cited on page 121)

Reference 85

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.500729Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d83c83e1-e647-42a4-8fad-44b4b43bfc5a · outbound

This paper cites Stochas- tic optimization with heavy-tailed noise via accelerated gradient clipping.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Stochas- tic optimization with heavy-tailed noise via accelerated gradient clipping

Reference 86

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.503899Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a6ff18b-a2a0-4584-87ba-91c5066a0cd2 · outbound

This paper cites A unified theory of SGD: Variance reduction, sampling, quantization and coordinate descent.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization A unified theory of SGD: Variance reduction, sampling, quantization and coordinate descent

Reference 87

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.506982Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 552b9fc9-f733-4477-9dba-302ba0fdce4d · outbound

This paper cites Linearly converging error compensated SGD.Advances in Neural Information Processing Systems, 33:20889–20900, 2020c.(Cited on page 65).

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Linearly converging error compensated SGD.Advances in Neural Information Processing Systems, 33:20889–20900, 2020c.(Cited on page 65)

Reference 88

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.510993Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45e6f806-b857-4c1c-b2c3-6c28e610468c · outbound

This paper cites an unresolved cited work.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Unresolved cited work

Reference 89

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.513850Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1db21339-1087-43f7-ad6a-14e94aa48771 · outbound

This paper cites Local SGD: Unified theory and new efficient methods.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Local SGD: Unified theory and new efficient methods

Reference 90

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.516753Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 72a5e46f-f765-41f0-9190-1c0d248f167d · outbound

This paper cites Secure Distributed Training at Scale.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Secure Distributed Training at Scale

Reference 91

Resolution: verified exact; local_arxiv, observed 2026-08-15T14:39:16.567536Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 34e8dd34-6a15-4277-ad3b-3b8f1ee9fbc0 · outbound

This paper cites an unresolved cited work.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Unresolved cited work

Reference 92

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.522884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba027ad6-bed5-4692-bd64-cdc06fbde200 · outbound

This paper cites Variance-reduced methods for machine learning.Proceedings of the IEEE, 108(11):1968–1983, 2020.(Cited on pages 30 and 349) 157.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Variance-reduced methods for machine learning.Proceedings of the IEEE, 108(11):1968–1983, 2020.(Cited on pages 30 and 349) 157

Reference 93

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.526550Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2efb3cc9-195a-4544-b9ab-80350fb40e51 · outbound

This paper cites Gower, Peter Richt´ arik, and Francis Bach.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Gower, Peter Richt´ arik, and Francis Bach

Reference 94

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.529674Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ea93c2e-9c6c-47f8-a3b7-50a62de60dcd · outbound

This paper cites SGD: General analysis and improved rates.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization SGD: General analysis and improved rates

Reference 95

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.532630Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b83028b8-c34b-4cc2-aa5a-3b6205863c78 · outbound

This paper cites Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour

Reference 96

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.535736Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2dd4ae5e-ef6d-4159-9789-60faa3b44952 · outbound

This paper cites Can 5th gen- eration local training methods support client sampling? yes! InInterna- tional Conference on Artificial Intelligence and Statistics, pages 1055–1092.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Can 5th gen- eration local training methods support client sampling? yes! InInterna- tional Conference on Artificial Intelligence and Statistics, pages 1055–1092

Reference 97

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.539390Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a3bcec7-2b3e-4a9e-974a-551b5cd79bf5 · outbound

This paper cites Improving Accelerated Federated Learning with Compression and Importance Sampling.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Improving Accelerated Federated Learning with Compression and Importance Sampling

Reference 98

Resolution: verified exact; local_arxiv, observed 2026-08-15T14:39:16.546131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e9b6cf79-beae-411a-8ff3-45d286249730 · outbound

This paper cites On the Convergence of Local Descent Methods in Federated Learning.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization On the Convergence of Local Descent Methods in Federated Learning

Reference 99

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.545132Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a83a56e-40df-481a-9afb-2a9787a72a16 · outbound

This paper cites Federated learning with compression: Unified analysis and sharp guarantees.

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization Federated learning with compression: Unified analysis and sharp guarantees

Reference 100

Resolution: unresolved; no resolver link, observed 2026-08-15T14:39:14.547983Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers