activity
20132022
most citedTheoretical evidence for adversarial robustness through randomization

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

collaborators
Showing 2018Show all

7 papers · 1 filter

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…

cs.DS2018★ 13 cited

Graph-based Clustering under Differential Privacy

Rafael Pinot, Anne Morvan, Florian Yger +2

In this paper, we present the first differentially private clustering method for arbitrary-shaped node clusters in a graph. This algorithm takes as input only an approximate Minimu…

cs.AI2018

Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction

Marc Aiguier, Jamal Atif, Isabelle Bloch +1

The aim of this paper is to introduce a new framework for defining abductive reasoning operators based on a notion of retraction in arbitrary logics defined as satisfaction systems…

stat.ML2018

Uplift Modeling from Separate Labels

Ikko Yamane, Florian Yger, Jamal Atif +1

Uplift modeling is aimed at estimating the incremental impact of an action on an individual's behavior, which is useful in various application domains such as targeted marketing (a…

cs.LG2018★ 1 cited

On the Needs for Rotations in Hypercubic Quantization Hashing

Anne Morvan, Antoine Souloumiac, Krzysztof Choromanski +2

The aim of this paper is to endow the well-known family of hypercubic quantization hashing methods with theoretical guarantees. In hypercubic quantization, applying a suitable (ran…