Abstract
Focal loss has recently gained significant popularity, particularly in tasks like object detection where it helps to address class imbalance by focusing more on hard-to-classify examples. This work proposes the focal loss as a distortion measure for lossy source coding. The paper provides single-shot converse and achievability bounds. These bounds are then used to characterize the distortion-rate trade-off in the infinite blocklength, which is shown to be the same as that for the log loss case. In the nonasymptotic case, the difference between focal loss and log loss is illustrated through a series of simulations.
| Original language | English (US) |
|---|---|
| Title of host publication | ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 9798331543990 |
| DOIs | |
| State | Published - 2025 |
| Event | 2025 IEEE International Symposium on Information Theory, ISIT 2025 - Ann Arbor, United States Duration: Jun 22 2025 → Jun 27 2025 |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| ISSN (Print) | 2157-8095 |
Conference
| Conference | 2025 IEEE International Symposium on Information Theory, ISIT 2025 |
|---|---|
| Country/Territory | United States |
| City | Ann Arbor |
| Period | 6/22/25 → 6/27/25 |
Bibliographical note
Publisher Copyright:© 2025 IEEE.