Anders Søgaard is a Professor at the University of Copenhagen , affiliated with both the Department of Computer Science and the Department of Communication. His research bridges Natural Language Processing and Machine Learning with a focus on AI ethics , explainability , and human-AI interaction . Primary Affiliation: Department of Computer Science, University of Copenhagen Secondary Affiliation: Department of Communication, University of Copenhagen Email: soegaard@di.ku.dk, soegaard@hum.ku.dk Research Interests His work spans Natural Language Processing , Machine Learning , and AI ethics , with recent studies addressing: Trustworthiness in AI systems Explainable AI (XAI) frameworks Multilingual model fairness and alignment Human-AI collaboration in reasoning tasks Ethical implications of social robots Mental health analytics using ML Recent Publications His 2025 output highlights trends in: AI ethics (e.g., fairness metrics, trustworthy systems) Multilingual model analysis (knowledge retention, cross-lingual transfer) Human-centric AI (gaze data, cultural considerations) Applications in healthcare and social good
Amartya Sanyal is a Tenure Track Assistant Professor at the Department of Computer Science (DIKU), University of Copenhagen, specializing in Machine Learning. He also serves as an Adjunct Professor at the Indian Institute of Technology Kanpur (2023–2025). His research focuses on critical areas of AI safety, data privacy, and robust learning. University: University of Copenhagen Department: Department of Computer Science Academic Rank: Assistant Professor Adjunct Role: IIT Kanpur (2023–2025) His work addresses challenges like differential privacy , data poisoning attacks , machine unlearning , and robust mixture learning . Recent publications analyze privacy-preserving techniques for large language models, fairness in collective action algorithms, and certified data release mechanisms. Amartya has received the Villum Young Investigator Award (2025). His research outputs emphasize online learning , adversarial robustness , and privacy-utility tradeoffs through rigorous theoretical frameworks and practical implementations. Scientific Award: Villum Young Investigator Award His collaborations span institutions like IIT Kanpur and involve interdisciplinary projects with industry partners. Current activities include talks on privacy with correlated data and machine unlearning advancements.
Fatma Kılınç-Karzan is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business, with a courtesy appointment as Associate Professor of Computer Science. She is also affiliated with the Algorithms Combinatorics and Optimization (ACO) PhD Program and was a Visiting Scientist at Berkeley's Simons Institute for the Theory of Computing during Fall 2017. Her educational background includes a PhD from Georgia Institute of Technology's H. Milton Stewart School of Industrial & Systems Engineering with a minor in Mathematics, supervised by Prof. Arkadi Nemirovski. She earned her B.S. and M.S. degrees from the Industrial Engineering Department of Middle East Technical University with a minor in Information Systems. Dr. Kılınç-Karzan's research spans mathematical optimization with emphasis on convex and non-convex optimization theory, algorithms, and applications. Her work bridges theoretical foundations with practical implementations in optimization under uncertainty (robust optimization, chance constraints, distributionally robust optimization), machine learning (preference learning from limited data), and business analytics. She develops foundational theory for large-scale optimization problems with applications in decision making under uncertainty and high-dimensional statistical inference. Analysis of her recent publications reveals a strong focus on convex hull characterizations, semidefinite programming relaxations, distributionally robust optimization, and online convex optimization frameworks. Her work demonstrates increasing integration of optimization theory with machine learning applications, particularly in developing data-driven approaches for decision making under uncertainty. NSF CAREER Award (2015) INFORMS Optimization Society Young Researcher Prize (2015) INFORMS Junior Faculty Interest Group (JFIG) Best Paper Award (2014) BP Junior Faculty Chair (2014-2015) Faculty Giving Chair (2012-2013) Wimmer Fellowship (2012-2013) Dr. Kılınç-Karzan has successfully mentored numerous PhD students who have received prestigious awards, including the 2021 INFORMS Optimization Society Best Student Paper (1st prize) and multiple honorable mentions. Her research has been supported by significant grants including an NSF CAREER Award, an ONR grant (with S. Küçükyavuz), and an AFOSR grant. She serves on editorial boards for Mathematical Programming, Operations Research, Mathematics of Operations Research, and other leading journals, and has held leadership positions in professional societies including the Mathematical Optimization Society and INFORMS Computing Society. Through her affiliations with CMU's Tepper School, Computer Science Department, and ACO Program, she collaborates across disciplines to advance optimization theory and its applications. Her professional service includes committee chair roles for major INFORMS competitions and program committee leadership for international optimization conferences.
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.
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.
I-Hong Hou is a Professor in the Department of Electrical and Computer Engineering at Texas A&M University, part of the College of Engineering. He holds a B.S. in Electrical Engineering from National Taiwan University (2004), and M.S./Ph.D. in Computer Science from the University of Illinois, Urbana-Champaign (2008/2011). His research focuses on wireless networks, cloud/edge computing, and machine learning with notable contributions to real-time systems and network optimization. Education : B.S., Electrical Engineering, National Taiwan University, 2004 M.S., Computer Science, University of Illinois at Urbana-Champaign, 2008 Ph.D., Computer Science, University of Illinois at Urbana-Champaign, 2011 Research Highlights : Hou’s work emphasizes Age of Information (AoI) , distributed learning, and scheduling algorithms for edge computing. He has pioneered frameworks integrating machine learning with network protocols, such as deep reinforcement learning for restless bandits and second-order optimization for wireless systems. His methods address real-time communication challenges in multi-hop networks and dynamic environments. Awards : Best Paper Awards at ACM MobiHoc (2017, 2020) Best Student Paper, WiOpt 2017 C.W. Gear Outstanding Graduate Student Award, UIUC Advising & Grants : Advised PhD student Siqi Fan (graduated 2024). His research has been supported by grants exploring edge-cloud reconfiguration, real-time video delivery, and neural Whittle index networks. Recent work includes optimizing freshness of information in multi-user systems and developing threshold-optimal policies for complex decision-making. Labs/Teams : Leads the Computer Engineering and Systems Group (CESG) at Texas A&M, collaborating on projects blending networking, machine learning, and distributed systems.
Nihar B. Shah is an Associate Professor at Carnegie Mellon University with joint appointments in the Machine Learning and Computer Science departments within the School of Computer Science. His research focuses on developing theoretically grounded algorithms for evaluating scientific work, with applications in peer review, fairness, and human-AI collaboration. His work has impacted over 100,000 research papers and grant evaluations. Education: Ph.D. in EECS, UC Berkeley M.E. in Telecommunications, Indian Institute of Science B.Tech. in Electronics, NIT Karnataka Research Interests: Shah's group investigates the science of evaluation through machine learning, optimization, and large-scale experiments. Key areas include peer review systems, algorithmic fairness, LLM applications in science, and human-AI collaboration frameworks. Research addresses fundamental questions about research validity, funding allocation, and equitable assessment. Publication Trends: Recent work focuses on improving peer review through randomized controlled trials, security against collusion, LLM-based review systems, and bias mitigation. Publications consistently appear in premier venues (NeurIPS, PLOS ONE, AAAI) with growing emphasis on real-world deployments. Awards & Honors: Young Alumnus Medal (IISc 2024) NSF CAREER Award (2020-2025) Google Research Scholar Award (2021) Multiple best paper awards (HCOMP, ICLR) Research Group & Funding: Leads a focused research team with NSF, Google, and JP Morgan support. Alumni hold positions in academia and industry. Current projects involve large-scale evaluations of scientific work and algorithmic fairness.
Quanquan C. Liu is an Assistant Professor in the Department of Computer Science at Yale University, part of the School of Engineering & Applied Science. His research focuses on algorithms for large data, dynamic/distributed/parallel graph algorithms, and differential privacy. He holds a PhD from MIT's Theory Group, advised by Erik Demaine and Julian Shun, with postdoctoral experience at Northwestern University and MIT. Liu has authored over 50 publications in top venues like FOCS, SPAA, and STACS, and received a Best Paper Award at SPAA 2022. He advises a team of 12+ students, including PhD and undergraduate researchers. His service roles include PC membership for PPoPP, ESA, and SPAA, and coaching for the USA Computing Olympiad (USACO) and ICPC teams. Notable research contributions include advancements in parallel algorithms for graph problems and privacy-preserving techniques.
Jakob Foerster is an Associate Professor at the University of Oxford's Department of Engineering Science and a Supernumerary Fellow at St Anne's College. He leads the FLAIR lab, focusing on multi-agent reinforcement learning (MARL), human-AI coordination, and AI foundational research. Previously, he was a Research Scientist at Facebook AI Research (FAIR) and holds a DPhil from Oxford. His work has been cited over 5,000 times and includes seminal contributions like QMIX and the Hanabi Challenge. Research interests span compute-efficient scaling of AI, MARL applications in finance and bio, and ethical AI. He actively collaborates across academia and industry, co-organizing workshops like NeurIPS' Emergent Communication. His lab emphasizes open-ended RL, environment design, and scalable algorithms. Notable awards include the CIFAR AI Chair (2019) and NeurIPS Best Paper Runner-Up (2018). Current efforts include FLAIR's research on zero-shot coordination and the JaxMARL framework. He advises students in Oxford's Engineering DPhil and AIMS CDT programs.
Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.
Shipra Agrawal is an Associate Professor at the Department of Industrial Engineering and Operations Research, Columbia University, with affiliations to the Data Science Institute and the Department of Computer Science. Her research bridges optimization and machine learning, focusing on decision-making in uncertain environments. PhD in Computer Science from Stanford University (2011) Researcher at Microsoft Research India (2011–2015) Her work addresses online optimization , reinforcement learning , and game theory , aiming to develop algorithms that balance exploration and exploitation for long-term goals. Applications include internet advertising , revenue management , and resource allocation . Recent publications examine dynamic pricing models, regret bounds in reinforcement learning, and convex knapsack optimization. Her research has been supported by NSF CAREER , Google Faculty Research , and Amazon Research Awards . NSF CAREER Award CMMI-1846792 (2019) Google Faculty Research Award (2017) Amazon Research Award (2017) She has advised PhD students who now hold positions at institutions like Google DeepMind, Amazon, and Facebook. Agrawal serves as an associate editor for Management Science , INFORMS Journal on Optimization , and Journal of Machine Learning Research , and co-chaired major conferences such as COLT 2024 and AISTATS 2025.
Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.
Benjamin Brooks is a Professor in the Department of Economics and the College at the University of Chicago, serving as Director of Graduate Studies. He holds a Ph.D. from Princeton University (2014), an M.A. from Princeton (2010), and a B.A. in Mathematics and Quantitative Economics from Tufts University (2008). His research focuses on microeconomic theory, mechanism design, auction theory, repeated games, and computational game theory. Brooks has published extensively in top journals such as the American Economic Review, Econometrica, and the Journal of Political Economy. His work often explores informationally robust mechanisms and strategic behavior in auctions and stochastic games. Brooks has received grants from the National Science Foundation for projects on mechanism design and stochastic game algorithms. He is an Associate Editor of the American Economic Review: Insights, Theoretical Economics, and Economic Theory. His teaching spans game theory, price theory, and advanced topics in economic theory at both undergraduate and graduate levels. Brooks has also contributed to software tools like BCESolve and SGSolve for analyzing Bayesian correlated equilibria and stochastic games. Research Highlights: Contributions to auction design under incomplete information, robust mechanism design, and algorithmic solutions for stochastic games. Awards: Excellence in Refereeing Award (2017), NSF grants (2015-2025), and Fellow of the Society for the Advancement of Economic Theory (2024).
Peter A. Flach is Professor of Artificial Intelligence at the Intelligent Systems Laboratory, School of Computer Science, University of Bristol, where he has been faculty since 1997 and was promoted to Professor in 2003. He currently directs the UKRI AI Centre for Doctoral Training in Practice-Oriented Artificial Intelligence and serves as Vice-President of the European Association for Data Science (EuADS), having previously served as its President. His research centers on rigorous evaluation and improvement of machine learning systems, with seminal contributions to classifier calibration (including Beta Calibration and Precision-Recall-Gain curves), explainable AI frameworks, and data science methodology. He pioneered the extension of CRISP-DM to data science trajectories and developed Explainability Fact Sheets for systematic assessment of XAI approaches. His work bridges theoretical foundations with practical deployment in real-world systems. Analysis of his recent publications reveals a dominant focus on interpretable and reliable machine learning, with strong emphasis on performance evaluation metrics, model calibration techniques, and human-centered explainability. His research increasingly addresses healthcare applications through projects like SPHERE and clinical decision support systems, while maintaining core contributions to fundamental ML theory. His scientific recognition includes prestigious fellowships: Fellow of the European Lab for Learning and Intelligent Systems (ELLIS) Fellow of the European Association for Artificial Intelligence (EurAI) Professor Flach has secured major research funding including UKRI Centre for Doctoral Training grants and EU network funding (TAILOR). He leads extensive collaborations across Engineering, Population Health Science, and international institutions (Monash University, Polytechnic University of Valencia), plus over 20 industry partners in the Practice-Oriented AI CDT including LV= and QinetiQ. His work with the SPHERE project demonstrates successful translation of AI research into residential healthcare settings. He leads the Intelligent Systems Laboratory at Bristol, which develops influential open-source tools including the FAT Forensics Python toolbox for algorithmic fairness and the Explainability Fact Sheets framework. His lab maintains strong connections with the European AI community through ELLIS and EurAI, positioning Bristol as a hub for human-centered and methodologically rigorous AI research.
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.
