In this paper, we propose a first-order distributed optimization algorithm that is provably robust to Byzantine failures-arbitrary and potentially adversarial behavior, where all the participating agents are prone failure. We model each agent's state over time as two-state Markov chain indicates or trustworthy behaviors at different instants. set no restrictions on maximum number of any given t...

In this paper, it is shown that the conventional back-propagation (BPP) algorithm for neural network regression is robust to leverages (data with :n corrupted), but not to outliers (data with y corrupted). A robust model is to model the error as a mixture of normal distribution. The influence function for this mixture model is calculated and the condition for the model to be robust to outliers ...

This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of the erroneous data from a single corrupted node to the rest of the system during node repair process. We present a concatenated coding scheme which is based on two types of codes: maximum rank distance (MRD) code as an outer ...

computational errors in numerical data processing may be detected efficiently by using parity values associated with real number codes, even when inherent round off errors are allowed in addition to failure disruptions. this paper examines correcting turbo codes by straightforward application of an algorithm derived for finite-field codes, modified to operate over any field. there are syndromes...

Unstructured p2p database systems are usually characterized by the presence of schema mappings among peers. In these systems, the detection of corrupted mappings is a key problem. A corrupted mapping fails in matching the target or the source schema, hence it is not able to transform data conforming to a schema Si into data conforming to a schema Sj , nor it can be used for effective query refo...

This paper presents the analysis of errors produced by block matching motion estimation methods with lower computational cost (fast search algorithms). We try to find an answer on the question what measure can be used to determine correctness of searched motion vectors and which motion vectors are founded as fault (corrupted by noise). We consider the vector fields obtained by using of full sea...

In this paper we improve existing results in the field of compressed sensing and matrix completion when sampled data may be grossly corrupted. We introduce three new theorems. 1) In compressed sensing, we show that if the m× n sensing matrix has independent Gaussian entries, then one can recover a sparse signal x exactly by tractable l1 minimization even if a positive fraction of the measuremen...

Inherent error-resilient nature of multimedia content renders two high-level options for wireless multimedia application design. One option is to employ (semi-) reliable wireless Medium Access Control (MAC) functions in conjunction with the traditional User Datagram Protocol (UDP). The other option is to employ a less-reliable MAC and transport layer protocol stack that passes corrupted packets...