Ravid Shwartz-Ziv is an Assistant Professor and Faculty Fellow at NYU's Center for Data Science, with a dual role as Senior Research Scientist at Wand AI. His research bridges theoretical foundations and practical applications in artificial intelligence, focusing on Large Language Models (LLMs), information theory, and neural network interpretability. Ph.D. in Computational Neuroscience, Hebrew University of Jerusalem (2021) B.Sc. in Computer Science and Computational Biology, Hebrew University of Jerusalem (2014) His research spans: Developing min-p sampling for LLM text generation Preventing representation collapse in Transformers Creating contamination-free LLM benchmarks like LiveBench Advancing information-theoretic frameworks for neural networks Exploring representation learning and model adaptation Recent publications demonstrate expertise in LLM efficiency, self-supervised learning, and multi-agent systems. Notable awards include the Google PhD Fellowship, Moore-Sloan Fellowship, and multiple best paper recognitions. He has led research initiatives at Intel and Google AI, focusing on neural network compression, XGBoost comparisons for tabular data, and innovative benchmarking frameworks.
Prof. Dr.-Ing. Gerhard Müller is a Full Professor at the Chair of Structural Mechanics within the TUM School of Engineering and Design at Technical University of Munich (TUM). Since 2004, he has held this distinguished position, and since 2014, he has served as Executive Vice President for Academic and Student Affairs at TUM. His research focuses on structural dynamics and vibroacoustics, with specific expertise in dynamic soil-structure interaction, sound radiation analysis, and seismic risk assessment. Professorship: Structural Mechanics University: Technical University of Munich School: TUM School of Engineering and Design Department: Chair of Structural Mechanics in Civil Engineering Prof. Müller's research spans multiple domains, including: Structural Dynamics : Examining building and vehicle vibrations, seismic soil-structure interaction, and advanced model order reduction techniques Vibroacoustics : Investigating sound radiation from vibrating structures and developing acoustic metamaterials for noise control Computational Methods : Pioneering hybrid deterministic-statistical approaches, Wave Based Methods (WBM) for saturated elastodynamic structures, and parametric model order reduction His recent publications demonstrate expertise in: Wave propagation analysis in poroelastic media Bayesian parameter updating for structural models Acoustic metamaterials for vibration control Advanced numerical methods for seismic risk assessment Hybrid ITM-FEM approaches for soil-structure interaction Energy flow analysis in timber structures Awarded the Spindler Prize in 1984 , Prof. Müller also holds significant academic leadership roles: President of European Association for Structural Dynamics (EASD) Chairman of Bavarian-French University Center (BayFrance) Active member of ASIIN accreditation agency and Bavarian Chamber of Engineers Previously served as Dean of Civil Engineering and Surveying at TUM (2010-2014) He leads the Structural Dynamic Lab (formerly Vibroacoustics Lab) and has developed interactive web apps for engineering education. His work bridges theoretical advancements with practical applications in construction acoustics, transportation noise control, and geothermal energy infrastructure analysis.
Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.
Akihiko Nishimura is an Assistant Professor in the Department of Biostatistics at the Johns Hopkins Bloomberg School of Public Health. He holds a PhD from Duke University (2017) and MS and BS degrees from Stanford University (2011 and 2010). His research focuses on Bayesian methods, statistical computing, and public health data science, with applications in precision medicine and observational health data analytics. PhD, Duke University, 2017 MS, Stanford University, 2011 BS, Stanford University, 2010 Nishimura's research centers on developing advanced statistical and computational methodologies for real-world health data. His work emphasizes Bayesian inference, large-scale computing, and software development for reproducible research. He is particularly interested in using observational health data to improve clinical decision-making and advance precision medicine. He co-leads the Bayesian Learning and Spatio-Temporal modeling group (BLAST Group) and the inHealth/OHDSI Lab , collaborating with clinicians and data scientists across institutions. His recent publications reflect a strong trend in methodological innovation in Monte Carlo methods (e.g., Hamiltonian and Zigzag samplers), scalable Bayesian inference, and applications in pharmacovigilance, diabetes management, and infectious disease modeling. The articles span disciplines including biostatistics, computational statistics, public health, and bioinformatics, demonstrating a consistent focus on high-impact, computationally intensive problems in health data science. Nishimura actively contributes to the scientific community through methodological development and open science. He develops statistical software and shares teaching materials on GitHub, emphasizing reproducibility and performant computing. His involvement in the OHDSI community enables large-scale, multi-institutional studies that would not be feasible with single-source data. His work has been recognized through publications in top-tier journals such as the Journal of the American Statistical Association , Biometrika , and JAMA Ophthalmology , and has been picked up by numerous news outlets and social media platforms, indicating broad scientific and public impact. Nishimura teaches courses on performant statistical computing and advanced Monte Carlo methods, training the next generation of data scientists in efficient algorithm and software design. He mentors students and collaborators in statistical methodology and software development, fostering a culture of rigorous, reproducible, and impactful research.
Samuel W.K. Wong is an Associate Professor in the Department of Statistics and Actuarial Science at the University of Waterloo. He holds a Ph.D. in Statistics from Harvard University (2013) under Prof. Samuel Kou. His research focuses on statistical methodology for complex data science challenges in protein structure modeling, dynamic systems inference, and reliability engineering of wood-based products. He has held academic positions at the University of Florida (2013–2018) and has been at Waterloo since 2018. His research interests include Bayesian computation, statistical inference for dynamic systems, and spatial-temporal data analysis. Notable contributions include the development of manifold-constrained Gaussian processes (MAGI package) and sequential Monte Carlo methods for protein folding studies. He has advised over 15 graduate students and researchers, many of whom are now in academic or industry roles worldwide. Wong has received teaching distinctions at Harvard and holds awards including the Nash Medal (2008) for academic excellence. His work bridges computational statistics with applications in bioinformatics, structural engineering, and environmental science. He has published extensively in top-tier journals like Journal of Computational and Graphical Statistics and Biometrics , and collaborates with wood scientists to improve real-time lumber quality assessment using laser imaging data. His teaching portfolio includes courses on probability theory, statistical inference, and spatial data analysis at both undergraduate and graduate levels. Beyond academia, he maintains an active passion for classical piano performance, having performed recitals combining music with his statistical research interests.
Baoyu Zhou is an Assistant Professor of Industrial Engineering at Arizona State University (ASU), School of Computing and Augmented Intelligence. He holds a PhD in Industrial and Systems Engineering from Lehigh University (2018–2022), an M.S. in Industrial Engineering from Lehigh University (2016–2018), and a B.E. in Mechanical Engineering from Shanghai Jiao Tong University (2012–2016). His research focuses on developing efficient algorithms for large-scale, stochastic, and constrained optimization problems, with contributions to sequential quadratic programming, nonsmooth optimization, and derivative-free methods. Before joining ASU, Zhou was a postdoctoral researcher at the University of Michigan (Department of Industrial and Operations Engineering) and the University of Chicago (Booth School of Business). He has received the Van Hoesen Family Best Publication Award and the Elizabeth V. Stout Dissertation Award. His work bridges optimization theory and practical applications, emphasizing scalability and robustness in complex systems. Zhou teaches courses such as IEE 470: Stochastic Operations Research at ASU and has guest-lectured at the University of Michigan. He actively contributes to the academic community through organizing conference sessions, reviewing for top journals, and participating in workshops at NeurIPS and SIAM. His group currently advises three PhD students focusing on optimization algorithms and their applications. Key research areas include large-scale continuous optimization, constrained stochastic optimization, and derivative-free methods. His publications span journals like SIAM Journal on Optimization and INFORMS Journal on Optimization, addressing challenges in nonlinear systems, variance reduction, and algorithmic convergence.
Gianni Dal Maso is a Professor of Mathematical Analysis at the International School for Advanced Studies (SISSA) in Trieste, Italy. He has been a faculty member at SISSA since 1985, first as Associate Professor and then as Full Professor since 1987. He has held several leadership positions at SISSA including Head of the Sector of Functional Analysis and Applications (1993-1998, 2001-2010), Deputy Director (2010-2015), and Coordinator of the Mathematics Area (2016-2020). His educational background includes: 1973-1977: Undergraduate student in Mathematics at the University of Pisa and Scuola Normale Superiore 1977: Degree in Mathematics with honors at the University of Pisa (thesis: "Gamma-limits of set functions," advised by Ennio De Giorgi) 1977: "Diploma" in Mathematics from the Scuola Normale Superiore 1977-1981: Post-graduate Research Fellowship in Mathematics ("Perfezionamento") at the Scuola Normale Superiore Dal Maso's research focuses on the Calculus of Variations, with particular emphasis on semicontinuity and relaxation problems, Gamma-convergence, and more recently, free discontinuity problems and their applications to mechanics. His work bridges pure mathematical analysis with practical applications in material science, particularly in plasticity and fracture mechanics. He has developed mathematical frameworks for understanding crack propagation, material failure, and the behavior of solids under stress, contributing significantly to both theoretical foundations and practical modeling approaches in these areas. His extensive publication record shows a clear evolution from foundational work in Gamma-convergence (culminating in his influential book "An Introduction to Gamma-Convergence" in 1993) toward increasingly sophisticated models of material behavior, particularly in fracture mechanics and plasticity. Recent work demonstrates continued innovation in handling complex discontinuities, non-local effects, and multi-scale phenomena in material science applications. Among his notable scientific recognitions: 1982: Stampacchia Prize, awarded by the Scuola Normale Superiore 1990: Caccioppoli Prize, awarded by the Italian Mathematical Union 1996: Medaglia dei XL per la Matematica, awarded by the Accademia Nazionale delle Scienze detta dei XL 2003: Prize of the Minister for the Cultural Heritage for Mathematics and Mechanics, awarded by the Accademia Nazionale dei Lincei 2005: Prize Luigi and Wanda Amerio, awarded by the Istituto Lombardo Accademia di Scienze e Lettere Dal Maso has supervised 42 PhD students at SISSA, demonstrating a strong commitment to academic mentorship. His research has been significantly supported by multiple National Research Projects (PRIN) in Italy, and notably by an ERC Advanced Grant "Quasistatic and Dynamic Evolution Problems in Plasticity and Fracture" (QuaDynEvoPro) from 2012-2017, where he served as Principal Investigator. This major project focused on nonlinear evolution problems in plasticity and fracture, with three main research directions: plasticity with hardening and softening, quasistatic crack growth, and dynamic fracture mechanics. His scholarly activities extend to editorial service, with membership on the boards of numerous prestigious journals including Archive for Rational Mechanics and Analysis, SIAM Journal on Mathematical Analysis, and Journal of Convex Analysis. He has also been active in the mathematical community through membership in scientific committees and academies, including the Accademia Nazionale dei Lincei since 2014.
Danfeng Zhang is a faculty member at Duke University whose research sits at the intersection of programming languages and security. Active across the premier PL conferences since 2015, Zhang has served on more than two-dozen program committees and currently co-chairs the POPL Student Research Competition. Education & Affiliation: Home page: users.cs.duke.edu/~dz132 Affiliation: Duke University, United States Research Interests: Zhang’s work spans programming-language design, static and dynamic analysis, formal verification, and security. A recurring theme is developing language-based techniques that guarantee strong security and privacy properties—ranging from side-channel resistance and constant-time execution to differential-privacy proofs—while preserving performance and usability. His recent projects combine type systems, program logics, and automated reasoning to build practical verification tools for concurrent, speculative, and approximate software. Publication Trends: Across nine representative papers (2015-2024) Zhang has advanced static detection of cache side channels, automated proofs of differential privacy, and relaxed concurrency models. The trajectory shows deepening integration of security concerns into language infrastructure, with tool-building (CtChecker, SpecSafe, LightDP) that bridge formal guarantees and real-world systems. Service & Leadership: 2024 POPL Student Research Competition Co-Chair 2025 POPL Program Committee member Repeated reviewer/PC member: PLDI, SPLASH/OOPSLA, ISSTA, ECOOP, APLAS, PriSC, PASS Zhang regularly mentors student researchers through SRC sessions and workshop panels, fostering diversity and early-career participation in the programming-languages community.
Professor David Thomas holds the position of Professor in Computer Engineering at the University of Southampton's Electronics and Computer Science Department. His research focuses on the intersection of software and hardware, particularly leveraging FPGAs for novel digital architectures and event-driven computing. He has a notable academic trajectory, having previously served as a Lecturer and Senior Lecturer at Imperial College London before joining Southampton in 2021. Dr. Thomas is actively involved in supervising PhD students and contributes to interdisciplinary research projects funded by the EPSRC, such as the SONNETS initiative exploring scalable event-triggered systems. Education: BSc in Computer Science (Imperial College London), PhD in Digital Architectures (Imperial College London). Postdoctoral roles included Research Associate and Research Fellow at Imperial's Department of Computing. Research Interests: Event-driven computing, FPGA-based systems, high-level synthesis, and high-performance computing. His work emphasizes practical implementations of theoretical models, such as custom processors and application-specific accelerators. Current projects include optimizing random number generation for FPGAs and exploring meta-programming techniques for hardware design. Advising and Grants: Supervises multiple PhD students in areas like neuromorphic computing and algorithm optimization. Active in securing funding for distributed system architectures and FPGA-based solutions. Labs/Teams: Member of the Cyber Physical Systems research group. Collaborates with interdisciplinary teams on projects like POETS (Partially Ordered Event-Triggered Systems) for large-scale parallel computing.
Martin Müller is a Professor in the Department of Computing Science at the University of Alberta, where he conducts research in artificial intelligence, game theory, and heuristic search. He holds the Canada CIFAR AI Chair at Amii and is an Amii Fellow, underscoring his leadership in AI. His research group focuses on Monte Carlo tree search, reinforcement learning, combinatorial game theory, and automated planning, with applications in games such as Go, Hex, and NoGo. His research interests span Monte Carlo and exact methods in game-tree search , exploration in heuristic search and machine learning , and algorithms in combinatorial game theory . He has developed open-source software like MCGS (Minimax-based Combinatorial Game Solver) and contributes to game-playing systems such as Fuego for Go. His work bridges theoretical foundations with practical implementations in AI-driven game solvers. Recent publications show a strong trend in reinforcement learning , particularly in deep Q-learning, policy gradient methods, and anomaly detection in deep RL. His team also explores combinatorial game solving , sparse reward environments , and imperfect information games . The research integrates machine learning with classical AI techniques, emphasizing empirical validation and algorithmic innovation. Canada CIFAR AI Chair Amii Fellow Best student paper award at IEEE Conference on Games 2024 Best paper award at IEEE COG 2021 Outstanding paper award at AAAI-18 Faculty of Science Dissertation Award (2016) Dissertation Award from the Canadian Artificial Intelligence Association (2013) Müller has supervised numerous PhD and MSc students, including Hongming Zhang, Henry Du, and Timo Bertram, many of whose theses focus on game AI, reinforcement learning, and combinatorial optimization. He is funded by NSERC, Mitacs, and Compute Canada. His group collaborates on projects involving neural networks for game playing, SAT solving, and planning algorithms. He is currently on sabbatical but remains academically active, teaching a graduate course on combinatorial games in 2025 and hosting visiting researchers. His lab is involved in the development of MCGS, a solver for sum games, and contributes to open-source AI software. The team publishes regularly in top venues such as NeurIPS, ICML, AAAI, and IEEE Transactions on Games. Future work includes advancing combinatorial game solvers, improving deep RL robustness, and exploring generalization in game representations.
Francesca Da Lio is a Professor at the Department of Mathematics, ETH Zurich, where she has held a titular professorship since 2014. Her research focuses on nonlinear elliptic and parabolic partial differential equations (PDEs), with applications in stochastic and deterministic optimal control, homogenization, front propagation, and geometric analysis. She has pioneered work on conformally invariant variational problems and nonlocal PDEs, including fractional harmonic maps and stability analysis for critical points. PhD in Mathematics (1998) and Summa Cum Laude Degree in Mathematics (1994) from University of Padova. Her research explores the interplay between nonlinearity and non-locality, particularly in problems arising from geometry, mathematical finance, and physics. She has led major Swiss National Fund (SNF) projects, including grants for geometric analysis and conformally invariant variational theory. Her work on 3-commutators, integrability by compensation, and Morse index stability has advanced the understanding of harmonic maps and elliptic systems. Francesca Da Lio has mentored numerous PhD, postdoctoral, and Master/Bachelor students, including Dominik Schlagenhauf, Jerome Wettstein, and Ali Hyder. She has served on hiring committees for full professorships at ETH Zurich and co-organized international conferences such as 'Recent Advances in Nonlocal and Nonlinear Analysis' and 'Topics in Sub-Elliptic PDEs.' Scientific Awards: Italian Scientific Qualification as Full Professor in Mathematical Analysis (2013). She contributes to editorial boards, including Advances in Calculus of Variations , and participates in academic services like refereeing for SNF projects and international journals.
Dr. Mike Tehranchi is a faculty member at the University of Cambridge, affiliated with the Statistical Laboratory within the Department of Pure Mathematics and Mathematical Statistics (DPMMS) . His research focuses on mathematical finance, stochastic processes, and probability theory. He holds a Lecturer position and is actively involved in academic research, with notable contributions to financial models, term structure analysis, and stochastic calculus. His work bridges theoretical probability and applied finance, addressing topics such as interest rate modeling, implied volatility, and optimal investment strategies. Tehranchi’s research often intersects with optimization, statistical methods, and interdisciplinary applications in astrophysics and fluid dynamics. He maintains an active publication record and contributes to the academic community through his role in the Statistical Laboratory. Key research trends in his articles include the analysis of financial derivatives, stochastic processes in market dynamics, and the application of advanced mathematical techniques to real-world financial problems. His work emphasizes rigorous theoretical foundations while addressing practical challenges in quantitative finance. Dr. Tehranchi has no listed students or academic awards in the provided texts. He can be reached via email and is based in Room D1.04 at the Statistical Laboratory.
Yang P. Liu is an Assistant Professor in the Computer Science Department at Carnegie Mellon University's School of Computer Science. Previously, he was a Postdoctoral Member at the Institute for Advanced Study and earned his PhD from Stanford University under the supervision of Aaron Sidford. He completed his undergraduate studies at MIT, graduating in May 2018. His educational background includes: PhD in Computer Science, Stanford University (Advisor: Aaron Sidford) Bachelor's degree, Massachusetts Institute of Technology (graduated May 2018) Dr. Liu's research spans the intersection of mathematics and computer science, with particular focus on graph algorithms , optimization , high-dimensional geometry , and additive combinatorics . His work often develops novel algorithmic techniques that bridge theoretical insights with practical applications. He has made significant contributions to areas such as convex optimization, linear programming, and combinatorial problems. His teaching includes courses like "A Principled Approach to Optimization" (CS 15-759), which covers rigorous treatments of convex optimization topics including gradient descent, interior point methods, linear regression, linear programming, and sparsification. His extensive publication record in top-tier conferences (FOCS, STOC, SODA) demonstrates a consistent focus on developing almost-linear time algorithms for fundamental graph problems, optimization techniques, and combinatorial theorems. Recent work shows increasing emphasis on combinatorial lines, corners theorem, and k-CSP approximability, while maintaining strong connections to optimization theory and graph algorithms. Dr. Liu has received notable recognition for his work: National Defense Science and Engineering Graduate (NDSEG) Fellowship (2018-2021) Google PhD Fellowship (2022-2023) Best Paper award at FOCS 2022 for "Maximum Flow and Minimum-Cost Flow in Almost Linear Time" Best Student Paper at STOC 2021 for "Discrepancy Minimization via a Self-Balancing Walk" His research has been supported by prestigious fellowships including the NDSEG Fellowship and Google PhD Fellowship. His work on graph algorithms, optimization, and combinatorics involves collaborations with researchers across theoretical computer science and mathematics. His publications often involve co-authors from multiple institutions, suggesting active research collaborations across the field. Dr. Liu maintains an active research program with a focus on developing efficient algorithms for fundamental computational problems. His recent work continues to push the boundaries of what's computationally feasible in graph algorithms, optimization, and combinatorial mathematics, with particular emphasis on achieving almost-linear time complexity for challenging problems.
Guillermo Ferreyra is a Professor in the Department of Mathematics at Louisiana State University (LSU), where he has served since 1996. He holds a Ph.D. from Rutgers University (1983) and a Licenciado from the Universidad de Córdoba, Argentina (1977). His research focuses on Deterministic and Stochastic Control Theory, Partial Differential Equations, Probability Theory, and Financial Mathematics. Ferreyra has held significant administrative roles, including Associate Dean for Science Education (2012–present), Deputy Superintendent of the Office of STEM at the Louisiana Department of Education (2010–2012), and Dean of the College of Arts and Sciences at LSU (2004–2009). He has led initiatives to enhance STEM education, including professional development programs for K-12 teachers and strategies to improve 8th-grade math achievement. Ferreyra’s academic contributions include over 30 journal articles and co-edited volumes on evolution equations and control theory. He has advised five Ph.D. students and secured millions in grants for interdisciplinary research and educational initiatives. His administrative achievements at LSU include expanding faculty diversity, improving student advising, and fostering interdisciplinary programs such as the China Initiative. He has also contributed to statewide education reforms, including planning for the Common Core State Standards. Ferreyra is a member of the American Mathematical Society and has served on national evaluation committees and grant review panels. Publications highlight his work in stochastic control, free boundary problems, and applications to finance and advertising models. His research bridges theoretical mathematics with practical applications, such as the mathematical underpinnings of the 1997 Nobel Prize in Economics for the Black-Scholes formula.
Ryan Giordano is an Assistant Professor in the Department of Statistics at the University of California, Berkeley. He holds a PhD in Statistics from UC Berkeley (2019), advised by Michael Jordan, Tamara Broderick, and Jon McAuliffe, an MSc in Econometrics and Mathematical Economics from the London School of Economics (2009), and undergraduate degrees in Mathematics and Theoretical/Applied Mechanics from the University of Illinois at Urbana-Champaign. Prior to academia, he worked as an engineer at Google and HP and served as a Peace Corps volunteer in Kazakhstan. His research focuses on variational methods , Bayesian robustness , sensitivity analysis , and statistical computing , with applications in machine learning, environmental science, and astronomy. He is particularly known for developing scalable Bayesian inference techniques and quantifying the robustness of statistical models to data perturbations. Giordano’s recent work includes studies on Laplace approximation accuracy, MCMC sensitivity to data removal, and robustness metrics for differential expression analysis. He has contributed to open-source statistical software and collaborates with Tamara Broderick’s group at MIT on postdoctoral work (pre-2019 position). His academic trajectory combines theoretical innovation with practical applications, emphasizing reproducibility and computational efficiency in statistical methodology.
