Copertina

Communication-efficient Vertical Federated Learning via Compressed Error Feedback

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Valdeira, Pedro, Xavier, João, Soares, Cláudia, Chi, Yuejie
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
di: Valdeira, Pedro, et al.
Pubblicazione: (2023)

Vertical Federated Learning with Missing Features During Training and Inference
di: Valdeira, Pedro, et al.
Pubblicazione: (2024)

Improving the Bit Complexity of Communication for Distributed Convex Optimization
di: Ghadiri, Mehrdad, et al.
Pubblicazione: (2024)

Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations
di: Haeupler, Bernhard, et al.
Pubblicazione: (2025)

A Primal-Dual Framework for Symmetric Cone Programming
di: Zheng, Jiaqi, et al.
Pubblicazione: (2024)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2023)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
di: Dang'ana, Michael
Pubblicazione: (2026)

Communication-Efficient Federated Optimization over Semi-Decentralized Networks
di: Wang, He, et al.
Pubblicazione: (2023)

Round and Communication Efficient Graph Coloring
di: Chang, Yi-Jun, et al.
Pubblicazione: (2024)

Designing Parallel Algorithms for Community Detection using Arachne
di: Li, Fuhuan, et al.
Pubblicazione: (2025)

Distributed Interactive Proofs for Planarity with Log-Star Communication
di: Gil, Yuval, et al.
Pubblicazione: (2025)

Computing in a Faulty Congested Clique
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2025)

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
di: Fischer, Orr, et al.
Pubblicazione: (2025)

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2025)

Global certification via perfect hashing
di: Bousquet, Nicolas, et al.
Pubblicazione: (2024)

Distributed Santa Claus via Global Rounding
di: de Vos, Tijn, et al.
Pubblicazione: (2026)

Min-Max Correlation Clustering via Neighborhood Similarity
di: Cao, Nairen, et al.
Pubblicazione: (2025)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
di: Bourreau, Yann, et al.
Pubblicazione: (2025)

Faster Distributed $Δ$-Coloring via a Reduction to MIS
di: Bourreau, Yann, et al.
Pubblicazione: (2025)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
di: Wheatman, Brian, et al.
Pubblicazione: (2023)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
di: Khoury, Seri, et al.
Pubblicazione: (2025)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
di: Elkin, Michael, et al.
Pubblicazione: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
di: Chang, Yi-Jun, et al.
Pubblicazione: (2022)

Efficient Dynamic MaxFlow Computation on GPUs
di: Kannappan, Shruthi, et al.
Pubblicazione: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
di: Blin, Lelia, et al.
Pubblicazione: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
di: Jakob, Manuel, et al.
Pubblicazione: (2025)

Perfect Matching with Few Link Activations
di: Mirault, Hugo, et al.
Pubblicazione: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
di: Feist, Dankrad, et al.
Pubblicazione: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
di: Gil, Yuval, et al.
Pubblicazione: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
di: McCoy, Hunter, et al.
Pubblicazione: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
di: Bui, Hong Duc, et al.
Pubblicazione: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
di: Carmel, Amir, et al.
Pubblicazione: (2026)

On Distributed Computation of the Minimum Triangle Edge Transversal
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2024)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
di: Baumecker, Malte, et al.
Pubblicazione: (2025)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
di: Yang, Mingqi
Pubblicazione: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
di: Wang, Letong, et al.
Pubblicazione: (2024)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
di: Dindoost, Mohammad, et al.
Pubblicazione: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
di: Dufoulon, Fabien, et al.
Pubblicazione: (2025)