Lieven Vandenberghe is a Professor in the Electrical and Computer Engineering Department and Department of Mathematics at the University of California, Los Angeles (UCLA). His research focuses on convex optimization, semidefinite programming, and applications in signal processing, system identification, and control theory. Books: Co-author of Convex Optimization (2004) and Introduction to Applied Linear Algebra (2018) Courses: Teaches graduate-level courses in linear programming, convex optimization, and numerical computing (ECE236A/B/C, ECE133A/B) Software: Developer of CVXOPT, CHOMPACK, and SMCP for optimization algorithms His research group has produced significant work in sparse matrix computations, operator splitting methods, and applications to machine learning and control systems. Publications span topics like Bregman splitting, proximal gradient methods, and semidefinite programming for signal processing. His advisees include PhD students in optimization and postdoctoral researchers in applied mathematics.
Dr. Iñaki Esnaola is a Senior Lecturer at the Department of Automatic Control and Systems Engineering, University of Sheffield, and a Visiting Research Collaborator at Princeton University. He holds a MSc from the University of Navarra (2006) and a PhD from the University of Delaware (2011). His research focuses on information theory, machine learning, and cybersecurity, particularly in cyberphysical systems like smart grids. His work addresses data integrity, privacy, robust estimation, and optimal sensor placement. Research interests include: Information theory and data science, machine learning and high-dimensional statistics, cybersecurity (especially data injection attacks), privacy, robust estimation, and sensor placement optimization. Recent projects involve empirical risk minimization with regularization, stealth attacks on control systems, and compressive sensing for environmental monitoring. Key publications include studies on relative entropy in machine learning, sensor placement for sewer networks, and stealth attacks in smart grids. He leads a research group with ongoing projects in resilient cyberphysical systems and received a UKRI grant for advanced manufacturing. His work bridges theoretical foundations with real-world applications in energy systems and environmental monitoring.
Kenichi Shimizu is an Assistant Professor in Econometrics (tenure-track) at the Department of Economics, University of Alberta. He holds a PhD in Economics from Brown University (2021) and previously worked at the Adam Smith Business School, University of Glasgow. His research focuses on Bayesian econometrics, quantitative marketing, industrial organization, and time-series analysis. He teaches courses such as Introductory Econometrics (ECON 399) and Applied Econometrics (ECON 599). Education: PhD in Economics from Brown University (2021). Professional affiliations include roles at the University of Alberta and University of Glasgow. His work emphasizes methodological advancements in econometrics with applications to marketing and industrial organization. Research trends in his publications highlight Bayesian methodologies for dynamic modeling, structural breaks, and high-dimensional data. Key topics include semiparametric estimation, sparse models, and policy evaluation frameworks. Grants: Recipient of SSHRC Insight Development Grant (2024-2026) for research on Bayesian econometric methods in industrial organization and marketing. Active presenter at major conferences including the NBER-NSF Seminar, Canadian Economic Association meetings, and the World Congress of the Econometric Society. Teaching responsibilities include undergraduate and graduate econometrics courses with emphasis on applied regression methods and model specification.
Dr Sean Anderson is a Senior Lecturer at the Department of Automatic Control and Systems Engineering , University of Sheffield , with over 15 years of experience in interdisciplinary research spanning robotics, control systems, and computational biology. He earned his MEng and PhD from the University of Sheffield, focusing on control systems and chemical engineering. Education: MEng in Control Systems Engineering, University of Sheffield (2001) PhD in Chemical and Process Engineering, University of Sheffield (2005) Research Interests include: Bioinspired robotics Adaptive and optimal control in biological systems Nonlinear system identification Computational neuroscience Acoustic and visual sensor fusion for localization His recent publications highlight innovations in robotic localization in hazardous environments, interpretable deep learning for control systems, acoustic sensing technologies, and data-driven modeling of complex systems. Key projects involve autonomous navigation in pipe networks, turbulence modeling, and biomedical signal processing. Grants and Funding: He has secured major grants from EU H2020 (£4M), EU FP7 (£2.9M), and EPSRC (£5.7M), focusing on bioinspired control algorithms, robotic safety, and infrastructure assessment. Teaching: He leads the ACS61011 Deep Learning module, emphasizing practical applications in robotics and signal processing.
Tobias Neckel is an Associate Professor at the Institute for Informatics at the Technical University of Munich (TUM), where he leads research projects and coordinates academic programs. He has been the project team leader of the IGGSE Project ExaNIML since 2018, main coordinator of the Ferienakademie since 2014, and Program Coordinator of the Bavarian Graduate School of Computational Engineering (BGCE) since 2009. Diploma in Technomathematik from TU München (2005) Dr. rer. nat. in Informatics from TU München (2009) Neckel's research focuses on Uncertainty Quantification, Random Differential Equations, and High Performance Computing. His work develops efficient numerical algorithms using hierarchic and adaptive methods such as octrees/spacetrees and sparse grids, with applications in fluid-structure interactions and incompressible fluid flow simulation. His research bridges theoretical mathematics with practical computational science, emphasizing robust and efficient implementations. His recent publications demonstrate a strong trajectory in multi-fidelity modeling, uncertainty quantification, and high-performance computing. Neckel has made significant contributions to scalable hierarchical approximation methods, dynamic resource management in HPC, and the application of machine learning techniques to computational science problems. His work spans diverse application domains including plasma physics, hydrology, and computational engineering. Lehrfonds prize of the TUM (2014) Ernst Otto Fischer prize of the TUM (2011) Promotionspreis des Bunds der Freunde der TU München (2009) Neckel has supervised numerous graduate students and has been actively involved in curriculum development and teaching innovation. His book "Bits and Bugs: A Scientific and Historical Review of Software Failures in Computational Science" (2019) represents a significant contribution to understanding software reliability in scientific computing. He has organized minisymposia at major conferences including SIAM CSE and SIAM UQ, and serves on program committees for various computational science conferences. As coordinator of the Ferienakademie and the BGCE, Neckel plays a central role in advanced computational engineering education in Bavaria. His research group develops software for exascale computing and contributes to the Transregional Collaborative Research Centre 89 on Invasive Computing. Neckel also maintains international collaborations, with research stays at institutions including the Australian National University and Tokyo Institute of Technology.
P. (Saday) Sadayappan is a Professor in the School of Computing at the University of Utah. He serves as a lead researcher in high-performance computing, with a focus on compiler optimization and algorithm-architecture co-design. His current projects include NIH SBIR Phase 2 funding for large-scale image analysis and NSF grants for tensor applications and cyber-infrastructure for AI. Research Interests : Compiler Optimization for High Performance Computing Optimization of Sparse/Dense Matrix/Tensor Computations Scalable Machine Learning Algorithm-Architecture Co-Design Optimization Research Trends in Publications : His work emphasizes optimizing computational workflows for emerging hardware architectures, with a focus on accelerating machine learning and scientific computing through compiler-level innovations. Recent trends include co-design for CNNs, sparse matrix optimizations, and distributed algorithms. Scientific Awards : ACM SIGPLAN Most Influential PLDI Paper Award (2018) Grants & Projects : NSF (2022–2027): Comprehensive Framework for Tensor Applications NSF AI Institute ICICLE (2021–2026): Cyber-infrastructure for environmental AI NIH SBIR (2023–2025): Next-gen machine learning for image analysis Labs & Teams : Collaborates with institutions like Ohio State University and RNET Technologies on projects involving parallel computing, sparse algorithms, and compiler design.
Noela Müller is an Assistant Professor in the Mathematics and Computer Science school at Eindhoven University of Technology . Her research focuses on Probability Theory , Random Matrices , and Random Graphs , with significant contributions to understanding the rank of sparse matrices and clique factors in probabilistic settings. Research Outputs : Published 22 works including journal articles and preprints. Collaborations : Active in international networks, particularly in sparse matrix analysis and probabilistic combinatorics. Her recent work explores sparse pooled data algorithms , random 2-SAT models , and sharp thresholds in random graphs , showcasing interdisciplinary applications in computer science, mathematics, and theoretical physics.
Zhengyuan Zhou is an Assistant Professor in the Department of Technology, Operations, and Statistics at the Leonard N. Stern School of Business, New York University. He is also associated faculty at the Department of Computer Science and Engineering, Tandon School of Engineering, and affiliated with the NYU Center for Data Science. He joined NYU Stern in 2020 after serving as an IBM Goldstine Research Fellow and a Visiting Scholar at NYU Stern during 2019–2020. Education: Ph.D., Electrical Engineering, Stanford University, 2019 Master’s in Computer Science, Stanford University Master’s in Statistics, Stanford University Master’s in Economics, Stanford University B.A., Mathematics, UC Berkeley B.S., Electrical Engineering and Computer Sciences, UC Berkeley His research centers on the intersection of machine learning, stochastic optimization, control theory, and game theory, with a focus on data-driven decision-making. He develops algorithms for reinforcement learning, contextual bandits, and policy learning under uncertainty, with applications in inventory control, revenue management, and auction bidding. His work emphasizes sample efficiency, computational tractability, and robustness. The recent publications reflect a strong trend in distributionally robust learning , offline reinforcement learning , and multi-agent systems , particularly in settings with delayed feedback, adversarial environments, and adaptive data collection. His articles span top journals in operations research, machine learning, and control theory. Scientific Awards and Honors: IBM Goldstine Fellowship (2019–2020) INFORMS Nicholson Award Finalist (2017, 2018) NSF and ONR grants (multiple, 2021–2027) NYU Research Catalyst Prize (2023) Horizon Robotics, Bain, and JP Morgan faculty awards (2021) CRA Outstanding Undergraduate Researcher (2013) Zhou advises PhD students in operations management and has served on dissertation committees at Georgia Tech and Tsinghua University. He has received over $1.8 million in research funding from NSF, ONR, and industry partners. He is actively involved in editorial roles as Associate Editor for Management Science , Operations Research , and Mathematics of Operations Research , and as Area Chair for NeurIPS, ICML, and ICLR. He also mentors high school students through logic and cryptography programs at Stanford’s Pre-Collegiate Summer Institute.
Mateo Valero Cortés is a renowned Professor of Computer Architecture at the Polytechnic University of Catalonia and Director of the Barcelona Supercomputing Center (BSC). He has held academic and leadership roles since 1974, advancing high-performance computing (HPC) and computer architecture research. His work includes pioneering contributions to vector architectures, multithreading, and instruction-level parallelism. Education includes a Telecommunications Engineering degree from the Polytechnic University of Madrid (1974) and a PhD in Telecommunications Engineering from the Polytechnic University of Catalonia (1980). His research spans over 700 publications, focusing on HPC systems, parallel computing, and supercomputing infrastructure. Key research interests include vector processing, super-scalar processors, and task-based programming models. Recent work emphasizes scalable architectures for exascale computing and energy-efficient hardware-software co-design. Notable achievements include the Eckert-Mauchly Prize (highest in computer architecture), Seymour Cray Award, and Charles Babbage Prize. He has led initiatives like the Spanish Supercomputing Network (RES) and PRACE (European HPC partnership). Academic affiliations include the Royal Academy of Engineering of Spain, ACM Fellow, and IEEE Fellow. He has received 13 honorary doctorates and awards such as Mexico’s Order of the Aztec Eagle. Current projects include the Mont-Blanc HPC prototype and ERC-funded research on multi-core chip design. His BSC oversees over 300 researchers and manages MareNostrum supercomputers.
Ross J. Kang is a Canadian mathematician currently serving as an Associate Professor at the Korteweg–de Vries Institute for Mathematics within the Faculty of Science at the University of Amsterdam since 2022. He is an active member of the Discrete Mathematics and Quantum Information group and the NETWORKS consortium. Previously, he held positions as Assistant/Associate Professor at Radboud University Nijmegen (2014-2022), Assistant Professor at Utrecht University (2013), and Researcher at Centrum Wiskunde & Informatica (2012-2013). His academic journey includes postdoctoral positions at Durham University (2010-2012) and McGill University (2008-2010), where he was advised by Bruce Reed and Louigi Addario-Berry. DPhil in Mathematics, University of Oxford (2008) - Thesis: 'Improper colourings of graphs', advised by Colin McDiarmid BSc (Hons) in Mathematics and Computer Science, University of Victoria (2003) - Governor General's Silver Academic Medal recipient Ross J. Kang's research focuses on probabilistic and extremal combinatorics, random discrete structures, graph coloring, geometric graphs, and algorithms. His work bridges theoretical mathematics with practical applications, exploring fundamental questions in discrete mathematics. He has made significant contributions to understanding graph coloring problems, particularly in the contexts of list coloring, distance coloring, and strong coloring. His research often employs probabilistic methods to establish bounds and structural properties in graph theory. Kang's work on the hard-core model, local occupancy method, and triangle-free graphs has advanced our understanding of the interplay between local constraints and global structure in discrete systems. Analysis of his recent publications reveals a strong emphasis on graph coloring problems, particularly list coloring variants and their extensions. His work frequently explores the relationship between graph structure (such as degree constraints, girth, or forbidden subgraphs) and coloring properties. A notable trend is his development and application of the local occupancy method to establish improved bounds for chromatic numbers in various graph classes. His research also demonstrates a consistent interest in extremal problems, seeking optimal configurations under specific constraints, particularly in the context of triangle-free graphs and geometric representations. NWO Open Competition M-1 grant entitled 'Asymptotic triangle-free structure (3Free)', 2022-2026 NWO Vidi grant entitled 'On the edge: theory and techniques at the frontiers of edge-colouring', 2017-2023 NWO Veni grant entitled 'Generalised colouring for random graph models', 2012-2015 Van Gogh travel grants (2020-2021 with Marthe Bonamy; 2016-2017 with Louis Esperet) Governor General's Silver Academic Medal (2003) Ross J. Kang has successfully supervised multiple PhD students including Eoin Hurley (defending May 2025), Stijn Cambie (defended April 2022), and François Pirot (winner of 2020 prix Charles Delorme). His research is supported by significant grants from the Netherlands Organisation for Scientific Research (NWO), including the prestigious Open Competition M-1 grant. Kang is actively involved in the academic community through his editorial role at Combinatorial Theory, co-organization of conferences like the Dutch Days of Combinatorics, and leadership in initiatives such as Innovations in Graph Theory, a diamond open access journal he helped launch in August 2023. As a member of the Discrete Mathematics and Quantum Information group at the University of Amsterdam and the NETWORKS consortium, Kang collaborates with researchers across various institutions. He has established strong international connections through his Van Gogh travel grants and participation in collaborative projects like the Sparse (Graphs) Coalition sessions. His research group focuses on theoretical aspects of discrete mathematics with connections to quantum information science, and he maintains active collaborations with researchers across Europe and North America.
Sidharth Jaggi is a Professor at the School of Mathematics, University of Bristol, with over 19 years of experience in Information and Data Sciences through the lens of Information Theory. His work emphasizes fundamental performance limits and algorithm design for systems under adversarial threats. Education: B.Tech, M.Phil, PhD Research interests focus on adversarial communication, information-theoretic security, coding theory, and sparse data estimation. He leads the CAN-DO-IT team (Codes, Algorithms, Networks – Design and Optimization for Information Theory), integrating theoretical tools into practical applications like secure distributed computing and robust data storage. Recent publications highlight advancements in adversarial channels , group testing , and privacy-preserving coding . Trends include covert communication under spectral constraints, causal feedback benefits, and efficient algorithms for high-dimensional problems. Current projects include "Information Theory for Interactive Distributed AI" (2024–2029), exploring interactive systems under adversarial constraints.
Inbar Fijalkow is a Full Professor at the National School of Electronics and Computer Science (ENSEA) within CY Cergy Paris University. She is a member of the ETIS Research Unit (UMR 8051), focusing on signal processing for wireless communications, optimization, and machine learning applications. Her research bridges theoretical advancements with practical implementation in emerging communication systems. Education & Career: PhD in Signal Processing from TelecomParisTech (1993) Postdoctoral Fellow at Cornell University (1994–1995) Professor at ENSEA since 1999 Former Head of ETIS Research Unit (2004–2013) Research Interests: Signal processing for wireless communications Optimization techniques in massive MIMO and NOMA systems Machine learning applications in communication systems Nonlinear effects mitigation in high-power amplifiers Community & Awards: Member of CoNRS Section 7 (National Committee for Scientific Research) Chevalier de l’Ordre National du Mérite (2015) Founder of the CY Alliance Women in Science Prize (2017) Recent Projects: Active in ANR-funded initiatives (e.g., EcoBioH2, AI4code) and EU projects (e.g., PERSEUS). Her work emphasizes sustainability and AI-driven communication systems. Teaching: Teaches signal processing and wireless communications at ENSEA. Supervises PhD students and master’s theses in communication systems and signal processing.
Bryan S. Graham is a Professor in the Department of Economics at the University of California, Berkeley, where he has held faculty positions since 2005, progressing from Assistant Professor to his current full Professor rank in 2017. His research focuses on the econometrics of social interactions and networks, with particular expertise in measuring the effects of stratification on inequality. He is an active member of the Inequality: Measurement, Interpretation, and Policy (MIP) Network and contributes significantly to the field of network econometrics. Professor Graham's educational background reflects exceptional academic achievement: B.A. in Quantitative Economics from Tufts University (1997), Summa Cum Laude, Phi Beta Kappa M.Phil. in Economics from Oxford University (2000) as a Rhodes Scholar Ph.D. in Economics from Harvard University (2005) His research program bridges theoretical econometric advances with practical applications to economic policy questions. Graham has pioneered methods for analyzing network data, identifying social interactions, and measuring segregation effects. His work appears in top journals including Econometrica, Review of Economic Studies, and Journal of Econometrics. He has authored the influential Handbook of Social Economics chapter on network econometrics and co-edited the comprehensive volume 'The Econometric Analysis of Network Data' (2020). Professor Graham's publications reveal a consistent focus on developing methodological tools for analyzing social networks and peer effects, with increasing sophistication in handling complex network structures and addressing identification challenges. His recent work has expanded into practical applications in education policy and spatial inequality while maintaining theoretical rigor in econometric methodology. His scientific contributions have been recognized through prestigious awards including election as Fellow of the International Association of Applied Econometrics (2023) and multiple competitive National Science Foundation grants totaling over $1 million. Early career recognition included the Rhodes Scholarship, Fulbright Scholarship, and National Science Foundation Graduate Fellowship. As an educator, Graham teaches undergraduate and graduate econometrics courses at UC Berkeley and has developed specialized short courses internationally on econometric methods for social spillovers and network data. He has served on numerous editorial boards including as Co-Editor of the Review of Economics and Statistics (2014-2019) and has organized major conferences including the Berkeley-Stanford Econometrics Jamborees. Beyond academia, he maintains active research affiliations with the National Bureau of Economic Research, Center for Evaluation and Development at the University of Mannheim, and the Human Capital and Economic Opportunity Working Group at INET.
Jean F. Honorio Carrillo is an Adjunct Professor at Purdue University's Department of Computer Science and a Senior Lecturer at the University of Melbourne's School of Computing and Information Systems. He specializes in machine learning theory, optimization, and their applications to combinatorial and non-convex problems. His research focuses on developing algorithms with theoretical guarantees for structured prediction, robustness, fairness, and federated learning. He has advised numerous students across multiple institutions and holds adjunct roles at Purdue's Statistics Department and MIT CSAIL. Roles: Senior Lecturer (Melbourne), Adjunct Professor (Purdue), Adjunct at MIT CSAIL Research Areas: ML Theory, Non-Convex Optimization, Fairness, Federated Learning Key contributions include breakthroughs in exact inference for structured prediction, optimization frameworks for NP-hard problems, and theoretical foundations for modern ML challenges. His work has been published in top venues like NeurIPS, ICML, and JMLR. He has secured grants from NSF and industry partners, including a 2021 NSF DMS grant for deep learning research. His students have gone on to postdoctoral roles at NUS and UChicago/CMU.
Karl Gregory is an Associate Professor in the Department of Statistics at the University of South Carolina, part of the McCausland College of Arts and Sciences. He holds a BS from Central Michigan University, and MS and PhD in Statistics from Texas A&M University, followed by a postdoctoral position at the University of Mannheim. His research focuses on bootstrap methods for high-dimensional regression, nonparametric regression, and sparse linear regression models. He currently serves as an Associate Editor for The American Statistician. Dr. Gregory’s work emphasizes methodological advancements in statistical inference, particularly in handling complex data structures such as group testing and high-dimensional settings. His contributions bridge theoretical statistics with practical applications in epidemiology and biomedical research. He is also actively involved in teaching, contributing to courses like STAT 516 and STAT 513. His research trends highlight interdisciplinary collaborations, integrating computational statistics with real-world challenges in health and data science. While no awards are explicitly listed, his editorial role underscores his impact on the statistical community. He maintains a lab focused on developing scalable statistical tools for modern datasets through his website and published works.
