Sébastien Bubeck

发表

Open Loop Optimistic Planning

Rémi Munos, Sébastien Bubeck, 2010, COLT.

From trees to seeds: on the inference of the seed from large trees in the uniform attachment model pdf

Elchanan Mossel, Sébastien Bubeck, Miklós Z. Rácz, 2014, ArXiv.

Finding Adam in random growing trees pdf

Luc Devroye, Gábor Lugosi, Sébastien Bubeck, 2014, Random Struct. Algorithms.

–armed Bandits

Csaba Szepesvári, Rémi Munos, Sébastien Bubeck, 2022 .

A note on the Bayesian regret of Thompson Sampling with an arbitrary prior pdf

Sébastien Bubeck, Che-Yu Liu, Sébastien Bubeck, 2013, ArXiv.

A geometric alternative to Nesterov's accelerated gradient descent pdf

Mohit Singh, Yin Tat Lee, Sébastien Bubeck, 2015, ArXiv.

Multi-scale exploration of convex functions and bandit convex optimization pdf

Sébastien Bubeck, Ronen Eldan, Sébastien Bubeck, 2015, COLT.

Pure exploration in finitely-armed and continuous-armed bandits

Rémi Munos, Sébastien Bubeck, Gilles Stoltz, 2011, Theor. Comput. Sci..

Local max-cut in smoothed polynomial time

Yuval Peres, Sébastien Bubeck, Fan Wei, 2017, STOC.

Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without pdf

Yuval Peres, Yuanzhi Li, Sébastien Bubeck, 2020, COLT.

Convex Optimization: Algorithms and Complexity

Sébastien Bubeck, Sébastien Bubeck, 2014, Found. Trends Mach. Learn..

Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits pdf

Yuanzhi Li, Sébastien Bubeck, Zeyuan Allen-Zhu, 2018, ICML.

Exceptional rotations of random graphs: a VC theory

Luc Devroye, Gábor Lugosi, Sébastien Bubeck, 2015, J. Mach. Learn. Res..

Lipschitz Bandits without the Lipschitz Constant

Jia Yuan Yu, Sébastien Bubeck, Gilles Stoltz, 2011, ALT.

Introduction to Online Optimization

Sébastien Bubeck, Sébastien Bubeck, 2011 .

First-Order Bayesian Regret Analysis of Thompson Sampling

Sébastien Bubeck, Mark Sellke, 2020, ALT.

Consistent Minimization of Clustering Objective Functions

Ulrike von Luxburg, Michael Kaufmann, Sébastien Bubeck, 2007, NIPS.

Multi-Bandit Best Arm Identification

Alessandro Lazaric, Sébastien Bubeck, Mohammad Ghavamzadeh, 2011, NIPS.

Conference on Learning Theory 2018: Preface

Sébastien Bubeck, Philippe Rigollet, 2018, COLT.

Entropic CLT and phase transition in high-dimensional Wishart matrices pdf

Sébastien Bubeck, Shirshendu Ganguly, Sébastien Bubeck, 2015, ArXiv.

Adversarial Examples from Cryptographic Pseudo-Random Generators pdf

Yin Tat Lee, Sébastien Bubeck, Ilya P. Razenshteyn, 2018, ArXiv.

Bandit view on noisy optimization

Rémi Munos, Sébastien Bubeck, Jean-Yves Audibert, 2011 .

Online Auctions and Multi-scale Online Learning

Nikhil R. Devanur, Sébastien Bubeck, Rad Niazadeh, 2017, EC.

On the Local Profiles of Trees

Nathan Linial, Sébastien Bubeck, 2016, J. Graph Theory.

Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimality pdf

Damien Ernst, Aurélien Garivier, Sébastien Bubeck, 2012, J. Mach. Learn. Res..

The entropic barrier: a simple and optimal universal self-concordant barrier pdf

Sébastien Bubeck, Ronen Eldan, Sébastien Bubeck, 2014, COLT.

Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks

Laurent Massoulié, Yin Tat Lee, Francis R. Bach, 2017, ICML.

Basic models and questions in statistical network analysis pdf

Sébastien Bubeck, Miklós Z. Rácz, Sébastien Bubeck, 2016, ArXiv.

Theory of Convex Optimization for Machine Learning pdf

Sébastien Bubeck, Sébastien Bubeck, 2014, ArXiv.

On Finding the Largest Mean Among Many pdf

Matthew Malloy, Robert D. Nowak, Sébastien Bubeck, 2013, ArXiv.

A Nearly-Linear Bound for Chasing Nested Convex Bodies pdf

Yin Tat Lee, Sébastien Bubeck, Michael B. Cohen, 2018, SODA.

Prior-free and prior-dependent regret bounds for Thompson Sampling

Sébastien Bubeck, Che-Yu Liu, Sébastien Bubeck, 2013, 2014 48th Annual Conference on Information Sciences and Systems (CISS).

Testing for high‐dimensional geometry in random graphs

Sébastien Bubeck, Miklós Z. Rácz, Ronen Eldan, 2014, Random Struct. Algorithms.

Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives

Yin Tat Lee, Yuanzhi Li, Qijia Jiang, 2019, Annual Conference Computational Learning Theory.

Pure Exploration for Multi-Armed Bandit Problems pdf

Rémi Munos, Sébastien Bubeck, Gilles Stoltz, 2008, ArXiv.

Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

Sébastien Bubeck, Nicolò Cesa-Bianchi, N. Cesa-Bianchi, 2012, Found. Trends Mach. Learn..

k-server via multiscale entropic regularization

