Imagen de Portada

A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Valdeira, Pedro, Chi, Yuejie, Soares, Cláudia, Xavier, João
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Communication-efficient Vertical Federated Learning via Compressed Error Feedback
por: Valdeira, Pedro, et al.
Publicado: (2024)

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

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

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

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

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

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
por: Mordacchini, Matteo, et al.
Publicado: (2025)

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
por: Flin, Maxime, et al.
Publicado: (2024)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
por: Bai, Sirui, et al.
Publicado: (2024)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
por: Assadi, Sepehr
Publicado: (2023)

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

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

A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation
por: Dutta, Ayan, et al.
Publicado: (2016)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
por: Karmegam, Arivarasan, et al.
Publicado: (2026)

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

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
por: Akker, Erik van den, et al.
Publicado: (2024)

No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
por: Motiwala, Yusuf
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Constrained Cuts, Flows, and Lattice-Linearity
por: Streit, Robert, et al.
Publicado: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
por: Meir, Shachar, et al.
Publicado: (2025)