جستجوی استاد راهنمای دانشگاهی

Jason D. Leeمشاهده پروفایل

دانشیار

• Machine Learning
• Deep Learning
• Artificial Intelligence
• +۷ مورد دیگر

Jason D. Lee is an associate professor of Electrical Engineering and Computer Sciences (EECS) and Statistics at the University of California, Berkeley. Previously, he held academic positions at Princeton University as an associate professor, and was a research scientist at Google DeepMind. He completed his Ph.D. in Computational and Mathematical Engineering at Stanford University under the advisement of Trevor Hastie and Jonathan Taylor. For students and collaborators, his primary contact email is jasonlee@princeton.edu, though prospective students and postdocs are asked to include "filter_student" in the subject line. Ph.D., Computational and Mathematical Engineering, Stanford University (2015) B.Sc., Mathematics, Duke University (2010) Lee's research lies at the intersection of machine learning, statistics, and optimization, focusing on the theoretical foundations of artificial intelligence. His work addresses fundamental questions in deep learning, including optimization landscapes, representation learning, and reinforcement learning theory. He has made significant contributions to understanding how gradient descent operates in neural network training and has developed provably efficient algorithms for various learning scenarios. His ten most recent publications represent a diverse yet coherent body of work across machine learning theory, focusing on topics such as Gaussian multi-index models, transformer learning capabilities, shallow neural networks, and optimization techniques. These publications appear in top venues including COLT, ICML, NeurIPS, and JMLR. Among his notable accolades are: Samsung AI Researcher of the Year Award (2023) NSF Career Award (2022) ONR Young Investigator Award (2021) Sloan Research Fellow in Computer Science (2019) NIPS Best Student Paper Award (2016) Princeton Commendation for Outstanding Teaching (ECE538B) Lee has advised numerous students including Alex Damian, Wenhao Zhan, Eshaan Nichani, Tianle Cai, Zixuan Wang, and Yunwei Ren. Former advisees have gone on to positions at institutions like NYU Courant, Facebook AI Research, UW, MIT, Duke, and Microsoft Research. His research group and collaborators span multiple institutions, working on theoretical and applied aspects of machine learning and artificial intelligence, with a particular focus on the optimization and learning dynamics of neural networks and transformer models.

Raman Aroraمشاهده پروفایل

دانشیار

• Machine Learning
• Statistical Signal Processing
• Stochastic Approximation Algorithms
• +۱۶ مورد دیگر

Raman Arora is an Associate Professor in the Department of Computer Science at Johns Hopkins University, with affiliations to the Mathematical Institute for Data Science (MINDS), the Center for Language and Speech Processing (CLSP), and the Institute for Data-Intensive Engineering and Science (IDIES). His research spans theoretical and practical aspects of machine learning, focusing on robustness, privacy, representation learning, and optimization. Research Interests: Machine Learning Theory Representation Learning (e.g., Deep CCA, Multi-view Learning) Privacy-Preserving Machine Learning (Differential Privacy) Robustness in Deep Learning Online and Reinforcement Learning Stochastic Optimization Algorithms His recent publications, primarily in top-tier venues like NeurIPS, ICML, and ICLR, demonstrate a strong focus on the theoretical foundations of adversarial robustness, multi-task learning, offline reinforcement learning, and differentially private optimization. His work often bridges theory and practice, with applications in speech, language, and data-intensive systems. Scientific Awards and Honors: NSF CAREER Award (2020) ICML Test-of-Time Award Finalist (2023) for Deep CCA Member, Institute for Advanced Study (2019–2020) Visiting Scientist, Simons Institute (2019, 2020, 2022) Advising and Grants: Raman Arora has advised numerous PhD and master’s students, many of whom are now researchers at leading tech companies like Google, Meta, and Microsoft. His research is supported by significant grants from the NSF (including CAREER, BIGDATA, TRIPODS, and CRCNS awards), DARPA, and other agencies, focusing on foundational aspects of machine learning such as inductive biases, privacy, robustness, and computational neuroscience. Laboratory and Research Group: He leads a dynamic research group at Johns Hopkins, comprising current PhD students and postdoctoral researchers working on the intersection of theory and applications in machine learning. The group is actively involved in projects related to adversarial robustness, meta-learning, offline reinforcement learning, and private optimization.

