Supervised Learning Has a Necessary Geometric Blind Spot: Theory, Consequences, and Minimal Repair
Vishal Rajput

TL;DR
This paper reveals a fundamental geometric blind spot in supervised learning, showing it retains non-zero sensitivity along label-correlated directions, and proposes a minimal repair method called PMH.
Contribution
It proves the existence of a geometric blind spot in supervised learning, unifies several empirical phenomena, and introduces TDI and PMH for diagnosis and repair.
Findings
PGD adversarial training reduces Jacobian Frobenius norm but worsens geometry.
The geometric blind spot persists across architectures and datasets.
PMH effectively reduces the blind spot and improves robustness.
Abstract
PGD adversarial training, the standard robustness method, can reduce Jacobian Frobenius norm yet worsen clean-input geometry (e.g., TDI 1.336 vs. ERM 1.093). We show this is not an implementation artifact but a theorem-level consequence of supervised learning. We prove that any encoder minimizing supervised loss must retain non-zero sensitivity along directions correlated with training labels, including directions that are nuisance at test time. This holds across proper scoring rules, architectures, and dataset sizes. We call this the geometric blind spot of supervised learning. This theorem unifies four empirical phenomena often treated separately: non-robust features, texture bias, corruption fragility, and the robustness-accuracy tradeoff. It also explains why suppressing sensitivity in one adversarial direction can redistribute sensitivity elsewhere. We introduce Trajectory…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
