Piotr Indyk

Piotr Indyk is the Thomas D. and Virginia W. Cabot Professor in MIT’s Department of Electrical Engineering and Computer Science. Indyk is also an investigator at the Computer Science and Artificial Intelligence Lab, and a member of the Theory of Computation Group, Wireless@MIT, Big Data@CSAIL, and MIT Institute for Foundations of Data Science. His research interests include high-dimensional computational geometry, including approximate nearest neighbor search, data stream algorithms, sparse recovery, compressive sensing, and machine learning. Indyk earned a degree from Uniwersytet Warszawski, and a PhD from Stanford University.

Selected Publications

• Li, T. et al. (2023) Addressing Feature Suppression in Unsupervised Visual Representations. IEEE CVF Winter Conference on Applications of Computer Vision (WACV).
• Indyk, P. and Silwal, S. (2022) Faster Linear Algebra for Distance Matrices. Conference on Neural Information Processing Systems (NeurIPS)
• Aamand, A. et al. (2022) Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. Conference on Neural Information Processing Systems (NeurIPS)

Media

• April 3, 2019: MIT News, Machine learning moves popular data elements into a bucket of their own.
• Apr 1, 2019: Forbes, Solving ‘The Britney Spears Problem’: Why Finding Trends In Data Is Such A Challenge.
• September 13, 2018: EECS News, Piotr Indyk named to Thomas D. and Virginia W. Cabot Professorship.
• August 28, 2017: CSAIL News, Indyk receives NSF funding for new Institute for Foundations of Data Science.
• August 10, 2015: Boston Globe, For 40 years, computer scientists looked for a solution that doesn’t exist.