Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.
Charalampos Papamanthou is an Associate Professor of Computer Science at Yale University, where he also serves as Co-director of the Yale Applied Cryptography Laboratory and a member of the Yale Institute for Foundations of Data Science. He holds affiliations with the Yale Center for Algorithms, Data, and Market Design. Additionally, he is Chief Scientist at Lagrange Labs. His research focuses on computer security and applied cryptography, particularly verifiable and privacy-preserving computations, leakage-abuse attacks on searchable encryption, and scalable blockchains/cryptocurrencies. He has advised numerous students and postdocs, and his work is supported by NSF, Protocol Labs, and JP Morgan. Research Interests: His primary areas include cryptographic protocols, privacy-preserving systems, blockchain infrastructure, secure cloud computing, and distributed consensus mechanisms. He has pioneered advancements in zero-knowledge proofs, private information retrieval, and dynamic searchable encryption. Awards: He has received prestigious awards such as the CCS Test-of-Time Award (2022), JP Morgan Faculty Research Award (2022), and NSF CAREER Award (2017). His contributions span over 140 publications in top venues like CRYPTO, CCS, and SODA. Teaching: He has taught advanced courses in cryptography, algorithms, and computer systems security at Yale and previously at the University of Maryland and Brown University. Recently, he chairs Yale’s PhD admissions in Computer Science. Labs & Teams: Leads the Yale Applied Cryptography Lab, focusing on real-world applications of cryptographic research. Collaborates with industry partners like Lagrange Labs to develop privacy-preserving technologies.
Dr. Arno Solin is a tenured Associate Professor in Machine Learning at Aalto University's Department of Computer Science and an Academy of Finland Research Fellow . He leads the Aalto machine learning research group and serves as Director of the Finnish Doctoral Program Network in AI (AI-DOC) . His work bridges probabilistic modeling with practical applications in sensor fusion and real-time inference. ELLIS Scholar (European Laboratory for Learning and Intelligent Systems) Adjunct Professor at Tampere University Member of Young Academy Finland (2021–2025) Research Interests focus on data-efficient machine learning with probabilistic methods for real-time inference and sensor fusion. Key areas include Gaussian processes, diffusion models, stochastic differential equations, and uncertainty quantification in deep learning. His group develops methods that combine structural constraints with adaptive learning for deployment on resource-limited hardware. Publication Trends show consistent output in top venues (NeurIPS, ICML, ICLR, AISTATS) with emphasis on diffusion models , 3D scene reconstruction , and real-time probabilistic modeling . Recent works explore physics-informed learning, heterophily-aware graph models, and compressed representations for world models in reinforcement learning. Scientific Recognition : Awarded AI Researcher of the Year 2024 by AI Finland Teacher of the Year 2023 at Aalto CS ISIF Jean-Pierre Le Cadre Best Paper Award (2018) MLSP Schizophrenia Classification Challenge Winner (2014) NeurIPS/ICML Reviewer Awards Research Leadership includes coordinating Finland's AI Center of Excellence program and directing the Finnish Doctoral Program Network in AI (AI-DOC). He supervises 15+ doctoral/postdoctoral researchers and has spun off Spectacular AI , a company commercializing sensor fusion technology.
Gustavo Alonso is Full Professor at the Department of Computer Science (D-INFK) of ETH Zurich and Head of the Institute for Computing Platforms . He has been at ETH since 1995, first as a post-doc, then as Assistant Professor from April 1998, and promoted to Full Professor in October 2001. Within the Systems Group he leads the Information and Communication Systems Research Group . Education: 1989 – Telecommunications Engineering (undergraduate), Madrid Technical University (UPM-ETSIT), Spain 1992 – M.S. Computer Science, University of California, Santa Barbara (UCSB) 1994 – Ph.D. Computer Science, University of California, Santa Barbara (UCSB) Research Interests: His work spans databases, distributed systems, cloud-computing architecture, FPGAs, hardware acceleration for data science, parallel and reconfigurable computing . The group investigates how modern heterogeneous hardware—from GPUs to SmartNICs—can be integrated into data-processing systems to achieve orders-of-magnitude performance gains, energy savings, and new functionality such as in-network computation and serverless acceleration. Scientific Awards & Honors: Fellow of the ACM (Association for Computing Machinery) Fellow of the IEEE (Institute of Electrical and Electronics Engineers) Distinguished Alumnus, Department of Computer Science, UC Santa Barbara Four Test-of-Time / Most Influential Paper Awards across databases, programming languages, cloud computing, and software engineering Labs & Projects: He directs the Information and Communication Systems Research Group within the Systems Group ( systems.ethz.ch ). The lab develops open-source platforms such as Coyote v2 for FPGA abstractions, Shuhai for HBM benchmarking, and MicroRec for micro-second recommendation serving, while collaborating with industry on SmartNICs, serverless analytics, and cloud-scale data analytics.
Ron Steinfeld is an Associate Professor in the Department of Software Systems & Cybersecurity at Monash University, Australia. He holds editorial roles in Designs Codes and Cryptography (since 2017) and has served on technical committees for top-tier conferences like ASIACRYPT, CRYPTO, and EUROCRYPT. His research focuses on quantum-safe cryptography, lattice-based cryptography, and blockchain security, with over 80 refereed publications and AUD$4M+ in research funding. Education: BSc Mathematics and Physics (Monash University, 1998) BE (Hons., First Class) Electrical and Computer Systems (Monash University, 2000) PhD Computer Science (Monash University, 2003) Research Interests: Design and analysis of cryptographic algorithms, quantum-safe protocols, lattice-based security foundations, and blockchain applications. His work underpins NIST standard algorithms like Kyber and Dilithium through structured lattice problem research. Recent Articles Trends: Focus on privacy-preserving blockchain protocols, post-quantum signature schemes, encrypted data search, and cryptographic applications in adversarial AI. Recent work includes fair Bitcoin watchtower schemes and genomic database privacy solutions. Awards: ASIACRYPT 2015 Best Paper Award Advising & Grants: Supervises PhD projects on quantum-safe cryptography and blockchain security. Leads initiatives like the AUD$4M ARC-funded Quantum Information Technology project. Collaborates with industry partners including CSIRO/Data61. Labs/Teams: Key contributor to Monash’s cybersecurity and cryptography research groups, involving interdisciplinary projects on materials discovery ( Æinstein initiative) and post-quantum blockchain security.
Mark Crowley is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, with a cross-appointment in the Cheriton School of Computer Science. He is a member of the Waterloo Artificial Intelligence Institute (WAII) and the Waterloo Institute for Complexity and Innovation (WICI), and serves as National Secretary of the Canadian Artificial Intelligence Association (CAIAC). His educational background includes a Ph.D. and M.Sc. in Computer Science from the University of British Columbia, where he worked in the Laboratory for Computational Intelligence, and a B.A. in Computer Science from York University. He completed a postdoctoral fellowship at Oregon State University working with Tom Dietterich's machine learning group. Crowley's research focuses on developing dependable and transparent algorithms to augment human decision-making in complex domains with multiple agents, spatial structure, or uncertainty. His work spans Reinforcement Learning , Deep Learning , Ensemble Methods , and Manifold Learning . He frequently collaborates with researchers in applied fields including Computational Sustainability, Sustainable Forest Management, Autonomous Driving, Medical Imaging, and Material Design. His research is motivated by both theoretical opportunities and real-world challenges such as forest fire management, automotive applications, and medical imaging. His recent publications demonstrate a strong focus on addressing challenges in reinforcement learning, particularly around observation costs, multi-agent systems, and causal representation learning. His work on ChemGymRL provides a significant contribution to digital chemistry and material design through reinforcement learning frameworks. The textbook Elements of Dimensionality Reduction and Manifold Learning represents a major contribution to the theoretical foundations of machine learning. Crowley actively supervises graduate students, with recent thesis completions including Shayan Shirahmadi Gale Bagi (PhD, Feb 2025) and Oleksandra Nahorna (MASc, Dec 2024). His lab, UWECEML (Waterloo ECE Machine Learning Lab), focuses on developing new algorithms at the intersection of Machine Learning, Optimization, and Probabilistic Modeling. He teaches courses including ECE 457C (Reinforcement Learning), ECE 657A (Data & Knowledge Modelling & Analysis), and ECE 457B (Fundamentals of Computational Intelligence). His blog Computationally Thinking explores AI, machine learning, and the societal impact of these technologies.
Bradley D. Olsen is a full professor in the Department of Chemical Engineering at the Massachusetts Institute of Technology (MIT), where he leads research at the intersection of polymer science, soft matter physics, and bioengineering. His work focuses on designing materials for critical applications in biotechnology, hemostasis, and sustainable polymer development while advancing fundamental understanding of polymer network mechanics and self-assembly. Education: Ph.D. in Chemical Engineering, University of California Berkeley (2007) S.B. in Chemical Engineering, Massachusetts Institute of Technology (2003) Olsen's research spans protein-based materials, block copolymer phase behavior, and mechanochemical hydrogels. He has pioneered methods for quantifying polymer network topology, developing hemostatic nanoparticles, and creating bio-inspired materials for selective biomolecular transport and medical applications. His recent publications emphasize data-driven approaches to polymer characterization and educational outreach in materials science. Scientific Awards: American Physical Society (APS) Fellow (2023) Fulbright Amazonia Scholar (2023) Alexander and I. Michael Kasser Chair in Chemical Engineering (2021) ACS Macro Letters Young Investigator Award (2021) MIT Committed to Caring Honor (2019) AIChE Owens Corning Early Career Award (2019) APS Dillon Medal (2018) Kavli Emerging Leader in Chemistry (2017) ACS Polymer Division Fellow (2016) Camille Dreyfus-Teacher Scholar (2015) Alfred P. Sloan Research Fellow (2014) NSF Career Grant (2013) NIH Postdoctoral Fellowship (2008-2009) Hertz Fellow (2003-2007) Barry M. Goldwater Scholarship (2002) Olsen has received significant grant support including NSF Career (2013) and AFOSR (2012) awards. His teaching activities include innovative international outreach like the 2025 soccer-themed science camp in Brazil. The Olsen Group at MIT explores advanced materials with applications ranging from trauma care to sustainable polymers.
Tom Rainforth is an Associate Professor of Statistical Machine Learning at the University of Oxford's Department of Statistics, leading the RainML Research Lab (rainml.uk). He holds a Tutorial Fellowship at Mansfield College and is Principal Investigator of the ERC Starting Grant 'Data-Driven Algorithms for Data Acquisition' (2024–2029). Previously, he held roles including a postdoc under Yee Whye Teh (2017–2019), Junior Research Fellow at Christ Church College (2019–2019), and Florence Nightingale Bicentennial Fellow (2020–2024). He earned his MEng in Mechanical Engineering from the University of Cambridge and his D.Phil from Oxford under Frank Wood and Michael Osborne, focusing on probabilistic programming and Monte Carlo methods. He briefly worked in Ferrari's Formula 1 team. Research Interests : Bayesian experimental design, probabilistic and data-efficient machine learning, active learning, deep learning (with a focus on probabilistic approaches), probabilistic programming, and Monte Carlo methods. His work emphasizes statistical efficiency and adaptive algorithms. Publications : Recent contributions span modern Bayesian experimental design, adaptive importance sampling (Daisee), and applications of probabilistic methods in LLMs and generative models. His research bridges theory and practice, addressing challenges in scalability and robustness. Awards : ERC Starting Grant (2024–2029), highlighting his leadership in foundational AI research. Advising & Grants : Supervises 15 graduate students, including work on Bayesian neural networks, generative flows, and experimental design. His ERC grant supports cutting-edge data-driven algorithm development. Labs & Teams : Directs the RainML Lab, which develops scalable Bayesian methods and probabilistic AI systems.
Dr. Liang Cheng is the Department Chair and Professor in the Department of Electrical Engineering and Computer Science at the University of Toledo. He leads a department with ~700 students across CS, CSE, and EE programs. His research focuses on Cyber-Physical Systems (CPS), IoT, AI/ML, and intelligent infrastructure, supported by over $30M in funding from NSF, DOE, DOT, and industry. Notable projects include CPS Breakthrough initiatives and underground sensing systems. He co-edited a multidisciplinary book on Underground Sensing and contributed to smart grid cybersecurity. Dr. Cheng has held leadership roles at Lehigh University, shaping faculty governance and equity policies. His 100+ publications span networking, real-time systems, and sensor networks. He advises on funded projects totaling $30M+ and has pioneered pedagogical approaches in computer science education. Research Interests: Cyber-Physical Systems (CPS): Focuses on autonomous drones, energy systems, and real-time infrastructure Networking: Expertise in TSN, DTN, and wireless protocols Cybersecurity: SCADA systems, PLC attack detection, and blockchain energy modeling Underground Sensing: Geo-sensing via wireless signals and subsurface tomography Grants & Projects: Over 20 sponsored projects including NSF CPS Breakthrough (2018-2023), ABB smart grid projects, and DARPA-funded EDIFY systems. Key contributions include reconfigurable wireless architectures and network calculus tools for real-time systems. Teaching: Courses span senior design, compiler design, parallel computing, and wireless sensor networks. Developed pedagogical patterns for non-CS programming education. Awards: Recognized for leadership in academic governance and interdisciplinary research collaboration.
Aditya Parameswaran is an Associate Professor in the Electrical Engineering and Computer Sciences (EECS) department at the University of California, Berkeley. He co-directs the EPIC Data Lab and the Police Records Access project, focusing on simplifying data science at scale through human-in-the-loop systems, LLM-powered tools, and scalable data systems. His research spans database systems, human-computer interaction, and machine learning, with notable contributions in tools like Lux, Modin, and DataSpread. Education : PhD in Computer Science from Stanford University (2013) BTech in Computer Science and Engineering from IIT Bombay (2007) Research Interests : Parameswaran's work centers on empowering end-users with intuitive data tools. Recent projects include LLM-powered systems for document processing (DocETL, TWIX), proactive data systems, and benchmarking frameworks. He emphasizes democratizing data science through low/no-code solutions and improving production ML workflows. Articles Trends : His recent work (2023–2025) prioritizes LLM integration into data systems, focusing on robust pipelines, assertion generation (SPADE), and debugging tools (RAGGY). Earlier contributions include visualization recommendation (Lux), scalable dataframes (Modin), and spreadsheet optimization (DataSpread). Awards : Recipient of the VLDB Early Career Award (2019), Sloan Research Fellowship (2020), NSF CAREER Award (2017), and multiple best paper/demonstration awards at top venues like SIGMOD and VLDB. Advising & Grants : Guides over 20 PhD/postdoc alumni, many now in academia (e.g., Madelon Hulsebos at CWI) and industry leadership roles. Active in securing grants (e.g., NSF, Army Research Office) and industry partnerships (e.g., Snowflake, LangChain). Labs/Teams : Leads the EPIC Data Lab, focusing on agentic data systems, and co-founded Ponder (acquired by Snowflake). Collaborates on the Police Records Access initiative, building transparency tools for public records.
Zhi Da is the Howard J. and Geraldine F. Korth Chair in Finance and Professor of Finance at the University of Notre Dame , Mendoza College of Business, Department of Finance. He completed his Ph.D. in Finance at Northwestern University’s Kellogg School of Management (2006), preceded by an M.Sc. in Financial Engineering from the National University of Singapore (2001) and a B.B.A. with First-Class Honors (1999) from the same institution. Holding editorial roles at Journal of Finance , Management Science , Review of Financial Studies and several other top journals, he is a leading voice in empirical finance research. Education Ph.D. in Finance, 2006 – Kellogg School of Management, Northwestern University M.Sc. in Financial Engineering, 2001 – National University of Singapore B.B.A. (1st Class Honors), 1999 – National University of Singapore Research Interests Zhi Da’s scholarship sits at the intersection of asset pricing , behavioral finance , and market microstructure . He investigates how investor attention, institutional trading, liquidity frictions, and information flows jointly determine the cross-section of expected returns. His work delves into retail margin trading, the role of pension-fund flows in exchange-rate dynamics, the informational content of SEC filings, and the efficiency of short-selling mechanisms. By combining large-scale data analytics, textual analysis, and structural modeling, he uncovers novel predictors of returns ranging from presidential approval ratings to real-time attention measures. Recent projects explore fractional trading ’s impact on price efficiency, hedging demand as a driver of intraday momentum, and the hidden effort problem in delegated portfolio management. These themes collectively advance our understanding of limits to arbitrage and the formation of extrapolative beliefs. Publication Landscape Spanning 2025 back to 2009, his 15 most recent articles in Journal of Finance , Review of Financial Studies , Management Science , Journal of Financial Economics , and Journal of Financial and Quantitative Analysis converge on three broad motifs: (1) micro-level trading frictions—liquidity costs, margin requirements, and short-selling constraints; (2) macro-finance linkages—exchange rates, fiscal policy, and global capital flows; and (3) information economics—attention allocation, media analytics, and regulatory disclosures. The collective evidence demonstrates that seemingly small trading or informational frictions aggregate into large, persistent cross-sectional return predictability. Honors and Awards 2017 William F. Sharpe Award for Best Paper, Journal of Financial and Quantitative Analysis Lead-article distinctions in Journal of Finance , Review of Financial Studies , and Management Science Featured coverage in SmartMoney and CNBC Teaching & Mentorship At Notre Dame’s Mendoza College, Professor Da teaches Investments (undergraduate and MBA) and Fixed Income Securities , integrating cutting-edge research insights into the curriculum. While specific advisees are not listed, his extensive co-author network (22+ recurring collaborators) attests to a vibrant mentoring environment. Laboratory & Data Resources He publicly distributes the NAT (Net Arbitrage Trading) dataset, a stock-quarter panel of arbitrage positions used in Chen, Da & Huang (2019). This resource has become a standard tool for researchers studying arbitrage capital movements.
Prof. Raffaello D'Andrea is a Full Professor at ETH Zürich's Department of Mechanical and Process Engineering, affiliated with the Institute for Dynamic Systems and Control. His research focuses on bridging digital and physical worlds through robotics, control systems, and autonomous systems. He has pioneered work in aerial robotics, swarm systems, tactile sensing, and soft robotics. His philosophy emphasizes solving 'easy' problems with scalable, robust solutions, prioritizing simplicity and replicability. Key research areas include UAV navigation, distributed control, tactile sensor design, and fault-tolerant systems. He has founded multiple organizations and led roles as CTO/CEO, emphasizing cross-disciplinary innovation. His work has commercial applications in logistics, healthcare, and automation, driven by a belief in technology's role in improving human life. Notable projects include the Cubli robotic cube, aerial vehicle swarms, and optical tactile sensors for robotics. His lab emphasizes collaboration and team leadership, aiming to translate theoretical insights into practical, scalable technologies. Scientific awards: None explicitly listed in the provided texts. Advising and grants: No students listed in the provided texts; grants information not detailed. Labs/Teams: Leads research at ETH Zurich's Institute for Dynamic Systems and Control, collaborating with industry and academic partners globally.
Animesh Garg is an Assistant Professor at the School of Interactive Computing at Georgia Tech, where he leads the People, AI, and Robotics (PAIR) research group . He holds a Senior Researcher position at Nvidia Research and has courtesy appointments at the University of Toronto and Vector Institute. Previously, he served as Chief Scientific Officer at Apptronik (2024-2025) and Senior Staff Research Scientist at Nvidia Research (2018-2024). Education : Ph.D. in Operations Research from UC Berkeley (2011-2016), MS in Computer Science and Industrial Engineering from Georgia Tech and University of Delhi. Research Focus : Building Generalizable Autonomy through Reinforcement Learning , Control Theory , and 3D Vision , with applications in Surgical Robotics , Self-Driving Labs , and Manufacturing . Key Article Themes : His recent work emphasizes Foundation Models for robotics, Differentiable Simulation , Language-Guided Autonomy , and Structured Inductive Biases in sequential decision-making. Scientific Awards : Stephen Fleming Early Career Professorship at Georgia Tech. Teaching : Courses on AI, Deep Reinforcement Learning, and Algorithmic Intelligence in Robotics at Georgia Tech. Labs & Collaborations : Affiliated with Institute for Robotics and Intelligent Machines (IRIM) and ML@GT at Georgia Tech; collaborates intensively with Nvidia Robotics.
Siva Balakrishnan is an Associate Professor at Carnegie Mellon University with a joint appointment in the Department of Statistics and Data Science and the Machine Learning Department . He holds an affiliation with the Dietrich College of Humanities and Social Sciences. Previously, he was a postdoctoral researcher at UC Berkeley's Department of Statistics, advised by Martin Wainwright and Bin Yu, and earned his Ph.D. in Computer Science from CMU's Language Technologies Institute under Jaime Carbonell. His research focuses on statistical machine learning, causal inference, and high-dimensional statistics, with notable contributions to domain adaptation, optimal transport, and robust statistics. Education: Ph.D. in Computer Science, Carnegie Mellon University (Language Technologies Institute) Postdoctoral Researcher, University of California, Berkeley (Department of Statistics) Research Interests: His work bridges theoretical foundations and algorithmic development, emphasizing robust statistical methods and their applications in causal inference, public policy, and machine learning. Key areas include nonparametric methods, optimization, and high-dimensional data analysis. He has pioneered techniques in domain adaptation, such as the RLSbench framework for relaxed label shift scenarios. Awards & Grants: Amazon Research Award (2021) Google Research Scholar Award (2021) NVIDIA Pioneer Award (2018) IMS Lawrence D. Brown Student Award (2020, 2022) National Science Foundation Grants (CCF-1763734, DMS-1713003, etc.) Professional Activities: He serves as an Associate Editor for JASA and on the editorial boards of Foundations and Trends in Statistics . His work has been featured in top venues like NeurIPS, ICML, and the Annals of Statistics. He currently holds a sabbatical at UC Berkeley's Department of Statistics (Spring 2025). Labs & Collaborations: He actively participates in the Statistics and Machine Learning Reading Group and the Causal Inference Working Group , fostering interdisciplinary research in CMU's vibrant academic community.
Kimon Fountoulakis is an Associate Professor at the University of Waterloo. His research focuses on Machine Learning on Graphs and Numerical Optimization, with a strong emphasis on algorithmic methods for graph-structured data. He holds a Ph.D. from The University of Edinburgh (2015), an M.Sc. from The University of Edinburgh (2010), and a B.Sc. from Athens University of Economics and Business (2009). His work spans theoretical foundations and practical applications in graph algorithms, optimization, and machine learning. Research interests include graph neural networks, local graph clustering algorithms, and algorithmic reasoning. His contributions address challenges in graph representation learning, message-passing architectures, and scalable optimization methods. Notable themes in his publications include improving counting abilities of vision-language models, analyzing graph convolutions, and developing flow-based clustering techniques with statistical guarantees. His work often bridges theory and practice, with applications in network analysis, pandemic containment strategies, and high-performance computing. While no specific grants or awards are listed, his research demonstrates significant contributions to graph-based machine learning and optimization. He maintains a research group at the University of Waterloo, with a focus on developing open-source tools and frameworks for graph algorithms. His lab’s work emphasizes local graph clustering methods and their scalability in real-world networks.
