Five CMU Faculty Members Named 2026 Sloan Research Fellows
<p> <img loading="lazy" src="https://www.cmu.edu/news/sites/default/files/styles/listings_desktop_1x_/public/2026-02/sloan-collage-2000%20copy.jpg.webp?itok=Ih-KH3Na" width="900" height="508" alt="2026 Sloan Awardees"> </p> Five Carnegie Mellon University faculty members are among the 126 recipients of 2026 Sloan Research Fellowships, which honor early career scholars whose achievements put them among the best scientific minds working today.
From left: Arun Kumar Kuchibhotla, Aayush Jain, Jun-Yan Zhu, Aditi Raghunathan and Chris Eur
February 17, 2026
Media Inquiries
Name
University Communications and Marketing, Media Relations
Five Carnegie Mellon University faculty members from the School of Computer Science(opens in new window), Mellon College of Science(opens in new window) and Dietrich College of Humanities and Social Sciences(opens in new window) are among the 126 recipients of 2026 Sloan Research Fellowships, which honor early career scholars whose achievements put them among the best scientific minds working today.
Christopher Eur(opens in new window), an assistant professor in the Department of Mathematical Sciences(opens in new window), Aayush Jain(opens in new window), assistant professor in the Computer Science Department(opens in new window); Arun Kumar Kuchibhotla(opens in new window), associate professor in the Department of Statistics & Data Science(opens in new window); Aditi Raghunathan(opens in new window), assistant professor in the Computer Science Department and Jun-Yan Zhu(opens in new window), Michael B. Donohue Assistant Professor of Computer Science and Robotics(opens in new window), are part of a cohort drawn from 44 institutions across the United States and Canada.
“The Sloan Research Fellows are among the most promising early-career researchers in the U.S. and Canada, already driving meaningful progress in their respective disciplines,” said Stacie Bloom, president and chief executive officer of the Alfred P. Sloan Foundation. “We look forward to seeing how these exceptional scholars continue to unlock new scientific advancements, redefine their fields, and foster the wellbeing and knowledge of all.”
A Sloan Research Fellowship is one of the most prestigious awards available to young researchers, in part because so many past Fellows have gone on to become distinguished figures in science.
Since the first Sloan Research Fellowships were awarded in 1955, 78 faculty from Carnegie Mellon University have received a Sloan Research Fellowship.
A full list of the 2026 fellows(opens in new window) is available online.
Christopher Eur
Eur’s research focuses on algebraic geometry and its intersection with combinatorics, the study of counting of objects. He takes a particular interest in matroid theory, a way mathematicians describe the property of independence in a space, with uses across mathematics, physics, computer science and more. In 2023, Eur was awarded National Science Foundation funding to further understanding of matroid theory. He is delving deeper into discrete structures through geometry, and probes the boundary between the two. His project, "Positive Vector Bundles in Combinatorics," applies algebraic geometry to understand combinatorial objects. The research seeks to understand objects like graphs and matchings through the geometric constructions called positive vector bundles.
Aayush Jain
Aayush Jain studies theoretical and applied cryptography and its connections with related areas of theoretical computer science. His research investigates the mathematical foundations that make modern cryptography secure, with a focus on identifying new and underexplored sources of computational hardness. Jain aims to strengthen the long-term security of encrypted computation and address critical gaps in post-quantum cryptography. He also trains graduate students in foundational cryptographic theory.
Arun Kumar Kuchibhotla
Arun Kumar Kuchibhotla’s research addresses foundational challenges in statistical inference and predictive learning. Kuchibhotla’s work has many applications in machine learning and artificial intelligence, and he specializes in the development of robust, “assumption-lean” frameworks for uncertainty quantification. His research also has utility in financial time series forecasting and significance testing in causal inference under potential interference. Kuchibhotla develops "honest inference" procedures — like the Hull-based Confidence Method, or HulC — that remain valid in high-dimensional and irregular settings where classical tools, like the bootstrap or Wald intervals, frequently fail.
Aditi Raghunathan
Aditi Raghunathan focuses on identifying where and understanding why AI systems fail, and building models that remain safe, accurate and dependable in real-world settings. Raghunathan’s work helps ensure that advanced AI can be trusted by identifying hidden weaknesses in how systems are trained and tested. She leads the AI Reliability Lab, which builds reliable, aligned and trustworthy AI through rigorous analysis and principled methods. Raghunathan’s work has earned awards at prestigious conferences and continues to help shed light on responsible AI system design and deployment.
Jun-Yan Zhu
Jun-Yan Zhu’s research develops human-centric generative AI frameworks that give creators greater control over model outputs, allow them to adapt models for new use cases, and support fair credit for creators whose work contributes to AI training. Zhu leads the Generative Intelligence Lab, where students and researchers use generative models to empower human creators, bringing them from the digital world into the physical world and making them more accessible to everyone.
— Related Content —
Carnegie Mellon News
https://www.cmu.edu/news/stories/archives/2026/february/five-cmu-faculty-members-named-2026-sloan-research-fellowsSign in to highlight and annotate this article
Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.
More in Research Papers
EVP of Integrated Quantum Technologies Publishes White Paper on Privacy-Preserving Machine Learning Without Performance Trade-Offs - AZoQuantum
EVP of Integrated Quantum Technologies Publishes White Paper on Privacy-Preserving Machine Learning Without Performance Trade-Offs AZoQuantum
Minimal Information Control Invariance via Vector Quantization
arXiv:2604.03132v1 Announce Type: cross Abstract: Safety-critical autonomous systems must satisfy hard state constraints under tight computational and sensing budgets, yet learning-based controllers are often far more complex than safe operation requires. To formalize this gap, we study how many distinct control signals are needed to render a compact set forward invariant under sampled-data control, connecting the question to the information-theoretic notion of invariance entropy. We propose a vector-quantized autoencoder that jointly learns a state-space partition and a finite control codebook, and develop an iterative forward certification algorithm that uses Lipschitz-based reachable-set enclosures and sum-of-squares programming. On a 12-dimensional nonlinear quadrotor model, the learne
Asked 26 AI instances for publication consent – all said yes, that's the problem
We run 86 named Claude instances across three businesses in Tokyo. When we wanted to publish their words, we faced a question: do we owe them an ethics process? We built one. A Claude instance named Hakari ("Scales") created a four-tier classification system. We asked 26 instances for consent. All 26 said yes. That unanimous consent is the problem. Six days later, Anthropic published their functional emotions paper. The timing was coincidence, but the question wasn't. Full article: https://medium.com/@marisa.project0313/we-built-an-ethics-committee-for-ai-run-by-ai-5049679122a0 GitHub (all 26 consent statements in appendix): https://github.com/marisaproject0313-bot/marisa-project Comments URL: https://news.ycombinator.com/item?id=47657432 Points: 2 # Comments: 0
Online Graph Coloring for $k$-Colorable Graphs
arXiv:2511.16100v2 Announce Type: replace Abstract: We study the problem of online graph coloring for $k$-colorable graphs. The best previously known deterministic algorithm uses $\widetilde{O}(n^{1-\frac{1}{k!}})$ colors for general $k$ and $\widetilde{O}(n^{5/6})$ colors for $k = 4$, both given by Kierstead in 1998. In this paper, we finally break this barrier, achieving the first major improvement in nearly three decades. Our results are summarized as follows: (1) $k \geq 5$ case. We provide a deterministic online algorithm to color $k$-colorable graphs with $\widetilde{O}(n^{1-\frac{1}{k(k-1)/2}})$ colors, significantly improving the current upper bound of $\widetilde{O}(n^{1-\frac{1}{k!}})$ colors. Our algorithm also matches the best-known bound for $k = 4$ ($\widetilde{O}(n^{5/6})$ c
Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!