NIPS Proceedingsβ

Sebastien Bubeck

6 Papers

  • Complexity of Highly Parallel Non-Smooth Convex Optimization (2019)
  • Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers (2019)
  • Is Q-Learning Provably Efficient? (2018)
  • Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (2018)
  • Finite-Time Analysis of Projected Langevin Monte Carlo (2015)
  • Prior-free and prior-dependent regret bounds for Thompson Sampling (2013)