Neil Shah is a Lead Research Scientist at Snap Inc., leading initiatives in user modeling, personalization, and trust and safety across Snapchat. His research focuses on advancing machine learning algorithms for large-scale structured data, including graph and sequential representations, with applications to recommendation systems and social platform security. PhD in Computer Science, Carnegie Mellon University (2017), advised by Christos Faloutsos B.S. in Computer Science, North Carolina State University Current research interests span: Graph Neural Networks (GNNs) for real-time inference and scalable training Cross-domain recommendation systems and generative modeling Test-time augmentation and hyperbolic geometry in representation learning Explainability methods for GNNs and fairness-aware outlier detection Recent publications highlight productionized GNN frameworks (GiGL), multimodal graph benchmarks, and novel approaches to link prediction and collaborative filtering. His work has appeared at top venues like KDD, ICLR, NeurIPS, and WWW. Scientific recognition includes: Outstanding Service Award at WSDM 2022 Best Paper Honorable Mention at CHI 2019
Anup Basu is a Professor in the Department of Computing Science at the University of Alberta. His research focuses on computer graphics, computer vision, and multimedia communications. He holds an B.S. in Math & Statistics from the Indian Statistical Institute (1980), an M.E. in Computer Science from the Indian Statistical Institute (1983), and a Ph.D. in Computing Science from the University of Maryland (1990). His work emphasizes Quality of Service (QoS) in multimedia delivery for e-commerce and telelearning, adaptive bandwidth monitoring, and 3D visualization tools. He pioneered foveated image compression and stereo visualization techniques, contributing to MPEG-4 coding standards. He leads major initiatives like the ASRA/TelePhotogenics/IBM 3D Medical Imaging project ($2M+ funding) and developed patented SHR Stereo/3D scanning technologies. Awards include the American Neurological Association Fellowship. He has held leadership roles as General Chair for IEEE International Conferences on SMC (2017), Multimedia & Expo (2013), and SMC (2014). His research integrates interdisciplinary collaborations across universities and industry partners, leveraging advanced equipment like the CAVE system for immersive visualization.
Hassan Z. Ashtiani is an Associate Professor in the Department of Computing and Software within the Faculty of Engineering at McMaster University. His academic profile shows consistent engagement in both teaching and research activities, with evidence of active participation in major machine learning conferences and journals through 2025. Dr. Ashtiani's research focuses on the theoretical foundations of machine learning, with particular expertise in privacy-preserving algorithms, Gaussian mixture models, and adversarial robustness. His work bridges statistical learning theory with practical algorithm design, often addressing fundamental questions about sample complexity and computational efficiency in learning systems. A significant portion of his recent work explores the intersection of differential privacy with statistical learning, developing methods for private density estimation and distribution learning. Analysis of his publication record reveals a strong trend toward increasingly sophisticated theoretical frameworks for private and robust learning. His work consistently appears in top-tier venues including NeurIPS, ICML, COLT, and ALT, with recent contributions extending into agnostic private density estimation and robust learning with tolerance. The research demonstrates progression from foundational work on nearest neighbor search and clustering algorithms toward more complex problems in private learning of high-dimensional distributions. Dr. Ashtiani teaches across multiple levels of computer science education, including undergraduate courses in Automata and Computability (COMPSCI 2AC3) and Principles of Programming (COMPSCI 2S03), as well as graduate-level courses such as Fundamentals of Machine Learning (COMPSCI 4ML3) and Theoretical Foundations of Unsupervised Learning (CAS 775). His teaching portfolio shows consistent involvement in machine learning education since at least 2019, with evidence of teaching multiple sections each academic year. His scholarly impact is reflected in mentions across 3 news outlets, reference in 1 policy source, engagement from 7 X users, and 90 readers on Mendeley, suggesting growing recognition of his contributions to theoretical machine learning.
Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for effective and responsible analytics, leveraging techniques from causal inference, data management, theoretical computer science, machine learning, and human-computer interaction to address challenges in trustworthy system design including robustness, explainability, and fairness. Education: Postdoc: University of Chicago PhD: University of Massachusetts Amherst (supervised by Barna Saha) BTech: Indian Institute of Technology Delhi (IIT Delhi) (supervised by Prof. Amitabha Bagchi) Research Interests: Dr. Galhotra's research spans several interconnected areas in data science and artificial intelligence. His work primarily focuses on Responsible Data Science , where he develops methods to ensure that data-driven systems operate fairly and transparently. Within this broad area, his specific interests include: Causal Inference techniques for understanding cause-effect relationships in complex data Algorithmic Fairness approaches to mitigate bias in machine learning systems Explainable AI methods that make black-box models more interpretable Data Management systems for efficient and reliable data processing Entity Resolution techniques for integrating data from multiple sources Trustworthy System Design that addresses robustness, explainability, and fairness His recent publications demonstrate a clear trend toward developing frameworks that combine causal reasoning with practical data management systems, particularly focusing on how to make data-driven decisions more transparent and equitable. The intersection of database systems with fairness considerations appears to be a particularly active area of his research. Scientific Awards: Rising Star in Data Science at the Data Science Institute, UChicago (Oct 2021) Computing Innovation Fellowship Award Recipient (by CRA, CCC and NSF) (Apr 2021) DAAD AInet Fellow (Feb 2021) ACM SIGMOD Entity Resolution Programming Contest – Top 5 finalist (May 2020) Most reproducible paper award in SIGMOD 2018 and 2019 (Jun 2019) First recipient of Krithi Ramamritham Computer Science Scholarship (Jun 2019) Best paper award in SIGSOFT FSE 2017 (May 2017) Dr. Galhotra is actively seeking students to collaborate with on his research projects. His work has been supported by various fellowships and awards, including the prestigious Computing Innovation Fellowship. He has mentored several students through his research projects, with a focus on developing the next generation of data scientists who can build responsible and trustworthy systems. His research group appears to focus on the intersection of database systems and responsible AI, developing tools like HypeR for causal reasoning, Ver for view discovery, and Nexus for correlation discovery in spatio-temporal data. This work suggests a cohesive research agenda centered around making data systems more transparent, fair, and user-friendly.
Jamie Morgenstern is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering , University of Washington . She was previously an assistant professor at Georgia Tech and a Warren Center Fellow at University of Pennsylvania . Expertise: Ethics & Fairness, Human-Centered AI, Machine Learning Education: PhD in Computer Science from Carnegie Mellon University (2015) Her research examines the social impact of machine learning and ensuring ML models do not exacerbate societal inequalities. She investigates robustness to human-generated training data, fairness in clustering and active learning, and algorithmic equity in recommendation systems. Recent publications focus on interactive ML systems , fairness constraints , and privacy-preserving methods across conferences like NeurIPS, ICML, and AIES. Key subfields include multimodal learning , membership inference attacks , and data equity . Scientific Awards: NSF Career award for "Strategic and Equity Considerations in ML" Simons collaboration project Simons Award for Graduate Students in Theoretical Computer Science (2014-2016) NSF GFRP fellowship Microsoft Research Graduate Women's Scholarship Spotlight presentation at NeurIPS 2015 Mentoring: She advises current PhD students Rachel Hong , Jie (Claire) Zhang , and Yuanyuan (Chloe) Yang . Former advisees include Daniel Jiang (MS), Bhuvesh Kumar (PhD), and Angel (Alex) Cabrera (BS). Grants: Funded by NSF Career award and Simons collaboration projects. Previously supported by Simons, NSF, and Microsoft Research fellowships. Labs & Collaborations: Collaborates with researchers like Michael Kearns , Aaron Roth , and Avrim Blum . Affiliated with the Allen School's Artificial Intelligence research group.
Yen-Chi Chen is an Associate Professor in the Department of Statistics at the University of Washington. He also holds positions as a Data Science Fellow at the UW eScience Institute and as a co-investigator and statistician at the National Alzheimer's Coordinating Center. His academic career spans multiple interdisciplinary fields including statistics, data science, and astrostatistics. Chen's educational background includes a Ph.D. from Carnegie Mellon University, where he received prestigious awards including the Umesh K. Gavasakar Thesis Award (2017) and the William S. Dietrich II Presidential Ph.D. Fellowship Award (2015). His research focuses on nonparametric statistics, topological data analysis, missing data methodologies, cluster analysis, manifold learning, and applications in large-scale structure analysis and astrostatistics. Chen has made significant contributions to the development of statistical methods for analyzing cosmic web structures, GPS data, and causal inference with continuous treatments. His work bridges theoretical statistics with practical applications in astronomy, neuroscience, and public health. Analysis of his recent publications reveals a strong emphasis on developing novel statistical frameworks for complex data structures, particularly focusing on density-based methods, manifold learning, and approaches that address challenges in missing data and causal inference without standard assumptions. ASA Noether Early Career Scholar Award, American Statistical Association (2022) CAREER Award, National Science Foundation (2022-2027) Umesh K. Gavasakar Thesis Award, Carnegie Mellon University (2017) William S. Dietrich II Presidential Ph.D. Fellowship Award, Carnegie Mellon University (2015) Chen has advised numerous graduate students across multiple publications, with a focus on developing new statistical methodologies. His research has been supported by major funding agencies including the National Science Foundation and the National Institutes of Health. He is actively involved in several research groups including the UW Geometric Data Analysis Group, the UW Center for Statistics and the Social Sciences, and the National Alzheimer's Coordinating Center.
Alex Shestopaloff is a Lecturer in Statistics at Queen Mary University of London (QMUL), affiliated with the School of Mathematical Sciences. Previously, he was a Research Fellow at the Alan Turing Institute (2017–2020) and a Junior Research Fellow at Campion Hall, Oxford. He holds a PhD in Statistics from the University of Toronto (2016), supervised by Radford M. Neal. His research focuses on developing efficient MCMC methods, high-dimensional time series analysis, network science, and applications in financial market microstructure. Education: PhD in Statistics, University of Toronto (2016) Supervisor: Radford M. Neal Research Interests: Bayesian online learning in non-stationary environments Limit order book modeling and trading strategies Graph clustering and network analysis Statistical methods for high-dimensional data Algorithmic trading and cryptocurrency markets His recent work spans financial engineering, machine learning, and statistical methodologies. Notable contributions include cluster-based trading strategies (ClusterLOB), generalized Bayesian filtering frameworks, and scalable graph analysis techniques. Collaborations with industry partners (e.g., Wise Plc) highlight applied research in financial systems. Advising & Alumni: Current advisees include Yichi Zhang (Oxford), Maria Fernanda Pintado (QMUL), and Dave Lui (Oxford) Alumni: Gerardo Duran-Martin (Postdoc at Oxford-Man Institute), Claudio Bellani (Citadel Securities) Labs/Teams: Leads interdisciplinary projects at QMUL and collaborates with the Alan Turing Institute on financial and network science initiatives.
Min Seong Kim is an Associate Professor in the Department of Economics at the University of Connecticut, affiliated with the College of Liberal Arts and Sciences. His research focuses on econometrics, particularly panel data analysis, bootstrap methods, and cross-sectional dependence. He earned his Ph.D. in Economics from UC San Diego in 2011. His contact information includes email: min_seong.kim@uconn.edu , and office location Oak Hall 330. Education: Ph.D., Economics, UC San Diego, 2011 Research Interests: Econometric theory and applications Bootstrap methods and robust inference Panel data models with cross-sectional dependence Time series analysis and spatial econometrics Publications highlight his contributions to econometric methodology, including robust inference techniques for panel data models, bootstrap methods, and policy analysis. Recent work addresses cross-sectional dependence in large panel models and diffusion index forecasts. No scientific awards are explicitly listed. Advising and grant details are not provided in the text. His research is supported through standard academic channels, and he maintains a professional website at http://minseongkim.weebly.com .
Jann Spiess is an Associate Professor of Operations, Information & Technology at Stanford University's Graduate School of Business and holds a courtesy appointment as Associate Professor of Economics in the School of Humanities and Sciences. He is also a Center Fellow at the Stanford Institute for Economic Policy Research and a Faculty Affiliate of the Golub Capital Social Impact Lab. PhD in Economics (Harvard University, 2018) AM in Economics (Harvard University, 2015) MPP in Public Policy (Harvard University, 2013) MASt in Mathematics (University of Cambridge, 2011) BSc in Mathematics (Technical University of Munich, 2010) Jann's research integrates machine learning with econometric methods to advance causal inference and data-driven decision-making . He explores high-dimensional and robust causal inference, synthetic control methods, and algorithmic fairness, while addressing challenges in human-AI collaboration and policy design. His publications span econometrics, behavioral economics, and data science, focusing on experimental design, robust statistical techniques, and applications of machine learning to public policy. Key themes include replicable inferences from big data, human-AI interaction, and ethical algorithmic design. Philip F. Maritz Faculty Scholar, 2021–22 David A. Wells Prize for best dissertation, Harvard Economics, 2018 Restud Tour, 2018 Jann's work bridges microeconometric methods , statistical decision theory , and mechanism design to enhance analytical frameworks for data-driven policy. He has contributed to robust inference in panel data and synthetic control methods, alongside studies on nudges for vaccination and financial aid renewals. As Faculty Affiliate at the Golub Capital Social Impact Lab, Jann collaborates on projects applying data science to social policy challenges, merging technical rigor with societal impact.
Assoc Prof Xiang Liming is an Associate Professor in the Division of Mathematical Sciences at Nanyang Technological University (NTU), Singapore, serving as Assistant Chair (Students). She holds editorial roles at *Computational Statistics & Data Analysis* and *Statistics in Medicine*. With a PhD in Statistics (City University of Hong Kong, 2002), her research focuses on survival analysis, longitudinal data analysis, and biostatistical methods. Notable contributions include methodologies for semi-competing risks, interval-censored data, and mixture models. Her work bridges statistical theory with biomedical applications, addressing challenges in clinical trials and public health. Awards include the 2009 IIE Transactions Best Paper Award and the Outstanding Research Thesis Award (2002–2003, CityU). Education: PhD in Statistics, City University of Hong Kong (2002) Postdoctoral Research: Hong Kong University of Science and Technology (2002–2003) and CityU (2003–2006) Research Interests: Survival analysis methodologies, including frailty models, cure models, and quantile regression for censored data. She develops robust statistical approaches for clustered/longitudinal data, addressing missingness and overdispersion. Applications span biomedical research, epidemiology, and quality management. Grants & Collaborations: Her grants include work on robotic-assisted stroke rehabilitation (2021) and LNG cold energy utilization systems (2017–2019). She collaborates with clinical teams on trials involving upper limb neurorehabilitation technologies. Labs & Teams: Leads statistical method development for multi-center clinical trials, particularly in biostatistics and survival analysis frameworks. Active in NTU’s School of Physical & Mathematical Sciences research initiatives.
Prof. Vladimir Spokoiny is a leading figure in stochastic algorithms and nonparametric statistics at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) and Humboldt University of Berlin . His work bridges mathematical statistics with practical applications in finance, medicine, and machine learning. Born in 1959 in Moscow, USSR PhD from Lomonosov Moscow State University (1988) Habilitation from Humboldt University (1996) Head of WIAS research group since 2000 Professor at Humboldt University since 2002 Spokoiny's research focuses on adaptive nonparametric methods, high-dimensional data analysis, and statistical finance. His innovations in local homogeneity testing and propagation-separation methods have advanced volatility modeling, image analysis, and manifold learning. He employs Bayesian optimization frameworks and stochastic control techniques for financial instrument pricing. Recent scientific contributions include generalized bootstrap procedures for Bures-Wasserstein barycenters (2024), dimension-free Laplace approximation bounds (2023), and structure-adaptive manifold estimation (2022). His 19+ PhD students and editorial roles in top journals like The Annals of Statistics demonstrate sustained academic impact. International Statistical Institute member American Statistical Association fellow Institute of Mathematical Statistics member Bernoulli Society member
Sivaraman Balakrishnan is a Professor at Carnegie Mellon University with joint appointments in the Department of Statistics and Data Science and the Machine Learning Department. His research bridges statistical machine learning, algorithmic statistics, and robust inference. Education: Ph.D. in Computer Science from Carnegie Mellon University (Language Technologies Institute, advised by Jaime Carbonell); postdoctoral work at UC Berkeley (Department of Statistics, advised by Martin Wainwright and Bin Yu). Research Interests: Spanning robust statistics, domain adaptation, minimax hypothesis testing, assumption-light inference, causal inference, statistical optimal transport, non-parametric statistics, ranking, crowdsourcing, optimization, and topological data analysis. Key Research Trends: Recent work focuses on domain adaptation under label/misingness shifts, robust gradient estimation, smooth optimal transport maps, and conditional independence testing. He explores minimax optimal methods, univariate mean estimation, and high-dimensional regression with missing data. Scientific Awards: IMS Lawrence D. Brown Student Award (2021, 2020) NVIDIA Pioneer Award (2018) Franklin V. Taylor Memorial Best Paper Award (2018) Grants and Editorial Roles: NSF grants (CCF-1763734, DMS-1713003, DMS-2113684, DMS-2310632), Amazon Research Award (2021), Google Research Scholar Award (2021). Associate Editor for JASA and JRSSB ; Editorial Board member for Foundations and Trends in Statistics . Collaborative Groups: Co-organizes the Statistics and Machine Learning Reading Group and participates in the Causal Inference Working Group at CMU.
David Hong is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Delaware. He holds a PhD from the University of Michigan, where he was an NSF Graduate Research Fellow, and previously served as an NSF Postdoctoral Research Fellow at the University of Pennsylvania. His research focuses on developing robust methods for analyzing heterogeneous and high-dimensional data, particularly through low-rank matrix and tensor techniques. Applications span medical imaging, radar systems, genomics, and astronomy. He emphasizes theoretical guarantees and practical algorithms for signal extraction and inverse problems. Education: PhD in Electrical Engineering and Computer Science (University of Michigan), NSF Postdoctoral Research Fellowship (University of Pennsylvania). Research Interests: Low-rank matrix/tensor methods, heterogeneous data analysis, unsupervised learning, and applications in healthcare, imaging, and sensor systems. His work addresses noise robustness, scalable algorithms, and real-world deployment challenges. Scientific Awards: Recipient of the NSF Postdoctoral Research Fellowship (2020) and NSF Graduate Research Fellowship (2015). Advising & Grants: Advisor to graduate students in machine learning and signal processing (no named advisees listed). Active NSF grant recipient for foundational and applied research in data science. Labs/Teams: Engaged in interdisciplinary collaborations through the University of Delaware's Center for Computational Research and Data Science initiatives.
Arya Mazumdar is a tenured Professor of Data Science and Computer Science at the Halıcıoğlu Data Science Institute (HDSI) , part of the School of Computing, Information and Data Sciences at the University of California San Diego (UCSD). He also holds affiliations with the Computer Science and Engineering and Electrical and Computer Engineering departments at UCSD. Previously, he was an Assistant and Associate Professor at the University of Massachusetts Amherst (2015–2021), and held a postdoctoral position at MIT (2011–2012). He is an IEEE Distinguished Lecturer (2023–2024) and recipient of the NSF CAREER Award (2015–2020). Education : PhD in 2011 from the University of Maryland, College Park (advisor: Alexander Barg) Postdoctoral scholar at MIT (2011–2012, advisor: Greg Wornell) Internships at IBM Almaden (2010) and HP Labs (2008) Research Interests : Focus on algorithmic and statistical aspects of machine learning, error-correcting codes, optimization, signal processing, and distributed systems. Key areas include clustering algorithms, compressed sensing, federated learning, and information-theoretic foundations of data science. He has contributed to theoretical guarantees for learning mixtures, distributed optimization, and robust coding schemes. Recent Articles Trends : Recent work emphasizes distributed optimization (e.g., vqSGD, Byzantine-resilient algorithms), sparse recovery in high-dimensional models, and theoretical foundations of learning (e.g., support recovery, parameter estimation). His research bridges information theory and machine learning, with applications in storage systems and large-scale data processing. Awards & Roles : 2020 EURASIP JASP Best Paper Award Co-PI and co-leader of the NSF AI Institute for Learning-Enabled Optimization at Scale Editorships: IEEE Transactions on Information Theory and Foundations and Trends in Communications Grants & Labs : Leads the EnCORE Institute as UCSD Site Lead, focusing on theoretical perspectives of large language models and computational-statistical gaps. Active in organizing workshops on topics like LLMs, clustering, and distributed optimization. His research is funded by NSF and industry collaborations. Teaching : Courses include Algorithms for Data Science , Probability and Statistics for Data Science , and Coding Theory , emphasizing foundational theory and scalable methods.
Carlo Baldassi is an Associate Professor at Bocconi University, where he has served as Director of the BSc in Mathematical and Computing Sciences for Artificial Intelligence (BAI) since 2023/24. He holds a background in Theoretical Physics from the University of Trieste and a PhD in Computational Neuroscience from the University of Turin. His research focuses on applying Statistical Mechanics to Machine Learning and Neural Networks, particularly studying loss landscapes, optimization problems, and the role of quantum annealing in nonconvex learning. He teaches courses in Machine Learning, Artificial Intelligence, and Computer Science, emphasizing Python and Julia programming. His work bridges theoretical physics and AI, exploring topics like synaptic stochasticity in low-precision neural networks and the efficiency of quantum vs. classical annealing. He has published extensively in top journals such as Physical Review Letters and Proceedings of the National Academy of Sciences , contributing to foundational understanding of neural network dynamics and optimization techniques. Teaching includes Machine Learning and Artificial Intelligence Computer Science I Machine Learning II Machine Learning and Artificial Intelligence Lab Research emphasizes large-scale inference problems, with a focus on the interplay between statistical mechanics and modern AI architectures.
