no code implementations • ICML 2020 • Rafael Pinot, Raphael Ettedgui, Geovani Rizk, Yann Chevaleyre, Jamal Atif
We demonstrate the non-existence of a Nash equilibrium in our game when the classifier and the adversary are both deterministic, hence giving a negative answer to the above question in the deterministic regime.
no code implementations • 20 Feb 2024 • Youssef Allouah, Sadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta, Rafael Pinot, Geovani Rizk, Sasha Voitovych
The natural approach to robustify FL against adversarial clients is to replace the simple averaging operation at the server in the standard $\mathsf{FedAvg}$ algorithm by a \emph{robust averaging rule}.
no code implementations • 1 Jun 2022 • Geovani Rizk, Igor Colin, Albert Thomas, Rida Laraki, Yann Chevaleyre
We propose the first regret-based approach to the Graphical Bilinear Bandits problem, where $n$ agents in a graph play a stochastic bilinear bandit game with each of their neighbors.
no code implementations • 22 Dec 2020 • Geovani Rizk, Igor Colin, Albert Thomas, Moez Draief
Experimental design is an approach for selecting samples among a given set so as to obtain the best estimator for a given criterion.
no code implementations • 14 Dec 2020 • Geovani Rizk, Albert Thomas, Igor Colin, Rida Laraki, Yann Chevaleyre
We study the best arm identification problem in which the learner wants to find the graph allocation maximizing the sum of the bilinear rewards.
1 code implementation • 26 Feb 2020 • Rafael Pinot, Raphael Ettedgui, Geovani Rizk, Yann Chevaleyre, Jamal Atif
We demonstrate the non-existence of a Nash equilibrium in our game when the classifier and the Adversary are both deterministic, hence giving a negative answer to the above question in the deterministic regime.