activity
20182026
most citedTheoretical evidence for adversarial robustness through randomization

35 citations · 148 across the 31 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

cs.LG2022★ 8 cited

On the Impossible Safety of Large AI Models

El-Mahdi El-Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui +5

Large AI Models (LAIMs), of which large language models are the most prominent recent example, showcase some impressive performance. However they have been empirically found to pos…

cs.LG2022★ 1 cited

Robust Collaborative Learning with Linear Gradient Overhead

Sadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta +3

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware…

cs.LG2022

Towards Evading the Limits of Randomized Smoothing: A Theoretical Analysis

Raphael Ettedgui, Alexandre Araujo, Rafael Pinot +2

Randomized smoothing is the dominant standard for provable defenses against adversarial examples. Nevertheless, this method has recently been proven to suffer from important inform…

cs.LG2022★ 9 cited

Byzantine Machine Learning Made Easy by Resilient Averaging of Momentums

Sadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta +2

Byzantine resilience emerged as a prominent topic within the distributed machine learning community. Essentially, the goal is to enhance distributed optimization algorithms, such a…

cs.LG2022★ 2 cited

Towards Consistency in Adversarial Classification

Laurent Meunier, Raphaël Ettedgui, Rafael Pinot +2

In this paper, we study the problem of consistency in the context of adversarial examples. Specifically, we tackle the following question: can surrogate losses still be used as a p…