activity
20182026
most citedEfficient GAN-Based Anomaly Detection

482 citations · 677 across the 19 of their papers we have counts for

collaborators
Showing cs.LGShow all

11 papers · 1 filter

cs.LG2026

Doubly Robust Proxy Causal Learning with Neural Mean Embeddings

Bariscan Bozkurt, Alexandre Galashov, Dimitri Meunier +3

We propose a novel doubly robust neural mean-embedding framework for proxy causal learning (PCL) for continuous and structured treatments. PCL uses proxy variables and bridge funct…

cs.LG2025

Density Ratio-Free Doubly Robust Proxy Causal Learning

Bariscan Bozkurt, Houssam Zenati, Dimitri Meunier +2

We study the problem of causal function estimation in the Proxy Causal Learning (PCL) framework, where confounders are not observed but proxies for the confounders are available. T…

cs.LG2024

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits

Julien Zhou, Pierre Gaillard, Thibaud Rahier +2

We address the problem of stochastic combinatorial semi-bandits, where a player selects among P actions from the power set of a set containing d base items. Adaptivity to the probl…

cs.LG2023

Sequential Counterfactual Risk Minimization

Houssam Zenati, Eustache Diemert, Matthieu Martin +2

Counterfactual Risk Minimization (CRM) is a framework for dealing with the logged bandit feedback problem, where the goal is to improve a logging policy using offline data. In this…

cs.LG2022

Nested bandits

Matthieu Martin, Panayotis Mertikopoulos, Thibaud Rahier +1

In many online decision processes, the optimizing agent is called to choose between large numbers of alternatives with many inherent similarities; in turn, these similarities imply…

cs.LG2022

Efficient Kernel UCB for Contextual Bandits

Houssam Zenati, Alberto Bietti, Eustache Diemert +3

In this paper, we tackle the computational efficiency of kernelized UCB algorithms in contextual bandits. While standard methods require a O(CT^3) complexity where T is the horizon…

cs.LG2018★ 23 cited

Adversarially Learned Anomaly Detection

Houssam Zenati, Manon Romain, Chuan Sheng Foo +2

Anomaly detection is a significant and hence well-studied problem. However, developing effective anomaly detection methods for complex and high-dimensional data remains a challenge…

cs.LG2018★ 13 cited

Manifold regularization with GANs for semi-supervised learning

Bruno Lecouat, Chuan-Sheng Foo, Houssam Zenati +1

Generative Adversarial Networks are powerful generative models that are able to model the manifold of natural images. We leverage this property to perform manifold regularization b…

cs.LG2018★ 114 cited

Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile

Panayotis Mertikopoulos, Bruno Lecouat, Houssam Zenati +3

Owing to their connection with generative adversarial networks (GANs), saddle-point problems have recently attracted considerable interest in machine learning and beyond. By necess…

cs.LG2018★ 14 cited

Semi-Supervised Learning with GANs: Revisiting Manifold Regularization

Bruno Lecouat, Chuan-Sheng Foo, Houssam Zenati +1

GANS are powerful generative models that are able to model the manifold of natural images. We leverage this property to perform manifold regularization by approximating the Laplaci…

cs.LG2018★ 482 cited

Efficient GAN-Based Anomaly Detection

Houssam Zenati, Chuan Sheng Foo, Bruno Lecouat +2

Generative adversarial networks (GANs) are able to model the complex highdimensional distributions of real-world data, which suggests they could be effective for anomaly detection.…