- Algorithms for Big Data
- Theoretical Foundations of Machine Learning
- Quantum Information and Computing
- +۴ مورد دیگر
Roles and Affiliations: Professor of Computer Science at Indiana University Bloomington, Adjunct Professor in Mathematics. Previously at IBM Almaden Research Center and Aarhus University's Center for Massive Data Algorithmics. PhD from HKUST in Computer Science and Engineering. Education: PhD in Computer Science, HKUST, advised by Mordecai Golin and Ke Yi Research Interests: Focuses on algorithms for big data, including communication-efficient distributed computation, streaming/sketching algorithms, and quantum data management. Explores theoretical foundations of machine learning, particularly distributed learning. Leads projects funded by NSF grants on parallel reinforcement learning, distributed graph algorithms, and noisy data processing. Publications and Awards: Over 100 papers in top venues like FOCS, SIGMOD, and NeurIPS. Won the Best Paper Award at SPAA 2017 for distributed clustering work. Invited to special journal issues for top conferences. Teaching and Grants: Teaches advanced courses on sublinear algorithms and algorithm design. PI on NSF grants totaling over $2M, including collaborative projects on distributed computing and epidemiological modeling. Advises PhD students in areas like quantum algorithms and reinforcement learning. Service: Served on program committees for SIGMOD, NeurIPS, ICML, and PODS. Organizes theory seminars and Midwest Theory Day workshops.



