Transformers Learn Low Sensitivity Functions: Investigations and Implications

Transformers achieve state-of-the-art accuracy and robustness across many tasks, but an understanding of their inductive biases and how those biases differ from other neural network architectures remains elusive. In this work, we identify the sensitivity of the model to token-wise random perturbations in the input as a unified metric which explains the inductive bias of transformers across different data modalities and distinguishes them from other architectures. We show that transformers have lower sensitivity than MLPs, CNNs, ConvMixers and LSTMs, across both vision and language tasks. We also show that this low-sensitivity bias has important implications: i) lower sensitivity correlates with improved robustness; it can also be used as an efficient intervention to further improve the robustness of transformers; ii) it corresponds to flatter minima in the loss landscape; and iii) it can serve as a progress measure for grokking. We support these findings with theoretical results showing (weak) spectral bias of transformers in the NTK regime, and improved robustness due to the lower sensitivity. The code is available atthis https URL.

@article{vasudeva2025_2403.06925,
  title={ Transformers Learn Low Sensitivity Functions: Investigations and Implications },
  author={ Bhavya Vasudeva and Deqing Fu and Tianyi Zhou and Elliott Kau and Youqi Huang and Vatsal Sharan },
  journal={arXiv preprint arXiv:2403.06925},
  year={ 2025 }
}