Alexandre Proutiere

Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model ICML 2025 Conformal Predictions under Markovian Data ICML 2024 Low-Rank Bandits via Tight Two-to-Infinity Singular Subspace Recovery ICML 2024 Model-free Low-Rank Reinforcement Learning via Leveraged Entry-wise Matrix Estimation NeurIPS 2024 On Universally Optimal Algorithms for A/B Testing ICML 2024 Best Arm Identification in Multi-Agent Multi-Armed Bandits ICML 2023 Best Arm Identification with Fixed Budget: A Large Deviation Perspective NeurIPS 2023 Closing the Computational-Statistical Gap in Best Arm Identification for Combinatorial Semi-bandits NeurIPS 2023 Model-Free Active Exploration in Reinforcement Learning NeurIPS 2023 Nearly Optimal Latent State Decoding in Block MDPs AISTATS 2023 On the Sample Complexity of Representation Learning in Multi-Task Bandits with Global and Local Structure AAAI 2023 Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learning NeurIPS 2023 Statistical and Computational Trade-off in Multi-Agent Multi-Armed Bandits NeurIPS 2023 Minimal Expected Regret in Linear Quadratic Control AISTATS 2022 Thresholded Lasso Bandit ICML 2022 Adaptive Sampling for Best Policy Identification in Markov Decision Processes ICML 2021 Fast Pure Exploration via Frank-Wolfe NeurIPS 2021 Navigating to the Best Policy in Markov Decision Processes NeurIPS 2021 Optimal Algorithms for Multiplayer Multi-Armed Bandits AISTATS 2020 Optimal Best-arm Identification in Linear Bandits NeurIPS 2020 Regret in Online Recommendation Systems NeurIPS 2020 Optimal Sampling and Clustering in the Stochastic Block Model NeurIPS 2019 Exploration in Structured Reinforcement Learning NeurIPS 2018 Collaborative Clustering: Sample Complexity and Efficient Algorithms ALT 2017 Minimal Exploration in Structured Stochastic Bandits NeurIPS 2017 Optimal Cluster Recovery in the Labeled Stochastic Block Model NeurIPS 2016 Combinatorial Bandits Revisited NeurIPS 2015 Fast and Memory Optimal Low-Rank Matrix Approximation NeurIPS 2015 Community Detection via Random and Adaptive Sampling COLT 2014 Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014 Streaming, Memory Limited Algorithms for Community Detection NeurIPS 2014 Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014 Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards NeurIPS 2013