← Search

Tanguy Urvoy

4 accepted papers

2026

Robust Detection of Synthetic Tabular Data Under Schema Variability

AAAI 2026technical

The rise of powerful generative models has sparked concerns over data authenticity. While detection methods have been extensively developed for images and text, the case of tabular data, despite its ubiquity, has been largely overlooked. Yet, detecting synthetic tabular data is especially challengin

Cited by 0SourcePDFScholar
2019

Budgeted Reinforcement Learning in Continuous State Space

NeurIPS 2019poster

A Budgeted Markov Decision Process (BMDP) is an extension of a Markov Decision Process to critical applications requiring safety constraints. It relies on a notion of risk implemented in the shape of an upper bound on a constrains violation signal that -- importantly -- can be modified in real-time.…

2016

Random Forest for the Contextual Bandit Problem

AISTATS 2016poster

To address the contextual bandit problem, we propose an online random forest algorithm. The analysis of the proposed algorithm is based on the sample complexity needed to find the optimal decision stump. Then, the decision stumps are recursively stacked in a random collection of decision trees, BAND…

Cited by 72SourcePDFScholar
2015

A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits

ICML 2015poster

We study the K-armed dueling bandit problem which is a variation of the classical Multi-Armed Bandit (MAB) problem in which the learner receives only relative feedback about the selected pairs of arms. We propose a new algorithm called Relative Exponential-weight algorithm for Exploration and Exploi…

Cited by 55SourcePDFScholar