activity
20132022
most citedTheoretical evidence for adversarial robustness through randomization

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

collaborators

38 papers

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★ 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…

cs.LG2021

Non parametric estimation of causal populations in a counterfactual scenario

Celine Beji, Florian Yger, Jamal Atif

In causality, estimating the effect of a treatment without confounding inference remains a major issue because requires to assess the outcome in both case with and without treatmen…

cs.IR2021★ 1 cited

Two-sided fairness in rankings via Lorenz dominance

Virginie Do, Sam Corbett-Davies, Jamal Atif +1

We consider the problem of generating rankings that are fair towards both users and item producers in recommender systems. We address both usual recommendation (e.g., of music or m…

cs.AI2021

Online Selection of Diverse Committees

Virginie Do, Jamal Atif, Jérôme Lang +1

Citizens' assemblies need to represent subpopulations according to their proportions in the general population. These large committees are often constructed in an online fashion by…

cs.LG2021★ 3 cited

Online certification of preference-based fairness for personalized recommender systems

Virginie Do, Sam Corbett-Davies, Jamal Atif +1

Recommender systems are facing scrutiny because of their growing impact on the opportunities we have access to. Current audits for fairness are limited to coarse-grained parity ass…

cs.LG2021

On the robustness of randomized classifiers to adversarial examples

Rafael Pinot, Laurent Meunier, Florian Yger +3

This paper investigates the theory of robustness against adversarial attacks. We focus on randomized classifiers (\emph{i.e.} classifiers that output random variables) and provide…

cs.GT2021★ 2 cited

Mixed Nash Equilibria in the Adversarial Examples Game

Laurent Meunier, Meyer Scetbon, Rafael Pinot +2

This paper tackles the problem of adversarial examples from a game theoretic point of view. We study the open question of the existence of mixed Nash equilibria in the zero-sum gam…

cs.LG2020

AAMDRL: Augmented Asset Management with Deep Reinforcement Learning

Eric Benhamou, David Saltiel, Sandrine Ungari +2

Can an agent learn efficiently in a noisy and self adapting environment with sequential, non-stationary and non-homogeneous observations? Through trading bots, we illustrate how De…

q-fin.PM2020

Detecting and adapting to crisis pattern with context based Deep Reinforcement Learning

Eric Benhamou, David Saltiel, Jean-Jacques Ohana +1

Deep reinforcement learning (DRL) has reached super human levels in complex tasks like game solving (Go and autonomous driving). However, it remains an open question whether DRL ca…

cs.LG2020

On Lipschitz Regularization of Convolutional Layers using Toeplitz Matrix Theory

Alexandre Araujo, Benjamin Negrevergne, Yann Chevaleyre +1

This paper tackles the problem of Lipschitz regularization of Convolutional Neural Networks. Lipschitz regularity is now established as a key property of modern deep learning with…

stat.ML2020★ 2 cited

Equitable and Optimal Transport with Multiple Agents

Meyer Scetbon, Laurent Meunier, Jamal Atif +1

We introduce an extension of the Optimal Transport problem when multiple costs are involved. Considering each cost as an agent, we aim to share equally between agents the work of t…

cs.LG2020

Estimating Individual Treatment Effects through Causal Populations Identification

Céline Beji, Michaël Bon, Florian Yger +1

Estimating the Individual Treatment Effect from observational data, defined as the difference between outcomes with and without treatment or intervention, while observing just one…

cs.LG2020★ 18 cited

Randomization matters. How to defend against strong adversarial attacks

Rafael Pinot, Raphael Ettedgui, Geovani Rizk +2

Is there a classifier that ensures optimal robustness against all adversarial attacks? This paper answers this question by adopting a game-theoretic point of view. We show that adv…

cs.LG2019★ 20 cited

Yet another but more efficient black-box adversarial attack: tiling and evolution strategies

Laurent Meunier, Jamal Atif, Olivier Teytaud

We introduce a new black-box attack achieving state of the art performances. Our approach is based on a new objective function, borrowing ideas from -white box attacks…

cs.LG2019★ 3 cited

A unified view on differential privacy and robustness to adversarial examples

Rafael Pinot, Florian Yger, Cédric Gouy-Pailler +1

This short note highlights some links between two lines of research within the emerging topic of trustworthy machine learning: differential privacy and robustness to adversarial ex…

cs.LG2019

NGO-GM: Natural Gradient Optimization for Graphical Models

Eric Benhamou, Jamal Atif, Rida Laraki +1

This paper deals with estimating model parameters in graphical models. We reformulate it as an information geometric optimization problem and introduce a natural gradient descent s…

cs.LG2019★ 25 cited

Robust Neural Networks using Randomized Adversarial Training

Alexandre Araujo, Laurent Meunier, Rafael Pinot +1

This paper tackles the problem of defending a neural network against adversarial attacks crafted with different norms (in particular and bounded adversarial…

cs.LG2019★ 35 cited

Theoretical evidence for adversarial robustness through randomization

Rafael Pinot, Laurent Meunier, Alexandre Araujo +4

This paper investigates the theory of robustness against adversarial attacks. It focuses on the family of randomization techniques that consist in injecting noise in the network at…

math.PR2019

Operator norm upper bound for sub-Gaussian tailed random matrices

Eric Benhamou, Jamal Atif, Rida Laraki

This paper investigates an upper bound of the operator norm for sub-Gaussian tailed random matrices. A lot of attention has been put on uniformly bounded sub-Gaussian tailed random…

cs.LG2019★ 4 cited

Understanding and Training Deep Diagonal Circulant Neural Networks

Alexandre Araujo, Benjamin Negrevergne, Yann Chevaleyre +1

In this paper, we study deep diagonal circulant neural networks, that is deep neural networks in which weight matrices are the product of diagonal and circulant ones. Besides makin…

cs.LG2018

A discrete version of CMA-ES

Eric Benhamou, Jamal Atif, Rida Laraki

Modern machine learning uses more and more advanced optimization techniques to find optimal hyper parameters. Whenever the objective function is non-convex, non continuous and with…

cs.LG2018

A new approach to learning in Dynamic Bayesian Networks (DBNs)

E. Benhamou, J. Atif, R. Laraki

In this paper, we revisit the parameter learning problem, namely the estimation of model parameters for Dynamic Bayesian Networks (DBNs). DBNs are directed graphical models of stoc…

cs.CV2018

Training compact deep learning models for video classification using circulant matrices

Alexandre Araujo, Benjamin Negrevergne, Yann Chevaleyre +1

In real world scenarios, model accuracy is hardly the only factor to consider. Large models consume more memory and are computationally more intensive, which makes them difficult t…