جست‌وجوی استاد و پژوهشگر

• Machine Learning
• Probability
• Mathematical Physics
• +۶ مورد دیگر

Boris Hanin is an Associate Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE) and Associated Faculty at the Program in Applied and Computational Mathematics (PACM). Prior to Princeton, he held academic positions at Texas A&M University (Assistant Professor of Mathematics), MIT (NSF Postdoctoral Fellow), and Northwestern University (PhD in Mathematics under Steve Zelditch). He works part-time at Foundry, an AI/computing startup, leading the Foundry Institute. PhD in Mathematics, Northwestern University NSF Postdoctoral Fellowship, MIT Mathematics Associate Professor, Princeton ORFE Part-Time Leader, Foundry Institute His research spans machine learning, probability theory, and mathematical physics, focusing on neural network theory (approximation power, optimization guarantees), random matrix theory, and spectral asymptotics. He has made foundational contributions to understanding gradient behavior, initialization, and infinite-width limits in deep learning. Boris has supervised numerous PhD students and postdocs, with former members securing prestigious positions at Harvard, MIT, and Huawei. He serves as Associate Editor for journals like Pure and Applied Analysis and Mathematics of Operations Research , and has taught short courses at Oxford, Luxembourg, and Tor Vergata on statistical physics of neural networks and deep learning theory. 2024 Sloan Fellowship in Mathematics NSF CAREER grant DMS-2143754 NSF grant DMS-2133806 His research group collaborates on topics including hyperparameter transfer, architecture-aware scaling, and spectral analysis of random waves and neural networks. He actively contributes to theoretical machine learning through foundational publications in venues like Probability Theory and Related Fields , Journal of Machine Learning Research , and Communications in Mathematical Physics .

Shivaram Kalyanakrishnanمشاهده پروفایل

دانشیار

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

Shivaram Kalyanakrishnan is an Associate Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay , specialising in Artificial Intelligence and Machine Learning . His research spans sequential decision making , multiagent learning , multi-armed bandits , and humanoid robotics , with applications in robot soccer , computer games , and online advertising . He teaches advanced courses like CS 747: Foundations of Intelligent and Learning Agents and CS 748: Advances in Intelligent and Learning Agents , focusing on end-to-end system design and theoretical analysis. His scientific awards include the Best Student Paper Award at RoboCup International Symposium 2006 and nomination for Best Student Paper Award at AAMAS 2007 . His work on reinforcement learning and policy iteration has been published in leading venues such as IJCAI , ICML , and COLT , with recent contributions to railway scheduling and bandit algorithms. While no explicit list of advisees is provided, his research projects and publications suggest mentorship of students in collaborative efforts. Contact : shivaram@cse.iitb.ac.in .

Renjie Fengمشاهده پروفایل

پژوهشگر ارشد

• Probability Theory
• Random Matrix Theory
• Machine Learning
• +۵ مورد دیگر

Renjie Feng is a Research Fellow in Mathematics and AI at the School of Mathematics and Statistics and the Sydney Mathematical Research Institute , University of Sydney. His work bridges probability theory, statistics, and applications in machine learning, deep learning, and artificial intelligence. His research interests focus on probability theory and its applications to machine learning , random matrix theory , and statistical physics . He investigates extreme value problems, spectral properties of random matrices, and topological features of random fields over Riemannian manifolds. Recent publications highlight trends in random matrix theory (GUE, GOE, GSE), extreme gap problems , determinantal point processes , and Wiener chaos . Collaborative works with F. Götze, D. Yao, and R. Adler emphasize U-statistics , multivariate linear statistics , and random topology inspired by Poisson point process studies.

Daniel M. Royمشاهده پروفایل

استاد

• Machine Learning
• Statistics
• Probabilistic Programming
• +۷ مورد دیگر

Daniel M. Roy is a Full Professor at the University of Toronto, with cross-appointments in the Department of Computer Science, Department of Statistical Sciences, and Department of Electrical and Computer Engineering. He serves as Research Director at the Vector Institute and holds the CIFAR Canada AI Chair. Research Focus: Foundational principles of prediction, inference, and decision-making under uncertainty across machine learning, statistics, mathematical logic, applied probability, and computer science. Scientific Contributions: Key work in learning theory, statistical network analysis, probabilistic programming, and information-theoretic frameworks for generalization. Awards: ICML 2024 Best Paper Award for "Information Complexity of Stochastic Convex Optimization" and promotion to Full Professor in 2024. Student Advising: Actively mentors Ph.D. candidates and postdoctoral researchers with strong quantitative backgrounds, particularly at the intersection of machine learning, statistics, and computer science. Email: daniel.roy@utoronto.ca

