World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
52
Citations
15103
World Ranking
4991
National Ranking
2318

Research.com Recognitions

  • 2015 - Fellow of Alfred P. Sloan Foundation

Overview

Sébastien Bubeck is affiliated with Microsoft in the United States and has contributed extensively to the field of computer science, with a focus on artificial intelligence and related subfields. Their research encompasses a range of topics that include optimization and search problems, advanced bandit algorithms, complexity and algorithms in graphs, machine learning and algorithms, stochastic gradient optimization techniques, topic modeling, and adversarial robustness in machine learning.

Their recent papers demonstrate an active engagement with developments in artificial general intelligence and medical applications of AI. Among notable works are "Sparks of Artificial General Intelligence: Early experiments with GPT-4" published in 2023 in arXiv (Cornell University), "Benefits, Limits, and Risks of GPT-4 as an AI Chatbot for Medicine" from the same year appearing in the New England Journal of Medicine, "Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone" published in 2024 in arXiv (Cornell University), "Textbooks Are All You Need" from 2023 in arXiv (Cornell University), and "Textbooks Are All You Need II: phi-1.5 technical report" also in 2023 in arXiv (Cornell University).

  • Mark Sellke
  • Ronen Eldan
  • Yuval Rabani
  • Suriya Gunasekar
  • Christian Coester

Bubeck's frequent coauthors include Mark Sellke, Ronen Eldan, Yuval Rabani, Suriya Gunasekar, and Christian Coester.

  • arXiv (Cornell University)
  • SIAM Journal on Computing
  • New England Journal of Medicine
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Journal of the ACM

The main venues for their publications are arXiv (Cornell University), SIAM Journal on Computing, New England Journal of Medicine, Leibniz-Zentrum für Informatik (Schloss Dagstuhl), and the Journal of the ACM.

  • Computer Science

Their primary field of study is Computer Science.

  • Artificial Intelligence
  • Management Science and Operations Research
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition

Within computer science, subfields addressed include Artificial Intelligence, Management Science and Operations Research, Computer Networks and Communications, Computational Theory and Mathematics, and Computer Vision and Pattern Recognition.

  • Optimization and Search Problems
  • Advanced Bandit Algorithms Research
  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms
  • Stochastic Gradient Optimization Techniques
  • Topic Modeling
  • Adversarial Robustness in Machine Learning

The scientist explores topics such as optimization and search problems, advanced bandit algorithms research, complexity and algorithms in graphs, machine learning and algorithms, stochastic gradient optimization techniques, topic modeling, and adversarial robustness in machine learning.

In 2015, Sébastien Bubeck was named a Fellow of the Alfred P. Sloan Foundation.

Best Publications

  • Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems

    Sébastien Bubeck;Nicolò Cesa-Bianchi

  • Convex Optimization: Algorithms and Complexity

    Sébastien Bubeck

  • Best Arm Identification in Multi-Armed Bandits

    Jean-Yves Audibert;Sébastien Bubeck

  • X -Armed Bandits

    Sébastien Bubeck;Rémi Munos;Gilles Stoltz;Csaba Szepesvári

  • Pure exploration in multi-armed bandits problems

    Sébastien Bubeck;Rémi Munos;Gilles Stoltz

  • Is Q-learning Provably Efficient?

    Chi Jin;Zeyuan Allen-Zhu;Sebastien Bubeck;Michael I. Jordan

  • Minimax policies for adversarial and stochastic bandits

    Jean-Yves Audibert;Sébastien Bubeck

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

    Kevin G. Jamieson;Matthew Malloy;Robert D. Nowak;Sébastien Bubeck

  • Pure exploration in finitely-armed and continuous-armed bandits

    Sébastien Bubeck;Rémi Munos;Gilles Stoltz

  • Bandits With Heavy Tail

    Sebastien Bubeck;Nicolo Cesa-Bianchi;Gabor Lugosi

  • Optimal algorithms for smooth and strongly convex distributed optimization in networks

    Kevin Seaman;Francis Bach;Sébastien Bubeck;Yin Tat Lee

  • Regret in Online Combinatorial Optimization

    Jean-Yves Audibert;Sébastien Bubeck;Gábor Lugosi

  • Regret Bounds and Minimax Policies under Partial Monitoring

    Jean-Yves Audibert;Sébastien Bubeck

  • Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers

    Hadi Salman;Jerry Li;Ilya P. Razenshteyn;Pengchuan Zhang

  • Online Optimization in X-Armed Bandits

    Sébastien Bubeck;Rémi Munos;Gilles Stoltz;Csaba Szepesvari

  • The Best of Both Worlds: Stochastic and Adversarial Bandits

    Sébastien Bubeck;Aleksandrs Slivkins

  • Theory of Convex Optimization for Machine Learning.

    Sébastien Bubeck

  • Online Optimization in X-Armed Bandits

    Sébastien Bubeck;Gilles Stoltz;Csaba Szepesvári;Rémi Munos

  • Adversarial examples from computational constraints

    Sébastien Bubeck;Eric Price;Ilya P. Razenshteyn

  • A geometric alternative to Nesterov's accelerated gradient descent

    Sébastien Bubeck;Yin Tat Lee;Mohit Singh

  • Optimal Algorithms for Non-Smooth Distributed Optimization in Networks

    Kevin Scaman;Francis Bach;Sébastien Bubeck;Yin Tat Lee

Frequent Co-Authors

Yin Tat Lee
Yin Tat Lee Microsoft (United States)
Yuanzhi Li
Yuanzhi Li Carnegie Mellon University
Gábor Lugosi
Gábor Lugosi Pompeu Fabra University
Rémi Munos
Rémi Munos French Institute for Research in Computer Science and Automation - INRIA
Jean-Yves Audibert
Jean-Yves Audibert Capital Fund Management (France)
Francis Bach
Francis Bach École Normale Supérieure
Nicolò Cesa-Bianchi
Nicolò Cesa-Bianchi University of Milan
Csaba Szepesvári
Csaba Szepesvári University of Alberta
Aaron Sidford
Aaron Sidford Stanford University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you’re considering a degree in Computer Science, there are many related online programs and pathways to support your goals. Choosing the best degree for your skills and interests is essential, whether you aim to launch your career or pursue in-depth specialization.

For those seeking advanced credentials, some professionals look for the easiest masters degree options to balance work, study, and life commitments. Others may explore doctoral studies, prioritizing affordability by choosing from the cheapest online doctoral programs offered by accredited institutions.

Additionally, if your goal is to earn a doctoral degree as efficiently as possible, consider accelerated programs such as the fastest edd program online. These pathways can help you reach your educational and career milestones more quickly, while still providing valuable knowledge and credentials for the field of Computer Science.

Best Scientists Citing Sébastien Bubeck

Trending Scientists

Recently Published Articles