Chun-Hua Guo is a Professor in the Department of Mathematics and Statistics at the University of Regina, Faculty of Science. His research focuses on matrix analysis, scientific computing, and applications in tensor computations and nonlinear matrix equations. He teaches advanced courses such as MATH 869 Numerical Analysis. Dr. Guo’s recent work emphasizes iterative methods for solving eigenvalue problems of nonnegative tensors, matrix equations arising in nano research, and convergence analysis of numerical algorithms. His publications address topics like Newton-Noda iteration, modified Newton methods for Z-eigenpairs, and algebraic Riccati equations associated with M-matrices. His research trends highlight advancements in computational techniques for matrix functions (e.g., matrix pth root), tensor Perron pairs, and stability analysis of iterative algorithms. These contributions bridge theoretical linear algebra with practical computational challenges in engineering and scientific domains. Dr. Guo’s advising and grants involve developing efficient numerical methods for complex systems. His work has implications for fields requiring high-precision matrix computations, such as control theory, stochastic modeling, and nano-material simulations.
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.
Ming Yuan is a Professor in the Department of Statistics at Columbia University and serves as Associate Director of the Data Science Institute. His research focuses on high-dimensional statistics, machine learning, and statistical methodology with applications in genomics, finance, and imaging. Yuan holds a Ph.D. in Statistics from the University of Wisconsin-Madison (2004) and a B.S. in Electrical Engineering from the University of Science and Technology of China (1997). Education: 2004 Ph.D., Statistics, University of Wisconsin-Madison 2003 M.S., Computer Science, University of Wisconsin-Madison 2000 M.S., Probability and Statistics, University of Science and Technology of China 1997 B.S., Electrical Engineering, University of Science and Technology of China Research Interests: Dr. Yuan’s work bridges theoretical and applied statistics, emphasizing scalable methods for high-dimensional data. Key areas include tensor decomposition, covariance estimation, and statistical machine learning. His contributions to methods like sparse inverse covariance estimation and matrix/tensor completion have found applications in finance, genomics, and image analysis. Publications: His recent work explores tensor-based methods for high-dimensional analysis and develops optimal algorithms for compressed sensing. Articles often address statistical theory and computational challenges in modern data science, reflecting a balance between foundational and applied research. Awards: 2025 JASA Theory & Method Invited Discussion Paper 2024 William F. Sharpe Award (JFQA) 2018 Medallion Lecturer (Institute of Mathematical Statistics) 2014 Guy Medal in Bronze (Royal Statistical Society) 2007 Leo Breiman Junior Award Professional Activities: Yuan has served as Co-Editor of The Annals of Statistics (2019–2021) and Program Secretary for the Institute of Mathematical Statistics (2018–2021). His work integrates interdisciplinary collaborations, particularly in biomedical imaging and financial econometrics.
Elizaveta Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University. She is also associated with the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Education: Specialist degree from Moscow State University (2012), PhD in Mathematics from University of Michigan (2018 under Roman Vershynin) Prior Appointments: Postdoctoral Scholar at Lawrence Berkeley National Lab (2021), Assistant Adjunct Professor at UCLA Mathematics Department (2018-2021) Her research focuses on randomized numerical linear algebra , mathematics of data science , and high-dimensional probability . Key interests include developing algorithms for large-scale data with non-trivial structure, robust and interpretable learning, and stochastic optimization. Her recent work analyzes algorithmic convergence in structured settings, tensor-based data compression, and nonnegative matrix/tensor factorization under constraints. Recent publications span topics in randomized NLA , robust solvers , tensor methods , and nonnegative matrix factorization . Notable trends include improving convergence rates for iterative methods, handling adversarial noise in linear systems, and leveraging tensor structures for efficient data recovery. She supervises Ph.D. students including Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko. Her teaching at Princeton covers graduate probability theory (ORF526), convex optimization (ORF523), and network science (ORF387), with prior teaching roles at UCLA and University of Michigan.
T. N. Vijaykumar is a Professor of Electrical and Computer Engineering at Purdue University's Elmore Family School of Electrical and Computer Engineering. His research focuses on computer architecture, VLSI design, and hardware acceleration for machine learning and datacenter systems. He holds a B.E. (Hons) in Electrical and Electronics Engineering and M.Sc.(Tech) in Computer Science from Birla Institute of Technology and Science, followed by M.S. and Ph.D. in Computer Science from the University of Wisconsin. His work spans GPU architecture optimization, memory systems, network security, and energy-efficient computing. Notable contributions include sparse tensor accelerators, disaggregated datacenter architectures, and secure speculative execution techniques. He has been actively involved in developing accelerators for machine learning inference and frameworks for distributed training of neural radiance fields. His publications address challenges in parallel computing, hardware-software co-design, and real-time systems, with applications in robotics, genomics, and microfluidics. He leads research initiatives funded by NSF and industry partnerships, emphasizing cross-layer optimizations across hardware, software, and networking layers.
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.
Dr. Vijayaraghavan Aravindan is an Associate Professor in the Department of Computer Science at Northwestern University, with a courtesy appointment in Industrial Engineering & Management Sciences. He is a core member of the Theory CS Group and serves as the Site Director for the NSF-funded Institute for Data, Economics, Algorithms, and Learning (IDEAL). His research focuses on theoretical computer science, particularly algorithmic foundations of machine learning, quantum information, and beyond worst-case analysis. Education: Ph.D. and M.A. in Computer Science, Princeton University B.Tech. in Computer Science and Engineering, Indian Institute of Technology Madras Research Interests: His work bridges theoretical computer science and machine learning, emphasizing efficient algorithms for high-dimensional data, quantum entanglement certification, and adversarial robustness. He explores paradigms such as smoothed analysis and stability-based approaches to provide practical algorithmic guarantees. Awards & Grants: NSF CAREER Award Google Research Scholar NSF AITF Grants (CCF-1637585, CCF-2154100) Advising & Teaching: He advises PhD students on topics like quantum computing, robust machine learning, and optimization. Courses taught include graduate algorithms, theoretical foundations of data science, and quantum computation. His lab collaborates on projects at IDEAL and with institutions like Carnegie Mellon University and TTI Chicago. Professional Leadership: Served as FOCS 2024 General Chair and organizes the McCormick Theory Workshops. Active on program committees for ICML, COLT, and NeurIPS.
Chen Xu is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa. He holds an M.A. from York University and a PhD from the University of British Columbia. His research focuses on sparse modeling, statistical learning, and big data processing, with an emphasis on both theoretical and computational advancements. Dr. Xu is affiliated with the Faculty of Science and contributes to editorial roles for journals such as the Journal of the American Statistical Association and Electronic Journal of Statistics. Education: M.A., York University PhD, University of British Columbia Research interests include feature selection, regularization methods, kernel methods, and high-dimensional regression. His work addresses computational challenges in big data, proposing efficient algorithms for tasks like singular value decomposition, clustering, and distributed feature screening. Recent publications highlight advancements in multiview PCA, low-tubal-rank tensor recovery, and model-free regression techniques. Publications span prestigious journals like the Journal of the American Statistical Association and IEEE Transactions series, focusing on statistical methodology, machine learning applications, and scalable computational solutions for complex data problems. Editorial Service: Associate Editor, Journal of American Statistical Association-T&M (2023–present) Associate Editor, Electronic Journal of Statistics (2023–present) Former Associate Editor, The Canadian Journal of Statistics (2019–2021) His research groups are Statistics and Biostatistics, and Data Science, Machine Learning, and Artificial Intelligence. He has no listed awards but maintains active editorial and academic collaborations in computational statistics and machine learning.
Soledad Villar is an Assistant Professor in the Department of Applied Mathematics and Statistics and a member of the Mathematical Institute for Data Science at Johns Hopkins University. She also contributes to the Data Science and AI Institute . Her research focuses on computational methods for extracting information from data, emphasizing optimization for data science, machine learning, equivariant representation learning, and graph neural networks. Dr. Villar holds a PhD in Mathematics from the University of Texas at Austin and has been a research fellow at New York University and the Simons Institute at UC Berkeley. Her work bridges theoretical foundations with practical applications in fields like scientific computing and political analysis. Awards include the National Science Foundation CAREER Award (2024). Her research has addressed topics such as gerrymandering detection, fluid dynamics modeling, and graph representation learning. She collaborates on interdisciplinary projects and organizes academic events like the One World MINDS Seminar and the Cibercoloquio Latinoamericano de Matemáticas . Her research interests span computational methods, equivariant machine learning frameworks, and graph neural networks, with applications in physics, engineering, and data-driven decision-making. She actively engages in advancing machine learning techniques for scientific and engineering challenges.
Eric F. Lock is an Associate Professor in the Division of Biostatistics & Health Data Science at the University of Minnesota's School of Public Health. He is also a Member of the Masonic Cancer Center (MCC) and has been at the University of Minnesota since 2014, after completing his PhD in Statistics from the University of North Carolina in 2012 and a postdoctoral fellowship in Statistical Genomics at Duke University in 2014. Lock's research focuses on developing methods for the analysis of multi-faceted high-dimensional data, particularly in "omics" fields such as genomics, metabolomics, and proteomics. His work emphasizes the integrated analysis of data from multiple sources (e.g., gene expression, metabolomics, imaging) or measured in multiple dimensions (e.g., multiple tissue types or body regions). He also specializes in exploratory factorization and clustering methods, and Bayesian nonparametric inference. His recent publications demonstrate significant contributions to tensor data imputation (BAMITA), matrix decomposition (EV-BIDIFAC), and methods for handling complex genomic data. His work bridges statistical theory with practical applications in molecular biology, addressing challenges in data integration across multiple biological measurement platforms. Delta Omega, Honorary Society in Public Health (2019) As an active researcher and educator, Lock serves on dissertation committees, including for Mykhaylo M. Malakhov who recently defended his PhD at the University of Minnesota School of Public Health. He is involved in organizing and participating in major conferences such as STATGEN 2025, demonstrating his leadership in the biostatistics community.
David Sherman is an Associate Professor in the Department of Mathematics at the University of Virginia, part of the College of Arts & Sciences. His research focuses on functional analysis and operator algebras, with specialized interests in noncommutative L p spaces, operator theory within von Neumann algebras, model theory of operator algebras, and noncommutative convexity. He has contributed to foundational studies of noncommutative L p spaces, isometries between operator algebras, and applications of logic to operator algebras. Recent teaching includes advanced calculus, linear algebra, and operator theory courses. His work bridges pure mathematics with interdisciplinary themes, such as applying set-theoretic methods to algebraic structures and exploring connections between operator algebras and logic. Sherman has co-authored significant papers on topics like support expansion C*-algebras and quantization of coarse spaces, reflecting his expertise in modern operator theory. His research outputs emphasize structural properties of operator algebras, with notable contributions to the classification of II₁ factors and model-theoretic approaches to noncommutative systems. While no specific awards are listed, his extensive publication record and teaching roles highlight his academic impact. Sherman maintains administrative involvement in undergraduate mathematics programs and graduate initiatives at UVA.
Rameshwar Pratap is an Associate Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Hyderabad (IIT Hyderabad). Previously, he served as an Assistant Professor at the School of Computing and Electrical Engineering, IIT Mandi for three years. Education: Ph.D. in Theoretical Computer Science, Chennai Mathematical Institute Research Interests: His research lies at the intersection of theory and practice, focusing on extremely simple yet practical approximation algorithms with provable guarantees . Key themes include: Sketching and dimensionality reduction algorithms for tensors and similarity measures Improving speed, scalability, and accuracy of existing sketching methods Applications in machine learning: node embedding in large-scale networks, itemset mining, model compression He extensively employs techniques from matrix and tensor algebra, sampling, random projection, and randomized hashing . Publications Overview: Across 2021–2025 his work has appeared in top venues such as IEEE Globecom, Theoretical Computer Science, Acta Informatica, Information Processing Letters, Algorithmica, UAI, ICALP, Machine Learning, TKDE, and ACML. Recurring themes are randomized sketching, locality-sensitive hashing, compressed matrix multiplication, variance reduction, and subspace approximation , demonstrating both theoretical depth and practical impact. Awards & Honors: Early Career Research Grant (PM-ECRG) 2025, Anusandhan National Research Foundation (ANRF) Best Paper Award, COCOON 2020 Students & Funding: First Ph.D. student: Bhisham Dev Verma (co-advised with Prof. Manoj Thakur) graduated June 2025 MS by Research student: Punit Pankaj Dubey graduated October 2022 Currently hiring 1 Junior Research Fellow for the PM-ECRG project “Improving Similarity Search in Practice” Labs & Teams: Works within the Algorithms & Theory group at IIT Hyderabad, collaborating with national and international researchers. Erdös number is 3.
Konrad Kowalczyk is an Associate Professor at AGH University of Science and Technology in Krakow, Poland, where he heads the Signal Processing Group within the Faculty of Computer Science, Electronics and Telecommunications. With extensive international experience from institutions including Queen's University Belfast, Stanford University, and Fraunhofer Institute, he has established himself as a leading researcher in audio and speech signal processing. His academic journey includes B.Eng. and M.Sc. degrees from AGH University (2005), a Ph.D. from Queen's University Belfast (2009), and a Habilitation in ICT from AGH University (2020). B.Eng. and M.Sc. in Electronics and Telecommunications, AGH University of Krakow (2005) Ph.D. in Electronics, Queen's University Belfast, UK (2009) Habilitation (D.Sc.) in Information and Communication Technology, AGH University of Krakow (2020) Kowalczyk's research spans multiple cutting-edge areas in audio processing, with particular focus on speech and audio signal processing enhanced by machine learning techniques. His work integrates deep neural networks with traditional signal processing methods to address challenges in array signal processing , speech enhancement , and speaker recognition . The research group he leads explores innovative applications in distributed signal processing for IoT , acoustic event detection , and spatial audio rendering , bridging theoretical advances with practical implementations. His recent publications demonstrate a clear trend toward integrating deep learning with traditional signal processing techniques, particularly in speaker diarization, source separation, and robust speech recognition. The research increasingly focuses on real-world applications requiring reverberation-robust processing , distributed microphone array systems , and end-to-end neural architectures that can operate in challenging acoustic environments. There's a noticeable shift toward more complex, integrated systems that combine multiple signal processing tasks. Stanislaw Staszic Medal for best graduate of AGH (2005) IEEE Best Student Paper Contest finalist (2007) AES Student Technical Paper Award winner (2008) Best Student Paper Award at IWAENC conference (2014) Best Paper Awards at IEEE SPA conferences (2016, 2019) Polish Ministry of Science Scholarship for Distinguished Young Scientists (2016-2019) Prime Minister Award for outstanding scientific achievements (2020) As Principal Investigator, Kowalczyk leads multiple significant research projects including "Acoustic Intelligence" (2024-2028) funded by National Science Center, and "Deep extraction for robust speech recognition" (2023-2028). He has successfully secured funding from prestigious programs including First TEAM from the Foundation for Polish Science, and EU FP7 projects. His research group actively supervises Ph.D., M.Sc., and B.Eng. students, with strong connections to international institutions including Aalto University and IEEE Signal Processing Society. The research output includes numerous journal publications, conference papers, patents, and software implementations that have advanced the field of audio signal processing. Kowalczyk leads the Signal Processing Group at AGH University, which focuses on developing innovative solutions for speech and audio processing challenges. The group maintains strong collaborations with international institutions including Aalto University (Finland), and participates in European research initiatives. Their work spans theoretical development through practical implementation, with applications ranging from medical voice assistants to distributed acoustic sensor networks.
Dr. HanQin Cai is the Paul N. Somerville Endowed Assistant Professor in the Department of Statistics and Data Science at the University of Central Florida (UCF), also serving as Director of the Data Science Lab. He holds a joint appointment with the Department of Computer Science. His research focuses on theoretical and algorithmic foundations of mathematical optimization, data science, and machine learning, with emphasis on non-convex algorithms, adversarial attacks, signal/image processing, and deep learning integration. He has secured NSF grants totaling over $2.6M, including a $121K single-PI grant and a $2.49M co-PI grant. His work has been recognized with the UCF OSCaR Award (2025) and IEEE Senior Member status (2024). Education: PhD in Applied Mathematical and Computational Sciences from University of Iowa (2018), with M.S. in Mathematics (2014) and M.C.S. in Computer Science (2017). Previously served as a Postdoc at UCLA Mathematics Department under Dr. Wotao Yin. Research highlights include: query-efficient zeroth-order optimization, robust signal processing with corrupted data, adversarial attacks on neural networks, and tensor-based methods for high-dimensional data analysis. His recent publications explore advanced techniques in matrix recovery, tensor decompositions, and explainable AI. Grants & Awards: NSF DMS-2304489 (2022–2025), NSF DUE-2321986 (2024–2029), UCF OSCaR Award, IEEE Senior Membership. Labs & Teams: Directs UCF's Data Science Lab, collaborates across disciplines in statistics, computer science, and engineering.
Alex Gittens is an Assistant Professor in the Department of Computer Science at Rensselaer Polytechnic Institute (RPI), joined in 2017. His research focuses on algorithmic trade-offs between computational efficiency and accuracy in large-scale linear algebra and machine learning contexts. He has expertise in kernel methods, randomized numerical linear algebra, and low-rank approximation techniques. Education: PhD in Applied and Computational Mathematics, Caltech (2013) Industry Postdoc at eBay Research Labs (2013-2015) Postdoctoral Scholar at International Institute of Computer Science (2015-2016) His research explores scalable machine learning algorithms, nonlinear and multilinear sketching applications, and sampling for low-rank tensor/matrix approximation. Current technical interests include attention mechanisms for knowledge graph completion, federated learning trade-offs, and causal inference in adversarial settings. Recent publication trends show active contributions in federated learning (privacy-fairness optimization), causal information extraction (financial text analysis), and adversarial machine learning (robustness-security trade-offs). His work emphasizes trustworthy ML systems and computational efficiency in high-dimensional data processing. Teaching includes foundational discrete mathematics (CSCI 2200) and advanced machine learning courses (CSCI 6968/4968). He offers advising through Slack channels and via email, focusing on course selection, research opportunities, and graduate school preparation.
