MLLGSTJan 22

On damage of interpolation to adversarial robustness in regression

arXiv:2601.16070v11 citationsh-index: 2
Originality Incremental advance
AI Analysis

This addresses the vulnerability of interpolating deep neural networks to adversarial perturbations, revealing a fundamental limitation in their robustness, which is incremental to existing theoretical work on interpolation and generalization.

The paper investigates whether interpolating estimators in nonparametric regression can maintain optimal performance under adversarial attacks, finding that they must be suboptimal and that perfect fitting damages robustness, with numerical experiments supporting these results.

Deep neural networks (DNNs) typically involve a large number of parameters and are trained to achieve zero or near-zero training error. Despite such interpolation, they often exhibit strong generalization performance on unseen data, a phenomenon that has motivated extensive theoretical investigations. Comforting results show that interpolation indeed may not affect the minimax rate of convergence under the squared error loss. In the mean time, DNNs are well known to be highly vulnerable to adversarial perturbations in future inputs. A natural question then arises: Can interpolation also escape from suboptimal performance under a future $X$-attack? In this paper, we investigate the adversarial robustness of interpolating estimators in a framework of nonparametric regression. A finding is that interpolating estimators must be suboptimal even under a subtle future $X$-attack, and achieving perfect fitting can substantially damage their robustness. An interesting phenomenon in the high interpolation regime, which we term the curse of simple size, is also revealed and discussed. Numerical experiments support our theoretical findings.

Foundations

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

Your Notes