MLLGSep 2, 2023

Non-Asymptotic Bounds for Adversarial Excess Risk under Misspecified Models

arXiv:2309.00771v12 citations
Originality Incremental advance
AI Analysis

This work addresses the theoretical understanding of adversarial robustness for researchers in machine learning, but it appears incremental as it builds on existing frameworks for risk analysis.

The paper tackles the problem of evaluating robust estimators under adversarial losses in misspecified models, establishing non-asymptotic upper bounds for adversarial excess risk, with improved bounds for quadratic loss in nonparametric regression.

We propose a general approach to evaluating the performance of robust estimators based on adversarial losses under misspecified models. We first show that adversarial risk is equivalent to the risk induced by a distributional adversarial attack under certain smoothness conditions. This ensures that the adversarial training procedure is well-defined. To evaluate the generalization performance of the adversarial estimator, we study the adversarial excess risk. Our proposed analysis method includes investigations on both generalization error and approximation error. We then establish non-asymptotic upper bounds for the adversarial excess risk associated with Lipschitz loss functions. In addition, we apply our general results to adversarial training for classification and regression problems. For the quadratic loss in nonparametric regression, we show that the adversarial excess risk bound can be improved over those for a general loss.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes