Quadratic Upper Bound for Boosting Robustness

Euijin You, Hyang-Won Lee
1/20/2026
cs.LGcs.AIcs.CV

No confident code implementation found for this paper.

Abstract

Fast adversarial training (FAT) aims to enhance the robustness of models against adversarial attacks with reduced training time, however, FAT often suffers from compromised robustness due to insufficient exploration of adversarial space. In this paper, we develop a loss function to mitigate the problem of degraded robustness under FAT. Specifically, we derive a quadratic upper bound (QUB) on the adversarial training (AT) loss function and propose to utilize the bound with existing FAT methods. Our experimental results show that applying QUB loss to the existing methods yields significant improvement of robustness. Furthermore, using various metrics, we demonstrate that this improvement is likely to result from the smoothened loss landscape of the resulting model.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{you2026quadratic,
  title  = {Quadratic Upper Bound for Boosting Robustness},
  author = {Euijin You and Hyang-Won Lee},
  year   = {2026},
  eprint = {2601.13645},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.13645v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.13645.svg)](https://codeofpaper.com/paper/2601.13645)

Discussion