Alina Beygelzimer
Alina Beygelzimer is a machine-learning researcher whose work spans active learning, contextual bandits, online boosting, and memory systems for machine learning. She completed a computer science thesis at Rochester Institute of Technology in 1999 and earned a PhD in computer science from the University of Rochester in 2003. Her papers developed methods for active learning and contextual bandits, algorithms for online boosting and machine-learning memory, and she served as a Program Co-chair for NeurIPS 2021. In 2023 and 2024, she coauthored studies of disagreement in conference reviews and of how authors judge the scientific contribution of their papers. She is a Principal Research Scientist at Yahoo Research and serves on COLT's 2026 Senior Program Committee.
- Links
- Website
Timeline
-
1999–2003
Geometry thesis and PhD
In 1999, she completes a computer science thesis on extremal problems in geometry at Rochester Institute of Technology. She earns a PhD in computer science from the University of Rochester in 2003.
-
2006–2009
Active learning at ICML and IBM
At ICML in 2006, she coauthors “Agnostic Active Learning” with Maria-Florina Balcan and John Langford. In 2009, she coauthors “Importance Weighted Active Learning” with Sanjoy Dasgupta and John Langford; the paper presents a practical, statistically consistent method for learning binary classifiers under general loss functions.
-
2011
A contextual bandit algorithm
In 2011, she coauthors “Contextual Bandit Algorithms with Supervised Learning Guarantees” with John Langford, Lihong Li, Lev Reyzin, and Robert Schapire. The paper presents Exp4.P, an algorithm for contextual-bandit learning with high-probability regret guarantees.
-
2015
An ICML Best Paper
In 2015, she coauthors “Optimal and Adaptive Algorithms for Online Boosting” with Satyen Kale and Haipeng Luo. The paper develops two algorithms that convert weak online learners into strong online learners and receives an ICML Best Paper Award.
-
2019
Contextual Memory Trees
At ICML in 2019, she coauthors “Contextual Memory Trees,” a learning controller that inserts memories into an unbounded experience store. It supports logarithmic-time insertion and retrieval and can augment statistical learning algorithms.
-
2021
NeurIPS program co-chair
At NeurIPS 2021, she is a Program Co-chair and a Senior Research Scientist at Yahoo Research.
-
2023–2024
Two studies of peer review
In 2023, she coauthors a study of the NeurIPS 2021 review process that finds two independent committees disagree on accept-or-reject recommendations for 23% of papers. In 2024, she coauthors a PLOS One study that surveys NeurIPS 2021 authors about predicted acceptance, their rankings of their papers by scientific contribution, and how reviews change their views.
-
As of October 2026
Principal scientist at Yahoo
As of October 2026, she is a Principal Research Scientist at Yahoo Research in New York, where she works on machine learning and algorithms. In 2026, she serves on COLT's Senior Program Committee.
Career
- YahooSenior Research Scientist
Education
- 2003University of RochesterPhD in computer science
- 1999Rochester Institute of Technology
Sources and credits
Photo: We have no published photo of Alina Beygelzimer yet. Send us a free-licensed photo.
- Combinatorial computing approach to selected extremal problems in geometry by Alina Beygelzimer
- KDD 2010: Tutorials
- ICML 2006 Proceedings
- Importance weighted active learning for ICML 2009 - IBM Research
- Contextual Bandit Algorithms with Supervised Learning Guarantees
- Optimal and Adaptive Algorithms for Online Boosting
- Awards | ICML Lille
- Contextual Memory Trees
- OpenReview NeurIPS 2021 Summary Report
- Has the Machine Learning Review Process Become More Arbitrary as the Field Has Grown? The NeurIPS 2021 Consistency Experiment
- How do authors’ perceptions of their papers compare with co-authors’ perceptions and peer-review decisions?
- Alina Beygelzimer
- COLT 2026 - Program Committee
