Skip to content

Sbastien Bubeck

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

46

Venues

9

Active years

2009–2024

Best venue rank

A*

Where they publish

Papers

46 indexed papers, newest first.

YearVenueTitleAuthors
2024ICLRHow to Fine-Tune Vision Models with SGD.Ananya Kumar, Ruoqi Shen, Sbastien Bubeck, Suriya Gunasekar
2023ACLAutoMoE: Heterogeneous Mixture-of-Experts with Adaptive Computation for Efficient Neural Machine Translation.Ganesh Jawahar, Subhabrata Mukherjee, Xiaodong Liu, Young Jin Kim, Muhammad Abdul-Mageed, Laks V. S. Lakshmanan, Ahmed Hassan Awadallah, Sbastien Bubeck, Jianfeng Gao
2023ALTOn the complexity of finding stationary points of smooth functions in one dimension.Sinho Chewi, Sbastien Bubeck, Adil Salim
2023STOCThe Randomized k-Server Conjecture Is False!Sbastien Bubeck, Christian Coester, Yuval Rabani
2022FOCSShortest Paths without a Map, but with an Entropic Regularizer.Sbastien Bubeck, Christian Coester, Yuval Rabani
2022ICMLData Augmentation as Feature Manipulation.Ruoqi Shen, Sbastien Bubeck, Suriya Gunasekar
2021COLTCooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions.Sbastien Bubeck, Thomas Budzinski, Mark Sellke
2021COLTA Law of Robustness for Two-Layers Neural Networks.Sbastien Bubeck, Yuanzhi Li, Dheeraj M. Nagaraj
2021SODAOnline Multiserver Convex Chasing and Optimization.Sbastien Bubeck, Yuval Rabani, Mark Sellke
2020ALTFirst-Order Bayesian Regret Analysis of Thompson Sampling.Sbastien Bubeck, Mark Sellke
2020COLTCoordination without communication: optimal regret in two players multi-armed bandits.Sbastien Bubeck, Thomas Budzinski
2020COLTNon-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without.Sbastien Bubeck, Yuanzhi Li, Yuval Peres, Mark Sellke
2020COLTHow to Trap a Gradient Flow.Sbastien Bubeck, Dan Mikulincer
2020FOCSEntanglement is Necessary for Optimal Quantum Property Testing.Sbastien Bubeck, Sitan Chen, Jerry Li
2020ICMLStatistically Preconditioned Accelerated Gradient Method for Distributed Optimization.Hadrien Hendrikx, Lin Xiao, Sbastien Bubeck, Francis R. Bach, Laurent Massouli
2020ICMLOnline Learning for Active Cache Synchronization.Andrey Kolobov, Sbastien Bubeck, Julian Zimmert
2020SODAChasing Nested Convex Bodies Nearly Optimally.Sbastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li, Mark Sellke
2019COLTNear-optimal method for highly smooth convex optimization.Sbastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, Aaron Sidford
2019COLTImproved Path-length Regret Bounds for Bandits.Sbastien Bubeck, Yuanzhi Li, Haipeng Luo, Chen-Yu Wei
2019COLTNear Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives.Alexander V. Gasnikov, Pavel E. Dvurechensky, Eduard Gorbunov, Evgeniya A. Vorontsova, Daniil Selikhanovych, Csar A. Uribe, Bo Jiang, Haoyue Wang, Shuzhong Zhang, Sbastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, Aaron Sidford
2019ICMLAdversarial examples from computational constraints.Sbastien Bubeck, Yin Tat Lee, Eric Price, Ilya P. Razenshteyn
2019SODAA Nearly-Linear Bound for Chasing Nested Convex Bodies.C. J. Argue, Sbastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee
2019SODAMetrical task systems on trees via mirror descent and unfair gluing.Sbastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee
2019STOCCompetitively chasing convex bodies.Sbastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
2018ALTSparsity, variance and curvature in multi-armed bandits.Sbastien Bubeck, Michael B. Cohen, Yuanzhi Li
2018COLTConference on Learning Theory 2018: Preface.Sbastien Bubeck, Philippe Rigollet
2018ICMLMake the Minority Great Again: First-Order Regret Bound for Contextual Bandits.Zeyuan Allen-Zhu, Sbastien Bubeck, Yuanzhi Li
2018STOCAn homotopy method for lSbastien Bubeck, Michael B. Cohen, Yin Tat Lee, Yuanzhi Li
2018STOCk-server via multiscale entropic regularization.Sbastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, Aleksander Madry
2017ICMLOptimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks.Kevin Scaman, Francis R. Bach, Sbastien Bubeck, Yin Tat Lee, Laurent Massouli
2017STOCLocal max-cut in smoothed polynomial time.Omer Angel, Sbastien Bubeck, Yuval Peres, Fan Wei
2017STOCKernel-based methods for bandit convex optimization.Sbastien Bubeck, Yin Tat Lee, Ronen Eldan
2016COLTMulti-scale exploration of convex functions and bandit convex optimization.Sbastien Bubeck, Ronen Eldan
2016ICMLBlack-box Optimization with a Politician.Sbastien Bubeck, Yin Tat Lee
2015COLTBandit Convex Optimization: \(\sqrt{T}\) Regret in One Dimension.Sbastien Bubeck, Ofer Dekel, Tomer Koren, Yuval Peres
2015COLTThe entropic barrier: a simple and optimal universal self-concordant barrier.Sbastien Bubeck, Ronen Eldan
2014CISSPrior-free and prior-dependent regret bounds for Thompson Sampling.Sbastien Bubeck, Che-Yu Liu
2014COLTlil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits.Kevin Jamieson, Matthew Malloy, Robert D. Nowak, Sbastien Bubeck
2014COLTMost Correlated Arms Identification.Che-Yu Liu, Sbastien Bubeck
2013COLTBounded regret in stochastic multi-armed bandits.Sbastien Bubeck, Vianney Perchet, Philippe Rigollet
2013ICMLMultiple Identifications in Multi-Armed Bandits.Sbastien Bubeck, Tengyao Wang, Nitin Viswanathan
2011ALTLipschitz Bandits without the Lipschitz Constant.Sbastien Bubeck, Gilles Stoltz, Jia Yuan Yu
2010COLTBest Arm Identification in Multi-Armed Bandits.Jean-Yves Audibert, Sbastien Bubeck, Rmi Munos
2010COLTOpen Loop Optimistic Planning.Sbastien Bubeck, Rmi Munos
2009ALTPure Exploration in Multi-armed Bandits Problems.Sbastien Bubeck, Rmi Munos, Gilles Stoltz
2009COLTMinimax Policies for Adversarial and Stochastic Bandits.Jean-Yves Audibert, Sbastien Bubeck