• Computational Physics
• Machine Learning
• Applied Mathematics
• +۷ مورد دیگر

Andrew M. Stuart is a Professor at the California Institute of Technology's Division of Engineering and Applied Science. His research bridges computational mathematics, machine learning, and physical modeling, focusing on inverse problems, partial differential equations, and multiscale systems. He has pioneered methodologies integrating Gaussian processes, Kalman inversion, and neural operators for scientific computing. His recent publications highlight innovations in competitive protein dimerization networks, nonlinear Bayesian inference, and operator learning. Articles span applications in materials science, geophysics, and biochemical signal processing, emphasizing data-driven discovery of differential equations and scalable algorithms for high-dimensional problems. Stuart's work addresses challenges in structural error modeling, uncertainty quantification, and graph-based learning, with implications for climate modeling and dynamical systems. Despite extensive contributions, the scraped data does not specify students, awards, or contact details.

Imre Leaderمشاهده پروفایل

استاد

• Extremal Combinatorics
• Ramsey Theory
• Combinatorial Number Theory
• +۳ مورد دیگر

Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10

Peter Selingerمشاهده پروفایل

استاد

• Quantum Computing
• Category Theory
• Mathematical Logic
• +۴ مورد دیگر

Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.

John Baillieulمشاهده پروفایل

استاد

• Robotics
• Nonlinear control theory
• Mechanical systems control
• +۶ مورد دیگر

John Baillieul is Distinguished Professor at Boston University with joint appointments in Mechanical Engineering, Systems Engineering and Electrical & Computer Engineering. He directs experimental laboratories for real-time control of lightweight robotic systems and applies nonlinear control theory to complex multi-body, networked, and bio-inspired systems. Education: Ph.D., Harvard University Research Interests: Baillieul’s work spans robotics, nonlinear control, and networked systems. Early contributions resolved motion-planning for kinematically redundant manipulators; current themes include neuromimetic learning, vision-based navigation, and resilience of infrastructure networks such as power grids. His group couples rigorous geometric control with real-time hardware to create lightweight, high-performance robots and to uncover fundamental information limits in feedback systems. Recent Publication Trends (2021-2025): Over the past five years his output has concentrated on three synergistic directions: (i) neuromimetic and Koopman-based data-driven methods for estimating and controlling nonlinear systems, (ii) vision-based guidance and sparse optical-flow primitives for agile autonomous flight, and (iii) network-theoretic decomposition and information-rate studies for resilient operation of power grids and collective dynamics. Honors & Awards: IEEE Fellow 2025 Roger W. Brockett Control Systems Award Former Editor-in-Chief, IEEE Transactions on Automatic Control Affiliations & Service: He is a member of Boston University’s Center for Information and Systems Engineering (CISE), has served as Editor-in-Chief of IEEE Transactions on Automatic Control, and remains active in editorial and organizational roles across the IEEE control systems community.

Jean-François Le Gallمشاهده پروفایل

استاد

• Probability
• Brownian motion
• Lévy processes
• +۸ مورد دیگر

Jean-François Le Gall is a full Professor at Université Paris-Saclay and a member of the Orsay Mathematics Laboratory (LMO) since 2006. He has held prominent positions at Pierre and Marie Curie University (1988-2006) and École Normale Supérieure (1997-2007). A Senior Member of the University Institute of France (2007-2017) and an elected member of the Academy of Sciences since 2013, he served as Vice-President of Research for the Mathematics Department at Orsay (2020–present) and led the ERC Advanced Grant GeoBrown (2017–2023). Education: Ecole Normale Supérieure (1978–1982), PhD in stochastic differential equations (1982), State Doctorate on Brownian motion (1987) Research Interests focus on probability theory , particularly Brownian motion , superprocesses , random trees , planar maps , and their connections to PDEs and geometric models. His work bridges stochastic analysis , branching processes , and coalescence phenomena . Selected Publications include foundational studies on the Brownian map , random geometry , and spatial branching processes . His 2025 paper on The area of spheres in the Brownian plane explores fractal properties of random metric spaces, while the 2020 Growth-fragmentation processes work links Brownian trees to fragmentation models. Scientific Distinctions : 1986 Rollo Davidson Prize 1997 Loève Prize in Probability 2005 Sophie Germain and Fermat Prizes 2019 Wolf Prize in Mathematics 2022 BBVA Frontiers of Knowledge Award Academic Leadership includes directing the Probability and Statistics Team (2013–2019) and the Master 2 in Probability and Statistics (2007–2015). He chairs editorial roles in Grundlehren der mathematischen Wissenschaften (since 2020) and Probability Theory and Related Fields (2005–2010).

