<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>1 | Dorian Baudry</title><link>https://dbaudry.github.io/publication-type/1/</link><atom:link href="https://dbaudry.github.io/publication-type/1/index.xml" rel="self" type="application/rss+xml"/><description>1</description><generator>Wowchemy (https://wowchemy.com)</generator><language>en-us</language><lastBuildDate>Mon, 19 Oct 2026 00:00:00 +0000</lastBuildDate><image><url>https://dbaudry.github.io/author/dorian-baudry/avatar_hu5a88e23c6c1f3e552612d1b67cc80314_375418_512x512_fill_lanczos_center.png</url><title>1</title><link>https://dbaudry.github.io/publication-type/1/</link></image><item><title>Towards instance-dependent regret optimality in Episodic MDPs with Posterior Sampling</title><link>https://dbaudry.github.io/publication/posterior-sampling-mdps/</link><pubDate>Mon, 19 Oct 2026 00:00:00 +0000</pubDate><guid>https://dbaudry.github.io/publication/posterior-sampling-mdps/</guid><description/></item><item><title>A Perturbation Approach to Unconstrained Linear Bandits</title><link>https://dbaudry.github.io/publication/unconstrained-linear-bandits/</link><pubDate>Wed, 08 Jul 2026 00:00:00 +0000</pubDate><guid>https://dbaudry.github.io/publication/unconstrained-linear-bandits/</guid><description/></item><item><title>Does Stochastic Gradient really succeed for bandits?</title><link>https://dbaudry.github.io/publication/sgb/</link><pubDate>Sun, 07 Dec 2025 12:12:00 +0100</pubDate><guid>https://dbaudry.github.io/publication/sgb/</guid><description/></item><item><title>Non-stationary Bandit Convex Optimization: A Comprehensive Study</title><link>https://dbaudry.github.io/publication/nsbco/</link><pubDate>Tue, 02 Dec 2025 00:00:00 +0000</pubDate><guid>https://dbaudry.github.io/publication/nsbco/</guid><description/></item><item><title>Improved learning rates in multi-unit uniform price auctions</title><link>https://dbaudry.github.io/publication/auctions/</link><pubDate>Sat, 07 Dec 2024 12:12:10 +0100</pubDate><guid>https://dbaudry.github.io/publication/auctions/</guid><description/></item><item><title>The Value of Reward Lookahead in Reinforcement Learning</title><link>https://dbaudry.github.io/publication/lookahead/</link><pubDate>Sat, 07 Dec 2024 12:12:00 +0100</pubDate><guid>https://dbaudry.github.io/publication/lookahead/</guid><description/></item><item><title>Lookback Prophet Inequalities</title><link>https://dbaudry.github.io/publication/lookback/</link><pubDate>Sat, 07 Dec 2024 00:00:00 +0000</pubDate><guid>https://dbaudry.github.io/publication/lookback/</guid><description/></item><item><title>Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits</title><link>https://dbaudry.github.io/publication/coalition/</link><pubDate>Sat, 07 Dec 2024 00:00:00 +0000</pubDate><guid>https://dbaudry.github.io/publication/coalition/</guid><description/></item><item><title>Multi-Armed Bandits with Guaranteed Revenue per Arm</title><link>https://dbaudry.github.io/publication/spoc/</link><pubDate>Mon, 01 Jan 2024 12:12:00 +0100</pubDate><guid>https://dbaudry.github.io/publication/spoc/</guid><description/></item><item><title>Fast asymptotically optimal algorithms for non-parametric stochastic bandits</title><link>https://dbaudry.github.io/publication/fastkinf/</link><pubDate>Sun, 07 May 2023 12:12:00 +0100</pubDate><guid>https://dbaudry.github.io/publication/fastkinf/</guid><description/></item><item><title>Top Two Algorithms Revisited</title><link>https://dbaudry.github.io/publication/toptwo/</link><pubDate>Thu, 07 Jul 2022 12:12:00 +0100</pubDate><guid>https://dbaudry.github.io/publication/toptwo/</guid><description/></item><item><title>Efficient Algorithms for Extreme Bandits</title><link>https://dbaudry.github.io/publication/extreme/</link><pubDate>Sun, 27 Mar 2022 12:12:00 +0100</pubDate><guid>https://dbaudry.github.io/publication/extreme/</guid><description/></item><item><title>From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits</title><link>https://dbaudry.github.io/publication/ds/</link><pubDate>Tue, 07 Dec 2021 12:12:00 +0100</pubDate><guid>https://dbaudry.github.io/publication/ds/</guid><description/></item><item><title>On Limited-Memory Subsampling Strategies for Bandits</title><link>https://dbaudry.github.io/publication/lb_sda/</link><pubDate>Wed, 10 Feb 2021 00:00:00 +0000</pubDate><guid>https://dbaudry.github.io/publication/lb_sda/</guid><description/></item><item><title>Optimal Thompson Sampling strategies for support-aware CVaR bandits</title><link>https://dbaudry.github.io/publication/ts_cvar/</link><pubDate>Mon, 01 Feb 2021 00:00:00 +0000</pubDate><guid>https://dbaudry.github.io/publication/ts_cvar/</guid><description/></item><item><title>Sub-sampling for Efficient Non-Parametric Bandit Exploration</title><link>https://dbaudry.github.io/publication/sub-sampling/</link><pubDate>Thu, 22 Oct 2020 12:12:00 +0100</pubDate><guid>https://dbaudry.github.io/publication/sub-sampling/</guid><description/></item></channel></rss>