Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneity [PDF]
arXiv, 2023 Byzantine machine learning (ML) aims to ensure the resilience of distributed learning algorithms to misbehaving (or Byzantine) machines. Although this problem received significant attention, prior works often assume the data held by the machines to be homogeneous, which is seldom true in practical settings.
arxiv
The Role of the Greco-Roman Practice as a Progenitor of the Armenian and Eastern Roman Ornamental Art [PDF]
arXiv, 2020 We investigate two-dimensional, periodic ornaments of the Late Hellenistic (some centuries before the Common Era, the Classical Period) and Early Roman (Common Era) classical periods found at different locations in Asia Minor in Turkey and classify them into mathematical wallpaper groups based on their symmetry properties.
arxiv
Asynchronous Byzantine Agreement in Incomplete Networks [Technical Report] [PDF]
arXiv, 2020 The Byzantine agreement problem is considered to be a core problem in distributed systems. For example, Byzantine agreement is needed to build a blockchain, a totally ordered log of records. Blockchains are asynchronous distributed systems, fault-tolerant against Byzantine nodes.
arxiv
Stochastic Alternating Direction Method of Multipliers for Byzantine-Robust Distributed Learning [PDF]
arXiv, 2021 This paper aims to solve a distributed learning problem under Byzantine attacks. In the underlying distributed system, a number of unknown but malicious workers (termed as Byzantine workers) can send arbitrary messages to the master and bias the learning process, due to data corruptions, computation errors or malicious attacks.
arxiv
Simple Gradecast Based Algorithms [PDF]
arXiv, 2010 Gradecast is a simple three-round algorithm presented by Feldman and Micali. The current work presents a very simple algorithm that utilized Gradecast to achieve Byzantine agreement. Two small variations of the presented algorithm lead to improved algorithms for solving the Approximate agreement problem and the Multi-consensus problem.
arxiv
Boosting Byzantine Protocols in Large Sparse Networks with High System Assumption Coverage [PDF]
arXiv, 2022 To improve the overall efficiency and reliability of Byzantine protocols in large sparse networks, we propose a new system assumption for developing multi-scale fault-tolerant systems, with which several kinds of multi-scale Byzantine protocols are developed in large sparse networks with high system assumption coverage.
arxiv
Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity [PDF]
arXiv, 2015 We provide the first protocol that solves Byzantine agreement with optimal early stopping ($\min\{f+2,t+1\}$ rounds) and optimal resilience ($n>3t$) using polynomial message size and computation. All previous approaches obtained sub-optimal results and used resolve rules that looked only at the immediate children in the EIG (\emph{Exponential ...
arxiv
A Robust Classification Framework for Byzantine-Resilient Stochastic Gradient Descent [PDF]
arXiv, 2023 This paper proposes a Robust Gradient Classification Framework (RGCF) for Byzantine fault tolerance in distributed stochastic gradient descent. The framework consists of a pattern recognition filter which we train to be able to classify individual gradients as Byzantine by using their direction alone.
arxiv
Historicising trans pasts: An introduction
Gender &History, Volume 36, Issue 1, Page 3-13, March 2024.
Chris Mowat +2 more
wiley +1 more source
Byzantine-Robust Decentralized Stochastic Optimization over Static and Time-Varying Networks [PDF]
arXiv, 2020 In this paper, we consider the Byzantine-robust stochastic optimization problem defined over decentralized static and time-varying networks, where the agents collaboratively minimize the summation of expectations of stochastic local cost functions, but some of the agents are unreliable due to data corruptions, equipment failures or cyber-attacks.
arxiv