Hannah Hogansonمشاهده پروفایل

پژوهشگر ارشد

• Geometric Group Theory
• Low Dimensional Topology
• Mapping Class Groups
• +۴ مورد دیگر

Hannah Hoganson is an NSF Postdoctoral Fellow in the Department of Mathematics at the University of Maryland, mentored by Christian Rosendal after previously holding a Brin Postdoctoral Fellowship under Lei Chen. Her research bridges geometric group theory, low-dimensional topology, and descriptive set theory, with a focus on mapping class groups of infinite-type surfaces and topological groups. Her educational background includes a PhD from the University of Utah (2022) advised by Ken Bromberg, and prior graduate studies at Miami University where she investigated Thompson's groups. She has taught multiple calculus courses at UMD and the University of Utah, receiving exceptional student evaluations for her clarity and supportive teaching style. Hoganson's research explores the coarse geometry of mapping class groups, connections between topological groups and descriptive set theory, and geometric structures on infinite-type surfaces. Her work often combines algebraic, geometric, and topological methods to address fundamental questions about group actions and classification problems in low-dimensional topology. Her recent publications demonstrate a strong trend toward interdisciplinary approaches, integrating geometric group theory with descriptive set theory to analyze infinite-type mapping class groups and Polish groups. Key themes include geometric finiteness, coarse boundedness, and the interplay between algebraic structures and topological dynamics in infinite settings. NSF Postdoctoral Fellowship (DMS-2303365) Brin Postdoctoral Fellowship Hoganson has advised an undergraduate reading course in geometric group theory (Spring 2024) and served as a mentor for REU students at SUMSRI. Her current research is supported by NSF grant DMS-2303365, which funds her postdoctoral work on geometric and topological aspects of infinite-type surfaces and groups. She actively collaborates with researchers including George Domat, Sanghoon Kwak, and Robbie Lyman across multiple projects. She co-organizes the University of Maryland Geometry and Topology Seminar and has co-led specialized workshops including the Big Mapping Class Groups log cabin workshop in Young, AZ (2024) and the AWM special session on Women in Groups, Geometry and Dynamics (2023), fostering collaborative research environments in geometric topology.

Masoud Asgharianمشاهده پروفایل

استاد

• Survival Analysis
• Changepoint Problem
• Nonparametric Bayesian Analysis
• +۵ مورد دیگر

Masoud Asgharian is a Professor in the Department of Mathematics and Statistics at McGill University. His research focuses on survival analysis, changepoint problems, nonparametric Bayesian methods, and data envelopment analysis. He has contributed to influential studies on dementia survival rates, censored data methodologies, and statistical efficiency measures. His work bridges biostatistics and operations research, with applications in public health and medical sciences. Key contributions include methodologies for prevalent cohort survival analysis, input relaxation efficiency measures in stochastic DEA, and causal inference techniques. Asgharian has collaborated extensively with researchers in epidemiology and biomedical engineering, as evidenced by his co-authored publications on topics ranging from tooth enamel properties to low-precision neural network quantization. His research has been published in high-impact journals such as New England Journal of Medicine , Journal of the American Statistical Association , and Biometrics . Current affiliations include leadership roles in statistical research at McGill, with ongoing projects in computational statistics and healthcare analytics.

Thomas Lamمشاهده پروفایل

استاد

• Algebraic Combinatorics
• Total Positivity
• Cluster Algebras
• +۵ مورد دیگر

Thomas Lam is a professor of mathematics at the University of Michigan , specializing in algebraic combinatorics, total positivity, and connections to mathematical physics. His work bridges cluster algebras, positive geometry, and integrable systems, with applications to scattering amplitudes in quantum field theory. Lam has collaborated extensively with physicists such as Nima Arkani-Hamed and mathematicians like Pavlo Pylyavskyy and Mark Shimozono. Key research areas: Cluster algebras, total positivity, electrical networks, positroid varieties, and quantum cohomology. Notable contributions: Defining polypositroids, proving regularity theorems for totally nonnegative flag varieties, and establishing cluster structures in braid varieties. Recent work focuses on positive geometries , including the amplituhedron and moduli spaces of points on projective lines, with implications for particle physics. His articles often explore dual graded graphs, K-theoretic Schubert calculus, and the interplay between combinatorics and algebraic structures. Lam's research has been supported by NSF grants, including DMS-0748636 and DMS-1249708 .

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

استاد

• Graph Algorithms
• Computational Geometry
• Graph Theory
• +۳ مورد دیگر

David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).

Cezary Kaliszykمشاهده پروفایل

استاد

• Automated Reasoning
• Formal Methods
• Formalized Mathematics
• +۷ مورد دیگر

Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.

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.