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.

Publications

• Dong, Y., Indyk, P., Razenshteyn, I., Wagner, T. (2020). Learning Sublinear-Time Indexing for Nearest Neighbor Search. Eighth International Conference on Learning Representations (ICLR).
• Indyk, P., Mahabadi, S., Gharan, S.O., Rezaei, A. (2020). Composable core-sets for determinant maximization problems via spectral spanners. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1675-1694.
• Backurs, A. Indyk, P.,  Onak, K., Schieber,  B., Vakilian, A., Wagner, T.  (2019). Scalable Fair Clustering. Thirty-sixth International Conference on Machine Learning (ICML).
• Hsu, C.Y., Indyk, P., Katabi, D., Vakilian, A., (2019). Learning-Based Frequency Estimation Algorithms. Seventh International Conference on Learning Representations (ICLR).

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.