Sébastien Bubeck

{{Short description|French-American mathematician and computer scientist}}

{{Infobox person

| name = Sébastien Bubeck

| image = Sebastien Bubeck CHM Mountain View March 2025.jpg

| birth_date = {{bda|1985|4|16}}

| occupation = Computer scientist

| employer = OpenAI

| alma_mater = École normale supérieure Paris-Saclay

| known_for = {{unbulleted list |Former Microsoft's Vice President of Applied Research | Sloan Research Fellowship in Computer Science in 2015 and Best Paper Awards at the Conference on Learning Theory (COLT) in 2016}}

| notable_works = Minimax rate for multi-armed bandits, etc.

}}

Sébastien Bubeck (born April 16, 1985){{Cite web |url=https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/ResumeBubeck.pdf |title=Sébastien Bubeck Resume |access-date=December 22, 2024 |publisher=Microsoft Research |archive-url=https://web.archive.org/web/20240428043630/https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/ResumeBubeck.pdf |archive-date=April 28, 2024}} is a French-American computer scientist and mathematician. He was Microsoft's Vice President of Applied Research and led the Machine Learning Foundations group at Microsoft Research Redmond. Bubeck was formerly professor at Princeton University and a researcher at the University of California, Berkeley.{{Cite web |title=Sébastien Bubeck at Microsoft Research |url=https://www.microsoft.com/en-us/research/people/sebubeck/ |access-date=2022-11-20 |website=Microsoft Research |language=en-US}} He is known for his contributions to online learning, optimization and more recently studying deep neural networks, and in particular transformer models. Since 2024, he works for OpenAI.

Work

Bubeck's work spans a wide variety of topics in machine learning, theoretical computer science and artificial intelligence. Some of his most notable contributions include developing minimax rate for multi-armed bandits, linear bandits, developing an optimal algorithm for bandit convex optimization, and solving long-standing problems in k-server and metrical task systems. In regards to the mathematical theory of neural networks, Bubeck has both introduced and proved the law of robustness which links the number of parameters of a neural network and its regularity properties.{{Cite news |last=Rorvig |first=Mordechai |date=February 10, 2022 |title=Computer Scientists Prove Why Bigger Neural Networks Do Better |work=Quanta Maganize |url=https://www.quantamagazine.org/computer-scientists-prove-why-bigger-neural-networks-do-better-20220210/}}{{Cite journal |last=Ananthaswamy |first=Anil |date=2023-03-08 |title=In AI, is bigger always better? |url=https://www.nature.com/articles/d41586-023-00641-w |journal=Nature |language=en |volume=615 |issue=7951 |pages=202–205 |doi=10.1038/d41586-023-00641-w|pmid=36890378 |bibcode=2023Natur.615..202A }} Bubeck has also made contributions to convex optimization, network analysis, and information theory. Bubeck's papers have over 25,000 citations to date.{{Cite web |title=Sebastien Bubeck |url=https://scholar.google.com/citations?user=V2Y1L4sAAAAJ&hl=en |access-date=2025-05-05 |website=Google Scholar}}

Prior to joining Microsoft Research, Bubeck was an assistant professor at Princeton University in the Department of Operations Research and Financial Engineering. He received his PhD from the Lille 1 University of Science and Technology, and also studied at the Ecole Normale Supérieure de Cachan.

Bubeck is the author of the book Convex optimization: Algorithms and complexity (2015).{{Cite journal |last=Bubeck |first=Sébastien |date=2015-11-01 |title=Convex Optimization: Algorithms and Complexity |url=https://doi.org/10.1561/2200000050 |journal=Foundations and Trends in Machine Learning |volume=8 |issue=3–4 |pages=231–357 |doi=10.1561/2200000050 |arxiv=1405.4980 |issn=1935-8237}} He has also been on the editorial board of several scientific journals and conferences, including the Journal of the ACM{{Cite web |title=JOURNAL OF THE ACM Editorial Board |url=https://dl.acm.org/journal/jacm/editorial-board?doi=10.1145/jacm |access-date=2022-12-01 |website=Journal of the ACM | doi= |language=en}} and Neural Information Processing Systems (NeurIPS) and was program committee chair for the 2018 Conference on Learning Theory (COLT){{Cite web |title=dblp: COLT 2018 |url=https://dblp.org/db/conf/colt/colt2018.html |access-date=2022-12-01 |website=dblp.org |language=en}}

In 2023, Bubeck and his collaborators published a paper that claimed to observe "sparks of artificial general intelligence" in an early version of GPT-4, a large language model developed by OpenAI. The paper presented examples of GPT-4 performing tasks across various domains and modalities, such as mathematics, coding, vision, medicine, and law. The paper sparked wide interest and debate in the scientific community and the popular media, as it challenged the conventional understanding of learning and cognition in AI systems.{{Cite arXiv |last1=Bubeck |first1=Sébastien |last2=Chandrasekaran |first2=Varun |last3=Eldan |first3=Ronen |last4=Gehrke |first4=Johannes |last5=Horvitz |first5=Eric |last6=Kamar |first6=Ece |last7=Lee |first7=Peter |last8=Lee |first8=Yin Tat |last9=Li |first9=Yuanzhi |last10=Lundberg |first10=Scott |last11=Nori |first11=Harsha |last12=Palangi |first12=Hamid |last13=Ribeiro |first13=Marco Tulio |last14=Zhang |first14=Yi |date=2023-04-13 |title=Sparks of Artificial General Intelligence: Early experiments with GPT-4 |class=cs.CL |eprint=2303.12712 }}{{Cite magazine |last=Knight |first=Will |title=Some Glimpse AGI in ChatGPT. Others Call It a Mirage |language=en-US |magazine=Wired |url=https://www.wired.com/story/chatgpt-agi-intelligence/ |access-date=2023-05-03 |issn=1059-1028}}{{Citation |title=Sparks of AGI: early experiments with GPT-4 | date=6 April 2023 |url=https://www.youtube.com/watch?v=qbIk7-JPB2c |access-date=2023-05-03 |language=en}}{{Cite news |last=Metz |first=Cade |date=2023-05-16 |title=Microsoft Says New A.I. Shows Signs of Human Reasoning |language=en-US |work=The New York Times |url=https://www.nytimes.com/2023/05/16/technology/microsoft-ai-human-reasoning.html |access-date=2023-07-03 |issn=0362-4331}}{{Cite web |title=ZEIT ONLINE {{!}} Lesen Sie zeit.de mit Werbung oder im PUR-Abo. Sie haben die Wahl. |url=https://www.zeit.de/zustimmung?url=https%3A%2F%2Fwww.zeit.de%2Fdigital%2F2023-04%2Fchatgpt-kuenstliche-intelligenz-forschung |access-date=2023-07-03 |website=www.zeit.de}}{{Cite web |date=2023-06-15 |title=Greetings, People Of Earth |url=https://www.thisamericanlife.org/803/greetings-people-of-earth |access-date=2023-07-03 |website=This American Life}} Bubeck also investigated the potential use of GPT-4 as an AI chatbot for medicine in a paper that evaluated the strengths, weaknesses, and ethical issues of relying on such a tool for medical purposes{{Cite journal |last1=Lee |first1=Peter |last2=Bubeck |first2=Sebastien |last3=Petro |first3=Joseph |date=2023-03-30 |title=Benefits, Limits, and Risks of GPT-4 as an AI Chatbot for Medicine |url=https://pubmed.ncbi.nlm.nih.gov/36988602/ |journal=The New England Journal of Medicine |volume=388 |issue=13 |pages=1233–1239 |doi=10.1056/NEJMsr2214184 |issn=1533-4406 |pmid=36988602|s2cid=257803472 }}

In October 2024, Bubeck left Microsoft to join OpenAI.{{Cite news |last=Bass |first=Dina |date=2024-10-13 |title=Microsoft Artificial Intelligence VP Bubeck to Join OpenAI |url=https://www.bloomberg.com/news/articles/2024-10-14/microsoft-artificial-intelligence-vp-bubeck-to-join-openai |publisher=Bloomberg News}}

Honors and awards

Bubeck has received numerous honors and awards for his work, including the Alfred P. Sloan Research Fellowship in Computer Science in 2015,{{Cite web |title=Bubeck Wins Sloan Research Fellowship |url=https://orfe.princeton.edu/news/2015/bubeck-wins-sloan-research-fellowship |access-date=2022-11-20 |website=Operations Research & Financial Engineering |language=en}} and Best Paper Awards at the Conference on Learning Theory (COLT) in 2016,{{Cite web |title=Program |url=https://easychair.org/smart-program/COLT2016/ |access-date=2022-11-20 |website=easychair.org}} Neural Information Processing Systems (NeurIPS) in 2018 and 2021 and in the ACM Symposium on Theory of Computing (STOC) 2023.{{Cite web |title=NIPS 2018 |url=https://nips.cc/Conferences/2018/Awards |access-date=2022-11-20 |website=nips.cc}}{{Cite web |last=Chairs |first=Comms |title=Announcing the NeurIPS 2021 Award Recipients – NeurIPS Blog |date=30 November 2021 |url=https://blog.neurips.cc/2021/11/30/announcing-the-neurips-2021-award-recipients/ |access-date=2022-11-20 |language=en-US}} He has also received the Jacques Neveu prize for the best French PhD in Probability/Statistics,{{Cite web |date=2011-09-06 |title=2010 |url=http://smai.emath.fr/spip.php?article375&lang=fr |access-date=2022-11-20 |website=smai.emath.fr |language=fr}} the runner-up prize in AfIA's 2011 French AI thesis awards,{{Cite web |last= |first= |date= 3 May 2022|title=Lauréats des prix de thèse en Intelligence artificielle |url=https://afia.asso.fr/les-prix-de-these-en-intelligence-artificielle/ |access-date=2022-11-20 |website=AfIA |language=fr-FR}} and one of the two second prizes in the 2010 Gilles Kahn prize for a French PhD in computer science.{{Cite web |title=Lauréat du prix de thèse SPECIF |url=https://www.societe-informatique-de-france.fr/recherche/prix-de-these-gilles-kahn/laureat-specif/ |access-date=2022-11-20 |website=SIF |language=fr-FR}}

Selected publications

  • Minimax policies for adversarial and stochastic bandits (2009), with Jean-Yves Audibert.
  • Best arm identification in multi-armed bandits (2010), with Jean-Yves Audibert and Rémi Munos.
  • Kernel-based methods for bandit convex optimization (2017), with Yin Tat Lee and Ronen Eldan.
  • A universal law of robustness via isoperimetry (2020), with Mark Sellke.
  • K-server via multiscale entropic regularization (2018), with Michael B. Cohen, Yin Tat Lee, James R. Lee, and Aleksander Madry.
  • Competitively chasing convex bodies (2019), with Yin Tat Lee, Yuanzhi Li, and Mark Sellke.
  • Regret analysis of stochastic and nonstochastic multi-armed bandit problems (2012), with Nicolò Cesa-Bianchi.

References