Maksym Andriushchenko
Maksym Andriushchenko
PhD student, EPFL
Verified email at
TitleCited byYear
Formal guarantees on the robustness of a classifier against adversarial manipulation
M Hein, M Andriushchenko
NeurIPS 2017, 2017
Provable Robustness of ReLU Networks via Maximization of Linear Regions
F Croce*, M Andriushchenko*, M Hein
AISTATS 2019, 2018
Logit Pairing Methods Can Fool Gradient-Based Attacks
M Mosbach*, M Andriushchenko*, T Trost, M Hein, D Klakow
NeurIPS 2018 Workshop on Security in Machine Learning, 2018
Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problem
M Hein, M Andriushchenko, J Bitterwolf
CVPR 2019 (oral), 2018
Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks
M Andriushchenko, M Hein
NeurIPS 2019, 2019
Square Attack: a query-efficient black-box adversarial attack via random search
M Andriushchenko, F Croce, N Flammarion, M Hein
arXiv preprint arXiv:1912.00049, 2019
Provable Adversarial Defenses for Boosting
M Andriushchenko
Master's thesis, Saarland University, 2019
The system can't perform the operation now. Try again later.
Articles 1–7