Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox

Picture for Piotr Indyk

Faster Kernel Matrix Algebra via Density Estimation


Feb 16, 2021
Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner


  Access Paper or Ask Questions

Online Page Migration with ML Advice


Jun 09, 2020
Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrović, Ronitt Rubinfeld


  Access Paper or Ask Questions

Estimating Entropy of Distributions in Constant Space


Nov 18, 2019
Jayadev Acharya, Sourbh Bhadane, Piotr Indyk, Ziteng Sun

* NeurIPS 2019 

  Access Paper or Ask Questions

Learning-Based Low-Rank Approximations


Oct 30, 2019
Piotr Indyk, Ali Vakilian, Yang Yuan

* NeurIPS 2019 

  Access Paper or Ask Questions

Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm


Jul 06, 2019
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei

* This paper has appeared in the 36th International Conference on Machine Learning (ICML), 2019. This is an equal contribution paper 

  Access Paper or Ask Questions

Sample-Optimal Low-Rank Approximation of Distance Matrices


Jun 02, 2019
Piotr Indyk, Ali Vakilian, Tal Wagner, David Woodruff

* COLT 2019 

  Access Paper or Ask Questions

Scalable Fair Clustering


Feb 10, 2019
Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner


  Access Paper or Ask Questions

Learning Sublinear-Time Indexing for Nearest Neighbor Search


Jan 24, 2019
Yihe Dong, Piotr Indyk, Ilya Razenshteyn, Tal Wagner

* 14 pages, 7 figures 

  Access Paper or Ask Questions

Composable Core-sets for Determinant Maximization Problems via Spectral Spanners


Jul 31, 2018
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei


  Access Paper or Ask Questions

Approximate Nearest Neighbor Search in High Dimensions


Jun 26, 2018
Alexandr Andoni, Piotr Indyk, Ilya Razenshteyn

* 27 pages, no figures; to appear in the proceedings of ICM 2018 (accompanying the talk by P. Indyk) 

  Access Paper or Ask Questions

On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks


Apr 10, 2017
Arturs Backurs, Piotr Indyk, Ludwig Schmidt


  Access Paper or Ask Questions

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform


Apr 28, 2015
Mahdi Cheraghchi, Piotr Indyk


  Access Paper or Ask Questions