James R. Lee, Yin Tat Lee, Aleksander Madry, 2017, STOC.

Nearest Neighbor Clustering: A Baseline Method for Consistent Clustering with Arbitrary Objective Functions

Ulrike von Luxburg, Sébastien Bubeck, Sébastien Bubeck, 2009, J. Mach. Learn. Res..

Bounded regret in stochastic multi-armed bandits

Vianney Perchet, Sébastien Bubeck, Philippe Rigollet, 2013, COLT.

Most Correlated Arms Identification

Sébastien Bubeck, Che-Yu Liu, Sébastien Bubeck, 2014, COLT.

Finite-Time Analysis of Projected Langevin Monte Carlo

Sébastien Bubeck, Ronen Eldan, Joseph Lehec, 2015, NIPS.

On the Influence of the Seed Graph in the Preferential Attachment Model

Elchanan Mossel, Sébastien Bubeck, Miklós Z. Rácz, 2014, IEEE Transactions on Network Science and Engineering.

lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits pdf

Matthew Malloy, Robert D. Nowak, Sébastien Bubeck, 2013, COLT.

Metrical task systems on trees via mirror descent and unfair gluing pdf

James R. Lee, Yin Tat Lee, Sébastien Bubeck, 2018, SODA.

Chasing Nested Convex Bodies Nearly Optimally

Yin Tat Lee, Yuanzhi Li, Sébastien Bubeck, 2018, SODA.

Parametrized Metrical Task Systems pdf

Yuval Rabani, Sébastien Bubeck, Sébastien Bubeck, 2019, APPROX-RANDOM.

Towards Minimax Policies for Online Linear Optimization with Bandit Feedback pdf

Sham M. Kakade, Sébastien Bubeck, Nicolò Cesa-Bianchi, 2012, COLT.

Black-box Optimization with a Politician

Yin Tat Lee, Sébastien Bubeck, 2016, ICML.

First-Order Regret Analysis of Thompson Sampling pdf

Sébastien Bubeck, Mark Sellke, 2019, ArXiv.

Improved Path-length Regret Bounds for Bandits

Haipeng Luo, Chen-Yu Wei, Yuanzhi Li, 2019, COLT.

Pure Exploration in Multi-armed Bandits Problems

Rémi Munos, Sébastien Bubeck, Gilles Stoltz, 2009, ALT.

Sparsity, variance and curvature in multi-armed bandits pdf

Yuanzhi Li, Sébastien Bubeck, Michael B. Cohen, 2017, ALT.

The Entropic Barrier: Exponential Families, Log-Concave Geometry, and Self-Concordance

Sébastien Bubeck, Ronen Eldan, 2018, Math. Oper. Res..

25th Annual Conference on Learning Theory The Best of Both Worlds: Stochastic and Adversarial Bandits pdf

Aleksandrs Slivkins, Sébastien Bubeck, Sébastien Bubeck, 2022 .

Is Q-learning Provably Efficient?

Michael I. Jordan, Sébastien Bubeck, Chi Jin, 2018, NeurIPS.

Bandits With Heavy Tail

Nicolò Cesa-Bianchi, Gábor Lugosi, Sébastien Bubeck, 2012, IEEE Transactions on Information Theory.

Sampling from a Log-Concave Distribution with Projected Langevin Monte Carlo

Sébastien Bubeck, Ronen Eldan, Joseph Lehec, 2015, Discrete & Computational Geometry.

Optimal Algorithms for Non-Smooth Distributed Optimization in Networks

Laurent Massoulié, Yin Tat Lee, Sébastien Bubeck, 2018, NeurIPS.

Online Optimization in X-Armed Bandits

Csaba Szepesvári, Rémi Munos, Sébastien Bubeck, 2008, NIPS.

Multiple Identifications in Multi-Armed Bandits

Sébastien Bubeck, Tengyao Wang, Nitin Viswanathan, 2012, ICML.

Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing

Nikhil R. Devanur, Sébastien Bubeck, Rad Niazadeh, 2019, J. Mach. Learn. Res..

An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time

Yin Tat Lee, Yuanzhi Li, Sébastien Bubeck, 2018, STOC.

Regret in Online Combinatorial Optimization pdf

Gábor Lugosi, Sébastien Bubeck, Jean-Yves Audibert, 2012, Math. Oper. Res..

Optimal discovery with probabilistic expert advice

Damien Ernst, Aurélien Garivier, Sébastien Bubeck, 2011, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

Competitively chasing convex bodies

Yin Tat Lee, Yuanzhi Li, Sébastien Bubeck, 2018, STOC.

Minimax Policies for Combinatorial Prediction Games

Gábor Lugosi, Sébastien Bubeck, Jean-Yves Audibert, 2011, COLT.

Bandit Convex Optimization: $\sqrt{T}$ Regret in One Dimension pdf

Yuval Peres, Sébastien Bubeck, Ofer Dekel, 2015, COLT.

Network size and size of the weights in memorization with two-layers neural networks

Yin Tat Lee, Sébastien Bubeck, Ronen Eldan, 2020, NeurIPS.

Kernel-based Methods for Bandit Convex Optimization

Sébastien Bubeck, Ronen Eldan, Yin Tat Lee, 2021, J. ACM.

Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing

Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, 2021, SIAM J. Comput..

Jeux de bandits et fondations du clustering

Sébastien Bubeck, 2010 .

Multi-scale Online Learning and its Applications to Online Auctions

Nikhil R. Devanur, Sébastien Bubeck, Rad Niazadeh, 2017 .