Cover Image

Centroid Approximation with Multidimensional Approximate Agreement Protocols

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cambus, Melanie, Melnyk, Darya
Format:	Preprint
Published:	2023
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Centroid Approximation for Byzantine-Tolerant Federated Learning
by: Cambus, Mélanie, et al.
Published: (2025)

Approximate Agreement Algorithms for Byzantine Collaborative Learning
by: Cambus, Mélanie, et al.
Published: (2025)

Resilient Byzantine Agreement with Predictions
by: Dallot, Julien, et al.
Published: (2026)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
by: Cambus, Mélanie, et al.
Published: (2022)

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
by: Fuchs, Marc, et al.
Published: (2025)

Asynchronous Approximate Agreement with Quadratic Communication
by: Erbes, Mose Mizrahi, et al.
Published: (2024)

Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles
by: Bandarupalli, Akhil, et al.
Published: (2024)

Optimizing Communication in Byzantine Agreement Protocols with Slim-HBBFT
by: Sony, Nasit S, et al.
Published: (2025)

Adaptive Multidimensional Quadrature on Multi-GPU Systems
by: Tonarelli, Melanie, et al.
Published: (2025)

Prioritized-MVBA: A New Approach to Design an Optimal Asynchronous Byzantine Agreement Protocol
by: Sony, Nasit S, et al.
Published: (2024)

Approximate Byzantine Fault-Tolerance in Distributed Optimization
by: Liu, Shuo, et al.
Published: (2021)

The Complexity of Distributed Minimum Weight Cycle Approximation
by: Chang, Yi-Jun, et al.
Published: (2026)

CheckMate: LLM-Powered Approximate Intermittent Computing
by: Sayyid-Ali, Abdur-Rahman Ibrahim, et al.
Published: (2024)

Byzantine Agreement with Predictions
by: Ben-David, Naama, et al.
Published: (2025)

Recursive Energy Efficient Agreement
by: Meir, Shachar, et al.
Published: (2026)

Communication Efficient Byzantine Agreement with Predictions
by: Dzulfikar, Muhammad Ayaz, et al.
Published: (2026)

Validity in Network-Agnostic Byzantine Agreement
by: Constantinescu, Andrei, et al.
Published: (2024)

Efficient Signature-Free Validated Agreement
by: Civit, Pierre, et al.
Published: (2024)

Reaching Agreement in Competitive Microbial Systems
by: Andaur, Victoria, et al.
Published: (2021)

scaleTRIM: Scalable TRuncation-Based Integer Approximate Multiplier with Linearization and Compensation
by: Farahmand, Ebrahim, et al.
Published: (2023)

Approximated Coded Computing: Towards Fast, Private and Secure Distributed Machine Learning
by: Qiu, Houming, et al.
Published: (2024)

Scaled Block Vecchia Approximation for High-Dimensional Gaussian Process Emulation on GPUs
by: Pan, Qilong, et al.
Published: (2025)

A Poly-Log Approximation for Transaction Scheduling in Fog-Cloud Computing and Beyond
by: Adhikari, Ramesh, et al.
Published: (2025)

Performance Trade-offs of High Order Meshless Approximation on Distributed Memory Systems
by: Vehovar, Jon, et al.
Published: (2025)

BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU
by: V., Karthik, et al.
Published: (2024)

O(K)-Approximation Coflow Scheduling in K-Core Optical Circuit Switching Networks
by: Wang, Xin, et al.
Published: (2026)

Reaching Agreement Among Reasoning LLM Agents
by: Ruan, Chaoyi, et al.
Published: (2025)

General Convex Agreement with Near-Optimal Communication
by: Dufay, Marc, et al.
Published: (2026)

Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers
by: Johnen, Colette, et al.
Published: (2024)

Bounding Distance Between Outputs in Distributed Lattice Agreement
by: Rasheed, Abdullah, et al.
Published: (2025)

Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss
by: Luo, Jingjia, et al.
Published: (2025)

Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)

Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement
by: Civit, Pierre, et al.
Published: (2024)

From Few to Many Faults: Optimal Adaptive Byzantine Agreement
by: Constantinescu, Andrei, et al.
Published: (2025)

A Simple Lower Bound for Set Agreement in Dynamic Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)

Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure
by: Fraigniaud, Pierre, et al.
Published: (2024)

ADELIA: Automatic Differentiation for Efficient Laplace Inference Approximations
by: Boudaoud, Afif, et al.
Published: (2026)

A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1
by: Sony, Nasit S, et al.
Published: (2024)

GRNND: A GPU-Parallel Relative NN-Descent Algorithm for Efficient Approximate Nearest Neighbor Graph Construction
by: Li, Xiang, et al.
Published: (2025)

PathWeaver: A High-Throughput Multi-GPU System for Graph-Based Approximate Nearest Neighbor Search
by: Kim, Sukjin, et al.
Published: (2025)