Nina Balcanمشاهده پروفایل

استاد

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +۱۲ مورد دیگر

Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.

Catherine Laiمشاهده پروفایل

دانشیار

• Speech and Language Processing
• Computational Linguistics
• Prosody
• +۱۷ مورد دیگر

Catherine Lai is a Reader (~Associate Professor) in the Department of Linguistics and English Language at the University of Edinburgh, with strong affiliations to the Centre for Speech Technology Research (CSTR) and the Institute for Language, Cognition and Computation (ILCC) in the School of Informatics. She is based in the School of Philosophy, Psychology and Language Sciences and is actively involved in research, teaching, and academic service. Department: Department of Linguistics and English Language School: School of Philosophy, Psychology and Language Sciences Research Institutes: Centre for Speech Technology Research, Institute for Language, Cognition and Computation Email: C.Lai@ed.ac.uk Her research centers on the role of prosody—non-lexical aspects of speech—in spoken communication. She investigates how prosody contributes to discourse structure, information structure, and affect in dialogue, using interdisciplinary methods from linguistics and machine learning. Her work bridges theoretical linguistics and practical speech technology, aiming to improve spoken language understanding and synthesis systems. She is particularly interested in how prosody shapes listener expectations and how affect and topic are expressed and perceived in conversation. Her recent publications reflect a strong focus on self-supervised learning in speech models, emotion recognition, ASR error correction using large language models, cognitive state classification, and ethical considerations in language technology. She explores topics such as the uncanny valley in synthetic speech, gender expression through voice, and community-centered development of language technologies. Prize from Scopus Profile Catherine Lai has supervised several PhD students, including Leimin Tian and Yuanchao Li, and has been involved in significant research projects, such as a Toyota-funded initiative on spoken dialogue for robot companions. She has secured multiple grants and leads a research agenda that integrates theoretical inquiry with real-world applications in assistive technologies and social science. Her academic service includes organizing major conferences like Interspeech and UK and Ireland Speech. She is a key member of research teams at CSTR and ILCC, collaborating across disciplines to advance the understanding of spoken communication and the development of robust, ethical speech technologies.

Joan Brunaمشاهده پروفایل

استاد

• Machine Learning
• Deep Learning
• Signal Processing
• +۵ مورد دیگر

Joan Bruna is a Full Professor of Computer Science, Data Science, and affiliated Mathematics at New York University's Courant Institute and Center for Data Science. He leads the CILVR group and co-founded the MaD group. His research focuses on mathematical foundations of machine learning, deep learning, signal processing, and their applications in computational science, climate modeling, and geophysics. He holds a Ph.D. in Applied Mathematics from École Polytechnique and has held roles at UC Berkeley, the Institute for Advanced Study, and the Flatiron Institute. Education: Ph.D. (2013) and M.Sc. (2005) in Applied Mathematics, École Polytechnique and ENS Cachan; dual B.Sc./M.Sc. in Telecommunications and Mathematics from UPC Barcelona (2002–2004). Awards include the NSF CAREER Award (2019) and Alfred P. Sloan Fellowship (2018). Research interests span theoretical aspects of deep learning, optimization, and statistical methods, with applications to climate science and inverse problems. He has advised numerous PhD students and postdocs, contributing to seminal work on scattering networks, geometric deep learning, and neural ODEs. Professional service includes editorial roles at TMLR, JMLR, and TPAMI, plus program chairs for major conferences. His work bridges mathematics and machine learning, emphasizing rigorous analysis and real-world impact.

Tengyu Maمشاهده پروفایل

استادیار

• Machine Learning
• Deep Learning
• Reinforcement Learning
• +۳ مورد دیگر

