Skip to content

Latest commit

 

History

History
55 lines (55 loc) · 2.19 KB

2021-07-01-bhagoji21a.md

File metadata and controls

55 lines (55 loc) · 2.19 KB
title abstract layout series publisher issn id month tex_title firstpage lastpage page order cycles bibtex_author author date address container-title volume genre issued pdf extras
Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries
Understanding the fundamental limits of robust supervised learning has emerged as a problem of immense interest, from both practical and theoretical standpoints. In particular, it is critical to determine classifier-agnostic bounds on the training loss to establish when learning is possible. In this paper, we determine optimal lower bounds on the cross-entropy loss in the presence of test-time adversaries, along with the corresponding optimal classification outputs. Our formulation of the bound as a solution to an optimization problem is general enough to encompass any loss function depending on soft classifier outputs. We also propose and provide a proof of correctness for a bespoke algorithm to compute this lower bound efficiently, allowing us to determine lower bounds for multiple practical datasets of interest. We use our lower bounds as a diagnostic tool to determine the effectiveness of current robust training methods and find a gap from optimality at larger budgets. Finally, we investigate the possibility of using of optimal classification outputs as soft labels to empirically improve robust training.
inproceedings
Proceedings of Machine Learning Research
PMLR
2640-3498
bhagoji21a
0
Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries
863
873
863-873
863
false
Bhagoji, Arjun Nitin and Cullina, Daniel and Sehwag, Vikash and Mittal, Prateek
given family
Arjun Nitin
Bhagoji
given family
Daniel
Cullina
given family
Vikash
Sehwag
given family
Prateek
Mittal
2021-07-01
Proceedings of the 38th International Conference on Machine Learning
139
inproceedings
date-parts
2021
7
1