Emilie Kaufmann

103 papers A* 19A 11B 12Journal 56Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Sequential Membership Inference Attacks. CoRR Thomas Michel, Debabrota Basu, Emilie Kaufmann
2025	A	`conf`	Bandit Pareto Set Identification in a Multi-Output Linear Model. AISTATS Cyrille Kone, Emilie Kaufmann, Laura Richert
2025	J	`jnl`	Bandit Pareto Set Identification in a Multi-Output Linear Model. CoRR Cyrille Kone, Emilie Kaufmann, Laura Richert
2025	A	`conf`	Best-Arm Identification in Unimodal Bandits. AISTATS Riccardo Poiani, Marc Jourdan, Emilie Kaufmann, Rémy Degenne
2025	A*	`conf`	Constrained Pareto Set Identification with Bandit Feedback. ICML Cyrille Kone, Emilie Kaufmann, Laura Richert
2025	J	`jnl`	Constrained Pareto Set Identification with Bandit Feedback. CoRR Cyrille Kone, Emilie Kaufmann, Laura Richert
2025	J	`jnl`	DP-SPRT: Differentially Private Sequential Probability Ratio Tests. CoRR Thomas Michel, Debabrota Basu, Emilie Kaufmann
2025	A	`conf`	Pareto Set Identification With Posterior Sampling. AISTATS Cyrille Kone, Marc Jourdan, Emilie Kaufmann
2024	A	`conf`	Bandit Pareto Set Identification: the Fixed Budget Setting. AISTATS Cyrille Kone, Emilie Kaufmann, Laura Richert
2024	J	`jnl`	Best-Arm Identification in Unimodal Bandits. CoRR Riccardo Poiani, Marc Jourdan, Emilie Kaufmann, Rémy Degenne
2024	A*	`conf`	Finding good policies in average-reward Markov Decision Processes without prior knowledge. NeurIPS Adrienne Tuynman, Rémy Degenne, Emilie Kaufmann
2024	J	`jnl`	Finding good policies in average-reward Markov Decision Processes without prior knowledge. CoRR Adrienne Tuynman, Rémy Degenne, Emilie Kaufmann
2024	A*	`conf`	Optimal Multi-Fidelity Best-Arm Identification. NeurIPS Riccardo Poiani, Rémy Degenne, Emilie Kaufmann, Alberto Maria Metelli, Marcello Restelli
2024	J	`jnl`	Optimal Multi-Fidelity Best-Arm Identification. CoRR Riccardo Poiani, Rémy Degenne, Emilie Kaufmann, Alberto Maria Metelli, Marcello Restelli
2024	J	`jnl`	Pareto Set Identification With Posterior Sampling. CoRR Cyrille Kone, Marc Jourdan, Emilie Kaufmann
2024	A	`conf`	Power Mean Estimation in Stochastic Monte-Carlo Tree Search. UAI Tuan Dam, Odalric-Ambrym Maillard, Emilie Kaufmann
2024	J	`jnl`	Power Mean Estimation in Stochastic Monte-Carlo Tree_Search. CoRR Tuan Dam, Odalric-Ambrym Maillard, Emilie Kaufmann
2023	A*	`conf`	Active Coverage for PAC Reinforcement Learning. COLT Aymen Al Marjani, Andrea Tirinzoni, Emilie Kaufmann
2023	J	`jnl`	Active Coverage for PAC Reinforcement Learning. CoRR Aymen Al Marjani, Andrea Tirinzoni, Emilie Kaufmann
2023	A*	`conf`	Adaptive Algorithms for Relaxed Pareto Set Identification. NeurIPS Cyrille Kone, Emilie Kaufmann, Laura Richert
2023	J	`jnl`	Adaptive Algorithms for Relaxed Pareto Set Identification. CoRR Cyrille Kone, Emilie Kaufmann, Laura Richert
2023	A*	`conf`	An ε-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond. NeurIPS Marc Jourdan, Rémy Degenne, Emilie Kaufmann
2023	J	`jnl`	An ε-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond. CoRR Marc Jourdan, Rémy Degenne, Emilie Kaufmann
2023	J	`jnl`	Bandit Pareto Set Identification: the Fixed Budget Setting. CoRR Cyrille Kone, Emilie Kaufmann, Laura Richert
2023	B	`conf`	Dealing with Unknown Variances in Best-Arm Identification. ALT Marc Jourdan, Rémy Degenne, Emilie Kaufmann
2023	B	`conf`	Optimistic PAC Reinforcement Learning: the Instance-Dependent View. ALT Andrea Tirinzoni, Aymen Al Marjani, Emilie Kaufmann
2023	J	`jnl`	Towards Instance-Optimality in Online PAC Reinforcement Learning. CoRR Aymen Al Marjani, Andrea Tirinzoni, Emilie Kaufmann
2022	J	`jnl`	Dealing with Unknown Variances in Best-Arm Identification. CoRR Marc Jourdan, Rémy Degenne, Emilie Kaufmann
2022	A	`conf`	Efficient Algorithms for Extreme Bandits. AISTATS Dorian Baudry, Yoan Russac, Emilie Kaufmann
2022	J	`jnl`	Efficient Algorithms for Extreme Bandits. CoRR Dorian Baudry, Yoan Russac, Emilie Kaufmann
2022	J	`jnl`	Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits. J. Mach. Learn. Res. Lilian Besson, Emilie Kaufmann, Odalric-Ambrym Maillard, Julien Seznec
2022	A*	`conf`	Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs. NeurIPS Andrea Tirinzoni, Aymen Al Marjani, Emilie Kaufmann
2022	J	`jnl`	Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs. CoRR Andrea Tirinzoni, Aymen Al Marjani, Emilie Kaufmann
2022	A*	`conf`	Near-Optimal Collaborative Learning in Bandits. NeurIPS Clémence Réda, Sattar Vakili, Emilie Kaufmann
2022	J	`jnl`	Near-Optimal Collaborative Learning in Bandits. CoRR Clémence Réda, Sattar Vakili, Emilie Kaufmann
2022	J	`jnl`	Optimistic PAC Reinforcement Learning: the Instance-Dependent View. CoRR Andrea Tirinzoni, Aymen Al Marjani, Emilie Kaufmann
2022	A*	`conf`	Top Two Algorithms Revisited. NeurIPS Marc Jourdan, Rémy Degenne, Dorian Baudry, Rianne de Heide, Emilie Kaufmann
2022	J	`jnl`	Top Two Algorithms Revisited. CoRR Marc Jourdan, Rémy Degenne, Dorian Baudry, Rianne de Heide, Emilie Kaufmann
2021	A	`conf`	A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces. AISTATS Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann, Michal Valko
2021	B	`conf`	Adaptive Reward-Free Exploration. ALT Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Edouard Leurent, Michal Valko
2021	B	`conf`	Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited. ALT Omar Darwiche Domingues, Pierre Ménard, Emilie Kaufmann, Michal Valko
2021	A*	`conf`	Fast active learning for pure exploration in reinforcement learning. ICML Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Emilie Kaufmann, Edouard Leurent, Michal Valko
2021	A*	`conf`	Kernel-Based Reinforcement Learning: A Finite-Time Analysis. ICML Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann, Michal Valko
2021	J	`jnl`	Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals. J. Mach. Learn. Res. Emilie Kaufmann, Wouter M. Koolen
2021	J	`jnl`	On Multi-Armed Bandit Designs for Dose-Finding Trials. J. Mach. Learn. Res. Maryam Aziz, Emilie Kaufmann, Marie-Karelle Riviere
2021	A*	`conf`	Optimal Thompson Sampling strategies for support-aware CVaR bandits. ICML Dorian Baudry, Romain Gautron, Emilie Kaufmann, Odalric Maillard
2021	A	`conf`	Top-m identification for linear bandits. AISTATS Clémence Réda, Emilie Kaufmann, Andrée Delahaye-Duriez
2021	J	`jnl`	Top-m identification for linear bandits. CoRR Clémence Réda, Emilie Kaufmann, Andrée Delahaye-Duriez
2020	J	`jnl`	A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces. CoRR Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann, Michal Valko
2020	A	`conf`	A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. AISTATS Abbas Mehrabian, Etienne Boursier, Emilie Kaufmann, Vianney Perchet
2020	J	`jnl`	Adaptive Reward-Free Exploration. CoRR Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Edouard Leurent, Michal Valko
2020	J	`jnl`	Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited. CoRR Omar Darwiche Domingues, Pierre Ménard, Emilie Kaufmann, Michal Valko
2020	J	`jnl`	Fast active learning for pure exploration in reinforcement learning. CoRR Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Emilie Kaufmann, Edouard Leurent, Michal Valko
2020	A	`conf`	Fixed-confidence guarantees for Bayesian best-arm identification. AISTATS Xuedong Shang, Rianne de Heide, Pierre Ménard, Emilie Kaufmann, Michal Valko
2020	A*	`conf`	Planning in Markov Decision Processes with Gap-Dependent Sample Complexity. NeurIPS Anders Jonsson, Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Edouard Leurent, Michal Valko
2020	J	`jnl`	Planning in Markov Decision Processes with Gap-Dependent Sample Complexity. CoRR Anders Jonsson, Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Edouard Leurent, Michal Valko
2020	J	`jnl`	Regret Bounds for Kernel-Based Reinforcement Learning. CoRR Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann, Michal Valko
2020	B	`conf`	Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling. ALT Cindy Trinh, Emilie Kaufmann, Claire Vernade, Richard Combes
2020	A*	`conf`	Sub-sampling for Efficient Non-Parametric Bandit Exploration. NeurIPS Dorian Baudry, Emilie Kaufmann, Odalric-Ambrym Maillard
2020	J	`jnl`	Sub-sampling for Efficient Non-Parametric Bandit Exploration. CoRR Dorian Baudry, Emilie Kaufmann, Odalric-Ambrym Maillard
2020	J	`jnl`	Thompson Sampling for CVaR Bandits. CoRR Dorian Baudry, Romain Gautron, Emilie Kaufmann, Odalric-Ambrym Maillard
2019	J	`jnl`	Asymptotically optimal algorithms for budgeted multiple play bandits. Mach. Learn. Alexander Luedtke, Emilie Kaufmann, Antoine Chambaz
2019	J	`jnl`	Fixed-Confidence Guarantees for Bayesian Best-Arm Identification. CoRR Xuedong Shang, Rianne de Heide, Emilie Kaufmann, Pierre Ménard, Michal Valko
2019	B	`conf`	General parallel optimization a without metric. ALT Xuedong Shang, Emilie Kaufmann, Michal Valko
2019	J	`jnl`	New Algorithms for Multiplayer Bandits when Arm Means Vary Among Players. CoRR Emilie Kaufmann, Abbas Mehrabian
2019	J	`jnl`	On Multi-Armed Bandit Designs for Phase I Clinical Trials. CoRR Maryam Aziz, Emilie Kaufmann, Marie-Karelle Riviere
2019	J	`jnl`	Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling. CoRR Cindy Trinh, Emilie Kaufmann, Claire Vernade, Richard Combes
2019	J	`jnl`	The Generalized Likelihood Ratio Test meets klUCB: an Improved Algorithm for Piece-Wise Non-Stationary Bandits. CoRR Lilian Besson, Emilie Kaufmann
2018	J	`jnl`	A spectral algorithm with additive clustering for the recovery of overlapping communities in networks. Theor. Comput. Sci. Emilie Kaufmann, Thomas Bonald, Marc Lelarge
2018	B	`conf`	Aggregation of multi-armed bandits learning algorithms for opportunistic spectrum access. WCNC Lilian Besson, Emilie Kaufmann, Christophe Moy
2018	B	`conf`	Corrupt Bandits for Preserving Local Privacy. ALT Pratik Gajane, Tanguy Urvoy, Emilie Kaufmann
2018	J	`jnl`	Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals. CoRR Emilie Kaufmann, Wouter M. Koolen
2018	J	`jnl`	Multi-Armed Bandit Learning in IoT Networks: Learning helps even in non-stationary settings. CoRR Rémi Bonnefoi, Lilian Besson, Christophe Moy, Emilie Kaufmann, Jacques Palicot
2018	B	`conf`	Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence. ALT Maryam Aziz, Jesse Anderton, Emilie Kaufmann, Javed A. Aslam
2018	J	`jnl`	Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence. CoRR Maryam Aziz, Jesse Anderton, Emilie Kaufmann, Javed A. Aslam
2018	A*	`conf`	Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling. NeurIPS Emilie Kaufmann, Wouter M. Koolen, Aurélien Garivier
2018	J	`jnl`	Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling. CoRR Emilie Kaufmann, Wouter M. Koolen, Aurélien Garivier
2018	J	`jnl`	What Doubling Tricks Can and Can't Do for Multi-Armed Bandits. CoRR Lilian Besson, Emilie Kaufmann
2018	B	`conf`	{Multi-Player Bandits Revisited}. ALT Lilian Besson, Emilie Kaufmann
2017	J	`jnl`	Corrupt Bandits for Privacy Preserving Input. CoRR Pratik Gajane, Tanguy Urvoy, Emilie Kaufmann
2017	J	`jnl`	Learning the distribution with largest mean: two bandit frameworks. CoRR Emilie Kaufmann, Aurélien Garivier
2017	—	`conf`	Monte-Carlo Tree Search by Best Arm Identification. NIPS Emilie Kaufmann, Wouter M. Koolen
2017	J	`jnl`	Monte-Carlo Tree Search by Best Arm Identification. CoRR Emilie Kaufmann, Wouter M. Koolen
2017	—	`conf`	Multi-Armed Bandit Learning in IoT Networks: Learning Helps Even in Non-stationary Settings. CrownCom Rémi Bonnefoi, Lilian Besson, Christophe Moy, Emilie Kaufmann, Jacques Palicot
2017	J	`jnl`	Multi-Player Bandits Models Revisited. CoRR Lilian Besson, Emilie Kaufmann
2016	B	`conf`	A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks. ALT Emilie Kaufmann, Thomas Bonald, Marc Lelarge
2016	J	`jnl`	Asymptotically Optimal Algorithms for Multiple Play Bandits with Partial Feedback. CoRR Alexander Luedtke, Emilie Kaufmann, Antoine Chambaz
2016	A*	`conf`	Maximin Action Identification: A New Bandit Framework for Games. COLT Aurélien Garivier, Emilie Kaufmann, Wouter M. Koolen
2016	J	`jnl`	Maximin Action Identification: A New Bandit Framework for Games. CoRR Aurélien Garivier, Emilie Kaufmann, Wouter M. Koolen
2016	J	`jnl`	On Explore-Then-Commit Strategies. CoRR Aurélien Garivier, Emilie Kaufmann, Tor Lattimore
2016	—	`conf`	On Explore-Then-Commit strategies. NIPS Aurélien Garivier, Tor Lattimore, Emilie Kaufmann
2016	J	`jnl`	On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models. J. Mach. Learn. Res. Emilie Kaufmann, Olivier Cappé, Aurélien Garivier
2016	A*	`conf`	Optimal Best Arm Identification with Fixed Confidence. COLT Aurélien Garivier, Emilie Kaufmann
2016	J	`jnl`	Optimal Best Arm Identification with Fixed Confidence. CoRR Aurélien Garivier, Emilie Kaufmann
2014	—	`—`	Analysis of bayesian and frequentist strategies for sequential resource allocation. (Analyse de stratégies bayésiennes et fréquentistes pour l'allocation séquentielle de ressources). Emilie Kaufmann
2014	A*	`conf`	On the Complexity of A/B Testing. COLT Emilie Kaufmann, Olivier Cappé, Aurélien Garivier
2014	J	`jnl`	On the Complexity of A/B Testing. CoRR Emilie Kaufmann, Olivier Cappé, Aurélien Garivier
2014	J	`jnl`	On the Complexity of Best Arm Identification in Multi-Armed Bandit Models. CoRR Emilie Kaufmann, Olivier Cappé, Aurélien Garivier
2013	A*	`conf`	Information Complexity in Bandit Subset Selection. COLT Emilie Kaufmann, Shivaram Kalyanakrishnan
2013	—	`conf`	Thompson Sampling for 1-Dimensional Exponential Family Bandits. NIPS Nathaniel Korda, Emilie Kaufmann, Rémi Munos
2012	A	`conf`	On Bayesian Upper Confidence Bounds for Bandit Problems. AISTATS Emilie Kaufmann, Olivier Cappé, Aurélien Garivier
2012	B	`conf`	Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis. ALT Emilie Kaufmann, Nathaniel Korda, Rémi Munos
2012	J	`jnl`	Thompson Sampling: An Optimal Finite Time Analysis CoRR Emilie Kaufmann, Nathaniel Korda, Rémi Munos