Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Euijin You

dblp:421/0324 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 67% Optimization for machine learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.912025
Quadratic Upper Bound for Boosting Robustness · ICML 2025
Machine learning › Trustworthy machine learning › robustness › adversarial robustness › adversarial training
fast adversarial training
0.912025
Quadratic Upper Bound for Boosting Robustness · ICML 2025
Machine learning › Optimization for machine learning
loss landscape smoothing
0.912025
Quadratic Upper Bound for Boosting Robustness · ICML 2025

Methods — techniques the papers use, named apart from their topics

quadratic upper bound · 0.9loss function design · 0.9adversarial training · 0.9
YearPublicationVenuePosition
2025 Quadratic Upper Bound for Boosting Robustness
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.
Euijin You, Hyang-Won Lee
ICML1