Tengyu Ma is an Assistant Professor of Computer Science at Stanford University. His research focuses on machine learning, deep learning, optimization, and theoretical computer science. He is particularly known for work on neural networks, reinforcement learning, and algorithmic guarantees in AI systems. His email is tengyuma@stanford.edu . Ma's research interests span foundational aspects of machine learning, including generalization theory, optimization algorithms, and the theoretical underpinnings of deep learning. He has contributed to areas such as self-play theorem provers, learning rate schedules, and robustness in low-light vision tasks. His work often bridges theoretical insights with practical algorithm design. His recent publications emphasize advancements in large language models (LLMs), theorem proving via self-play, and understanding training dynamics in deep networks. Despite prolific output, no specific scientific awards are explicitly mentioned in the provided texts. Ongoing work includes exploring in-context learning mechanisms, formal verification of AI systems, and efficient pretraining techniques. His research has implications for both theoretical understanding and real-world applications of AI.

Jelena Grbicمشاهده پروفایل

استاد

• Topology
• Algebra
• Combinatorics
• +۶ مورد دیگر

Professor Jelena Grbic is a distinguished mathematician serving as Professor of Mathematics within the School of Mathematical Sciences at the University of Southampton since 2012. Her academic journey began with a B.Sc. in Mathematics from the University of Belgrade, Serbia in 1997, followed by a Ph.D. in Algebraic Topology from the University of Aberdeen in 2004. Prior to her current position, she held academic appointments at the University of Manchester (2007-2012) as Lecturer and Senior Lecturer, and at the University of Aberdeen (2004-2006) as Lecturer. Professor Grbic's research spans multiple interconnected domains of pure mathematics, with a primary focus on modern homotopy theory, particularly unstable homotopy theory, and its applications across topology, algebra, and geometry. Her work centers on decompositions and exponent problems in homotopy theory, homotopy aspects of Toric Topology, Hopf algebras, and geometric problems related to cobordisms and string topology. This research bridges abstract mathematical theory with potential applications in data science and computational topology. Analysis of her recent publications (2020-2025) reveals a consistent research trajectory in algebraic topology with increasing interdisciplinary connections. Her work demonstrates sophisticated mathematical techniques applied to complex topological structures, particularly moment-angle complexes and polyhedral products. Notably, her 2022 paper 'Aspects of topological approaches for data science' indicates growing interest in applying topological methods to contemporary data analysis problems, suggesting an expanding research horizon beyond pure mathematics. Professor Grbic actively supervises PhD students, including current student Salvatore Elia in Mathematical Sciences, and teaches modules covering algebraic topology and homotopy theory. She serves as a reviewer for prestigious journals including Homology, Homotopy and Application (2019), Transactions of the London Mathematical Society (2021), and The LMS Newsletter (2017), contributing to the scholarly community through peer review and academic service.

Rina Dechterمشاهده پروفایل

استاد

• Artificial Intelligence
• Machine Learning
• Probabilistic Reasoning
• +۵ مورد دیگر

Rina Dechter is a Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information and Computer Sciences (ICS). She specializes in automated reasoning, probabilistic and constraint-based graphical models, and causal inference. Dechter has held leadership roles, including Co-Editor-in-Chief of Artificial Intelligence since 2011 and editorial board memberships in journals such as the Constraint Journal and Journal of Machine Learning Research . Education : Ph.D., Computer Science, University of California, Los Angeles (UCLA) M.S., Applied Mathematics, Weizmann Institute B.S., Mathematics and Statistics, Hebrew University of Jerusalem Research Interests : Dechter’s work focuses on computational aspects of automated reasoning, constraint processing, probabilistic reasoning, and causal inference. She develops efficient algorithms for graphical models, emphasizing tractable reasoning tasks and anytime search strategies. Her recent projects include causal decision-making frameworks funded by a $5M NSF grant. Awards : Presidential Young Investigator Award (1991) AAAI Fellow (1994) ACP Research Excellence Award (2007) ACM Fellow (2013) Elected to the American Academy of Arts & Sciences (2025) Grants & Collaborations : She leads a multi-institutional NSF-funded project on causal foundations of AI decision-making. Her work emphasizes trustworthiness in AI through causal models, with applications in robotics and public health.

