activity
20182024
most citedEfficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback

3 citations · 7 across the 8 of their papers we have counts for

collaborators

10 papers

stat.ML2024

Pareto Set Identification With Posterior Sampling

Cyrille Kone, Marc Jourdan, Emilie Kaufmann

The problem of identifying the best answer among a collection of items having real-valued distribution is well-understood. Despite its practical relevance for many applications, fe…

cs.LG2024

Best-Arm Identification in Unimodal Bandits

Riccardo Poiani, Marc Jourdan, Emilie Kaufmann +1

We study the fixed-confidence best-arm identification problem in unimodal bandits, in which the means of the arms increase with the index of the arm up to their maximum, then decre…

stat.ML2023

An -Best-Arm Identification Algorithm for Fixed-Confidence and Beyond

Marc Jourdan, Rémy Degenne, Emilie Kaufmann

We propose EB-TC, a novel sampling rule for -best arm identification in stochastic bandits. It is the first instance of Top Two algorithm analyzed for app…

stat.ML2022

Non-Asymptotic Analysis of a UCB-based Top Two Algorithm

Marc Jourdan, Rémy Degenne

A Top Two sampling rule for bandit identification is a method which selects the next arm to sample from among two candidate arms, a leader and a challenger. Due to their simplicity…

stat.ML2022★ 2 cited

Dealing with Unknown Variances in Best-Arm Identification

Marc Jourdan, Rémy Degenne, Emilie Kaufmann

The problem of identifying the best arm among a collection of items having Gaussian rewards distribution is well understood when the variances are known. Despite its practical rele…

stat.ML2022

Choosing Answers in -Best-Answer Identification for Linear Bandits

Marc Jourdan, Rémy Degenne

In pure-exploration problems, information is gathered sequentially to answer a question on the stochastic environment. While best-arm identification for linear bandits has been ext…

stat.ML2022★ 2 cited

Top Two Algorithms Revisited

Marc Jourdan, Rémy Degenne, Dorian Baudry +2

Top Two algorithms arose as an adaptation of Thompson sampling to best arm identification in multi-armed bandit models (Russo, 2016), for parametric families of arms. They select t…

stat.ML2021★ 3 cited

Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback

Marc Jourdan, Mojmír Mutný, Johannes Kirschner +1

Combinatorial bandits with semi-bandit feedback generalize multi-armed bandits, where the agent chooses sets of arms and observes a noisy reward for each arm contained in the chose…

cs.CR2018

A Probabilistic Model of the Bitcoin Blockchain

Marc Jourdan, Sebastien Blandin, Laura Wynter +1

The Bitcoin transaction graph is a public data structure organized as transactions between addresses, each associated with a logical entity. In this work, we introduce a complete p…

cs.CR2018

Characterizing Entities in the Bitcoin Blockchain

Marc Jourdan, Sebastien Blandin, Laura Wynter +1

Bitcoin has created a new exchange paradigm within which financial transactions can be trusted without an intermediary. This premise of a free decentralized transactional network h…