BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20251110T140000
DTEND;TZID=Europe/Helsinki:20251110T153000
DTSTAMP:20260710T010642
CREATED:20251021T122612Z
LAST-MODIFIED:20251021T124712Z
UID:18488-1762783200-1762788600@crest.science
SUMMARY:Marc JOURDAN (EPFL) - Advances in Pure Exploration in Bandits: Non-Asymptotic\, Private\, and Structured
DESCRIPTION:Statistical Seminar: Every Monday at 2:00 pm.\nTime: 2:00 pm – 3:00 pm\nDate: November 10th\nPlace: 3001 \n  \nMarc JOURDAN (EPFL) – Advances in Pure Exploration in Bandits: Non-Asymptotic\, Private\, and Structured \n  \n Abstract:  \nIn pure exploration problems for stochastic multi-armed bandits\, the goal is to answer a question about a set of unknown distributions (for example\, the efficacy of a treatment) by strategically sampling from them\, while providing guarantees on the returned answer. The archetypal example is the best arm identification problem\, where the task is to find the arm with the largest mean. Top Two algorithms\, which select the next arm to sample from among a leader and a challenger\, have received significant attention in recent years due to their simplicity and interpretability. \n  \nIn this talk\, I will present recent advances on three complementary aspects of pure exploration: achieving non-asymptotic guarantees\, ensuring differential privacy\, and leveraging problem structure. First\, we propose a Top Two algorithm which has an asymptotically optimal expected sample complexity\, and also provides anytime guarantees on the probability of misidentifying a sufficiently good arm. Second\, we show how the Top Two principle can be combined with differential privacy mechanisms\, leading to algorithms that preserve near-optimal efficiency while ensuring privacy guarantees. Finally\, we address structured pure exploration by overcoming the computational bottleneck of Pareto set identification in linear bandits\, through a game-based algorithm grounded in posterior sampling. These results not only deepen our theoretical understanding but also enable more practical and privacy-aware bandit algorithms for real-world problems. \n  \n  \nBio: \nI am a postdoctoral researcher at EPFL in the Theory of Machine Learning lab\, working with Nicolas Flammarion on the theoretical foundations of post-training for Large Language Models. I earned my PhD in Computer Science from the University of Lille\, under the supervision of Emilie Kaufmann and Rémy Degenne within the Inria Scool team. I studied pure exploration in stochastic bandits and helped establish the Top Two approach as a principled methodology with strong theoretical and empirical performance. Previously\, I graduated from École Polytechnique and ETH Zurich. \nhttps://marcjourdan.github.io/ \n  \n  \n  \nOrganizers: \nAnna KORBA (CREST)\, Karim LOUNICI (CMAP) \, Jaouad MOURTADA (CREST) \nSponsors:\nCREST-CMAP \n
URL:https://crest.science/event/marc-jourdan-epfl-advances-in-pure-exploration-in-bandits-non-asymptotic-private-and-structured/
CATEGORIES:Seminars,Statistics
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR