Pith. sign in

REVIEW 1 cited by

On the Adversarial Robustness of Multivariate Robust Estimation

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 1903.11220 v1 pith:QSS67LGB submitted 2019-03-27 stat.ML cs.ITcs.LGmath.ITmath.STstat.TH

classification stat.MLcs.ITcs.LGmath.ITmath.STstat.TH
keywords adversarialrobustnessadversaryestimatoroptimalcharacterizeestimationinference
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

In this paper, we investigate the adversarial robustness of multivariate $M$-Estimators. In the considered model, after observing the whole dataset, an adversary can modify all data points with the goal of maximizing inference errors. We use adversarial influence function (AIF) to measure the asymptotic rate at which the adversary can change the inference result. We first characterize the adversary's optimal modification strategy and its corresponding AIF. From the defender's perspective, we would like to design an estimator that has a small AIF. For the case of joint location and scale estimation problem, we characterize the optimal $M$-estimator that has the smallest AIF. We further identify a tradeoff between robustness against adversarial modifications and robustness against outliers, and derive the optimal $M$-estimator that achieves the best tradeoff.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On the Adversarial Robustness of Subspace Learning

    eess.SP 2019-08 conditional novelty 7.0 of 10

    The paper gives closed-form optimal data-poisoning attacks on PCA, showing the worst-case subspace rotation depends only on the k-th and (k+1)-th singular values and the attacker's energy budget.

Pith tools