Idan Attias
Idan Attias is a machine learning theorist who studies the foundations of learning and data-driven sequential decision-making. He earned a PhD in computer science at Ben-Gurion University in 2024, supervised by Aryeh Kontorovich and Yishay Mansour. In 2024, he coauthored a paper on memorization and learning in stochastic convex optimization with Gintare Karolina Dziugaite, Mahdi Haghifam, Roi Livni and Daniel Roy, and ICML named it a Best Paper. His 2026 paper on the hardness of learning regular expressions, written with Lev Reyzin, Nathan Srebro and Gal Vardi, received an Elegance Paper Award at ALT 2026. He is a postdoctoral researcher at the IDEAL Institute in Chicago, hosted by Lev Reyzin, Avrim Blum and Nati Srebro, and will join the Technion's Computer Science Department as a faculty member in 2027.
- Now at
- IDEAL Institute and University of Illinois Chicago
Timeline
-
2019–2022
Generalization bounds for robust learning
With Aryeh Kontorovich and Yishay Mansour, he presents “Improved Generalization Bounds for Adversarially Robust Learning” at ALT 2019. The paper models a learner that must resist an adversary limited to a fixed number of possible corruptions for each input, and its journal version appears in JMLR in 2022.
-
2023
Intern at the Vector Institute
In August 2023, he starts as a research intern at the Vector Institute, working with Daniel Roy and Karolina Dziugaite.
-
2024
A PhD at Ben-Gurion University
He earns a PhD in computer science from Ben-Gurion University in 2024, supervised by Aryeh Kontorovich and by Yishay Mansour of Tel Aviv University and Google Research. His BSc in mathematics and computer science is from Tel Aviv University.
-
2024
An ICML Best Paper
In 2024, he coauthors “Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing” with Gintare Karolina Dziugaite, Mahdi Haghifam, Roi Livni and Daniel M. Roy. ICML 2024 names it a Best Paper, and the work studies how memorization and learning interact in stochastic convex optimization.
-
By 2024
Postdoc at the IDEAL Institute
By September 2024, he is a postdoctoral researcher at the IDEAL Institute, hosted by Lev Reyzin (UIC) and Avrim Blum (TTIC), and works on the foundations of machine learning theory and data-driven sequential decision-making. In 2024, he is also selected as a Rising Star in Data Science (UCSD).
-
2025
Traceability in convex optimization
The 2025 paper “On Traceability in ℓp Stochastic Convex Optimization,” written with Sasha Voitovych, Mahdi Haghifam, Gintare Karolina Dziugaite, Roi Livni and Daniel M. Roy, shows a tradeoff between traceability and excess risk. A learning algorithm is traceable when analyzing its output can identify some of its training samples.
-
2026
Elegance Paper Award at ALT
His paper “On the Hardness of Learning Regular Expressions,” written with Lev Reyzin, Nathan Srebro and Gal Vardi, wins an Elegance Paper Award at ALT 2026. It studies the hardness of improperly learning regular expressions in the PAC model and with membership queries.
-
As of October 2026
Postdoc, then the Technion
He is a postdoctoral researcher at the IDEAL Institute in Chicago and a postdoctoral research associate in UIC's Department of Mathematics, Statistics, and Computer Science, hosted by Lev Reyzin, Avrim Blum and Nati Srebro. He will join the Computer Science Department at the Technion as a faculty member in 2027.
Career
- NowIDEAL InstitutePostdoctoral Researcher
- NowUniversity of Illinois ChicagoPostdoctoral Research Associate
- From 2023Vector InstituteResearch Intern
Education
Sources and credits
Photo: We have no published photo of Idan Attias yet. Send us a free-licensed photo.
- Idan Attias
- [1810.02180] Improved Generalization Bounds for Adversarially Robust Learning
- [Colloquium] 9/20 Talks at TTIC: Idan Attias, IDEAL Institute
- Postdoctoral Research Associate Idan Attias | Dept of Math, Stat, & Comp Sci | University of Illinois Chicago
- ICML 2024 Awards
- Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing
- TTIC Postdoctoral
- [Colloquium] TOMORROW: 12/17 Talks at TTIC: Idan Attias, IDEAL/UIC/TTIC Postdoc
- [2502.17384] On Traceability in ℓp Stochastic Convex Optimization
- On the Hardness of Learning Regular Expressions

