Pith. sign in

REVIEW

Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1803.08114 v2 pith:BJ5KATQD submitted 2018-03-21 math.NA cs.NA

Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions

classification math.NA cs.NA
keywords systemscorruptionslinearmathbfarbitrarilycorruptedlargelarge-scale
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In applications like medical imaging, error correction, and sensor networks, one needs to solve large-scale linear systems that may be corrupted by a small number of arbitrarily large corruptions. We consider solving such large-scale systems of linear equations $A\mathbf{x}=\mathbf{b}$ that are inconsistent due to corruptions in the measurement vector $\mathbf{b}$. With this as our motivating example, we develop an approach for this setting that allows detection of the corrupted entries and thus convergence to the "true" solution of the original system. We provide analytical justification for our approaches as well as experimental evidence on real and synthetic systems.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.