David Bindelمشاهده پروفایل

دانشیار

• Applied Numerical Linear Algebra
• Eigenvalue Problems
• Network Analysis
• +۵ مورد دیگر

David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.

Jakob Schoefferمشاهده پروفایل

استادیار

• Responsible AI
• Explainable AI
• Human-Centered AI
• +۶ مورد دیگر

Jakob Schoeffer is a tenure-track Assistant Professor in the Artificial Intelligence department at the Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence, Faculty of Science and Engineering, University of Groningen (Netherlands). His work focuses on the intersection of human decision-making and artificial intelligence, particularly in high-stakes contexts where fairness, transparency, and appropriate human-AI collaboration are critical. Dr. Schoeffer's research interests center on responsible and explainable AI, with specific focus areas including: Human-AI collaboration dynamics in decision-making processes Fairness perceptions and interventions in AI systems Appropriate reliance on AI recommendations Explainable AI techniques for high-stakes domains Transparency mechanisms that improve human-AI team performance Label indeterminacy issues in medical AI applications His recent publications (2023-2025) reveal a strong trend toward applying AI research in critical domains like healthcare (particularly neurological recovery prediction), while maintaining a rigorous focus on the human aspects of AI deployment. His work spans both theoretical foundations of human-AI interaction and practical implementations, often employing mixed-methods approaches that combine technical AI development with behavioral studies. Dr. Schoeffer actively collaborates with researchers across institutions including the University of Texas at Austin and has made significant contributions to top conferences in AI ethics, fairness, and human-computer interaction. His research has been featured in multiple news outlets and policy discussions, indicating real-world impact of his work on responsible AI development. Prior to his current appointment, Dr. Schoeffer was a Postdoctoral Research Fellow at the University of Texas at Austin. He received his PhD from the Karlsruhe Institute of Technology (KIT) in Germany with a dissertation titled "On the Interplay of Transparency and Fairness in AI-Informed Decision-Making." He also holds a master's degree in Operations Research from Georgia Tech and industry experience as a Senior Data Scientist at IBM.

Daniel A. Spielmanمشاهده پروفایل

استاد

• Spectral Graph Theory
• Algebraic Graph Theory
• Laplacian Matrices
• +۷ مورد دیگر

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

• Cyber Law
• Artificial Intelligence and Law
• Business Law
• +۷ مورد دیگر

Zaklina Spalevic is a distinguished Professor at Singidunum University, specializing in the intersection of law, technology, and business. With a strong academic background in criminal law and extensive research in cyber law, artificial intelligence applications in legal systems, and tourism law, she has established herself as a leading scholar in digital legal frameworks. Her work spans multiple disciplines, connecting traditional legal principles with emerging technological challenges. Dr. Spalevic earned her doctoral degree in Criminal Law from the University of the Academy of Economics in Novi Sad (2008-2012), following basic studies in General Law at the University of Pristina (1996-2001). Her educational foundation in Science and Mathematics from First Pristina High School (1992-1996) provided the analytical basis for her interdisciplinary approach to legal scholarship. Her research interests focus on the evolving landscape of cyber law, particularly the legal implications of artificial intelligence in judicial systems, electronic governance, and tourism industry regulation. Dr. Spalevic has pioneered work on digital evidence processing, algorithmic justice, and the integration of green law principles into sustainable business practices. Her publications reveal a consistent pattern of addressing emerging legal challenges in the digital age, with increasing emphasis on AI applications across various legal domains. Analysis of her recent publications shows a clear trend toward interdisciplinary research that bridges law, technology, and business. Her work increasingly focuses on practical applications of legal frameworks for emerging technologies, particularly in tourism, agriculture, and judicial systems. The integration of technical solutions with legal regulation represents a distinctive feature of her scholarly contributions. Dr. Spalevic has authored numerous publications including three books: 'Fundamentals of Law with Special Reference to Business and Tourism Law' (2021, 2024 editions) and 'Legal Aspects of Cyberspace' (2018). Her extensive publication record includes over 100 journal articles and conference papers spanning cyber security, electronic governance, intellectual property in digital environments, and legal frameworks for emerging technologies. She actively contributes to academic discourse through conference presentations and collaborative research projects, particularly focusing on the legal implications of artificial intelligence across various sectors. Her work demonstrates a commitment to developing practical legal frameworks that address real-world technological challenges while maintaining foundational legal principles.

