Get our free extension to see links to code for papers anywhere online!

Add to Chrome

Add to Firefox

Picture for Maksym Andriushchenko

Maksym Andriushchenko

Towards Understanding Sharpness-Aware Minimization

Jun 13, 2022
Maksym Andriushchenko, Nicolas Flammarion

Figure 1 for Towards Understanding Sharpness-Aware Minimization

Figure 2 for Towards Understanding Sharpness-Aware Minimization

Figure 3 for Towards Understanding Sharpness-Aware Minimization

Figure 4 for Towards Understanding Sharpness-Aware Minimization

* The camera-ready version (accepted at ICML 2022)

Access Paper or Ask Questions

On the effectiveness of adversarial training against common corruptions

Mar 03, 2021
Klim Kireev, Maksym Andriushchenko, Nicolas Flammarion

Figure 1 for On the effectiveness of adversarial training against common corruptions

Figure 2 for On the effectiveness of adversarial training against common corruptions

Figure 3 for On the effectiveness of adversarial training against common corruptions

Figure 4 for On the effectiveness of adversarial training against common corruptions

Access Paper or Ask Questions

Understanding and Improving Fast Adversarial Training

Jul 06, 2020
Maksym Andriushchenko, Nicolas Flammarion

Figure 1 for Understanding and Improving Fast Adversarial Training

Figure 2 for Understanding and Improving Fast Adversarial Training

Figure 3 for Understanding and Improving Fast Adversarial Training

Figure 4 for Understanding and Improving Fast Adversarial Training

Access Paper or Ask Questions

On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselines

Jun 08, 2020
Marius Mosbach, Maksym Andriushchenko, Dietrich Klakow

Figure 1 for On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselines

Figure 2 for On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselines

Figure 3 for On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselines

Figure 4 for On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselines

Access Paper or Ask Questions

Square Attack: a query-efficient black-box adversarial attack via random search

Nov 29, 2019
Maksym Andriushchenko, Francesco Croce, Nicolas Flammarion, Matthias Hein

Figure 1 for Square Attack: a query-efficient black-box adversarial attack via random search

Figure 2 for Square Attack: a query-efficient black-box adversarial attack via random search

Figure 3 for Square Attack: a query-efficient black-box adversarial attack via random search

Figure 4 for Square Attack: a query-efficient black-box adversarial attack via random search

Access Paper or Ask Questions

Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

Jun 08, 2019
Maksym Andriushchenko, Matthias Hein

Figure 1 for Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

Figure 2 for Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

Figure 3 for Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

Figure 4 for Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

Access Paper or Ask Questions

Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problem

Dec 13, 2018
Matthias Hein, Maksym Andriushchenko, Julian Bitterwolf

Figure 1 for Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problem

Figure 2 for Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problem

Figure 3 for Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problem

Figure 4 for Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problem

Access Paper or Ask Questions