Nati Srebroمشاهده پروفایل

استاد

• Machine Learning
• Optimization
• Deep Learning
• +۴ مورد دیگر

Nati Srebro is a Professor at the Toyota Technological Institute at Chicago with a cross-appointment as a Part-Time Professor in the Department of Computer Science and Committee on Computational and Applied Mathematics at the University of Chicago. He earned his PhD from MIT in 2004 and has held previous positions including post-doctoral fellow at the University of Toronto, Visiting Scientist at IBM, and Associate Professor at the Technion. Professor Srebro's research focuses on methodological, statistical and computational aspects of Machine Learning and Optimization. His work spans foundational contributions to learning theory, matrix reconstruction, and optimization techniques. He is particularly known for introducing the use of nuclear norm for machine learning, work on wider Markov networks, and advancing our understanding of the relationship between learning and optimization. His current research interests include understanding deep learning through optimization, distributed and federated learning systems, algorithmic fairness, and practical adaptive data analysis. His publication record shows consistent contributions to core machine learning conferences and workshops, with recent work focusing on symmetric and asymmetric hashing techniques, matrix parameter learning, and optimization methods. The publications demonstrate a strong theoretical foundation with practical applications across various machine learning domains. Professor Srebro has been actively involved in several research programs including the Federated and Collaborative Learning program (Spring 2026, as Visiting Scientist and Program Organizer), Modern Paradigms in Generalization (Fall 2024), and multiple summer clusters on Deep Learning Theory and Fairness. His program participation reflects his leadership in emerging areas of machine learning research. Contact: nati@ttic.edu | (773) 834-7493 | Toyota Technological Institute at Chicago, 6045 S. Kenwood Ave., Chicago, IL 60637

Michael U. Gutmannمشاهده پروفایل

مدرس ارشد

• Machine Learning
• Bayesian Inference
• Likelihood-Free Inference
• +۹ مورد دیگر

Michael U. Gutmann is a Senior Lecturer in Machine Learning at the School of Informatics, University of Edinburgh, and a member of the Institute for Adaptive and Neural Computation. His research lies at the intersection of machine learning, statistics, and scientific applications, with a focus on developing inference methods for complex and implicit models. Education: PhD in Computational Neuroscience, University of Tokyo MSc in Engineering and Applied Mathematics, Swiss Federal Institute of Technology (ETH) Zurich MSc, Ecole Centrale Paris His primary research interests include Bayesian inference, likelihood-free inference, optimal experimental design, unsupervised learning, and applications in computational biology and neuroscience. He is best known for introducing Noise-Contrastive Estimation (NCE), a foundational technique for training unnormalized statistical models. His recent work spans variational inference, density ratio estimation, flow models for missing data, and AI-driven experimental design in behavioral and biological sciences. His publications, including in NeurIPS , ICML , JMLR , and eLife , demonstrate a strong emphasis on methodological innovation for scientific discovery. He has contributed to open-source tools such as ELFI (Engine for Likelihood-Free Inference) and developed practical implementations of robust inference algorithms. Scientific Awards: No specific awards listed in the provided texts. Michael Gutmann actively supervises students and collaborates with leading researchers in machine learning and computational biology. He has secured research funding from EPSRC and BBSRC for projects in generative modeling and infectious disease epidemiology. He teaches advanced courses such as Probabilistic Modelling and Reasoning and Data Mining, reflecting his deep engagement with both theoretical and applied aspects of machine learning. Labs and Research Groups: Institute for Adaptive and Neural Computation (ANC), University of Edinburgh Former affiliations with Department of Mathematics and Statistics and Department of Computer Science at the University of Helsinki and Aalto University

Sanjay Jainمشاهده پروفایل

استاد

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +۳ مورد دیگر

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.