Piotr Indyk
40 papers · 2009–2025 · 10 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+13 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot (10) π Interdisciplinary Bridge π§ Keyword Pioneer π Academic Marathon (16)
π£
Hot Topic Early Bird
πΊοΈ
Taxonomy Completionist
(50)
π
Conference Polyglot
(10)
π¬
Deep Specialist
(10)
π§¬
Topic Evolution
π
Keyword Champion
(2)
π€
Dynamic Duo
(14)
π
Triple Crown
ποΈ
Keyword Collector
(150)
β‘
Prolific Year
(8)
π
Century Club
(40)
π₯
Unstoppable
(11)
π
Trend Setter
Conferences
NIPS (16)
ICML (10)
ICLR (6)
COLT (2)
AISTATS (1)
ALT (1)
CVPR (1)
IJCAI (1)
JMLR (1)
WACV (1)
Top co-authors
Keywords
sample complexity
(4)
approximate algorithm
(3)
nearest neighbor search
(3)
sublinear algorithm
(3)
high-dimensional datum
(3)
density estimation
(3)
approximation algorithm
(3)
matrix factorization
(2)
data structure
(2)
query time
(2)
online algorithm
(2)
competitive ratio
(2)
generalization bound
(2)
streaming algorithm
(2)
locality-sensitive hashing
(2)
distribution testing
(2)
low-rank approximation
(2)
low rank approximation
(2)
compressed sensing
(2)
approximate nearest neighbor search
(2)
Papers
Optimal and learned algorithms for the online list update problem with Zipfian accesses
ALT 2025
Contradiction Retrieval via Contrastive Learning with Sparsity
ICML 2025
Graph-Based Algorithms for Diverse Similarity Search
ICML 2025
Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
ICLR 2025
Statistical-Computational Trade-offs for Density Estimation
NIPS 2024
Optimal Algorithms for Augmented Testing of Discrete Distributions
NIPS 2024
Differentially Private Approximate Near Neighbor Counting in High Dimensions
NIPS 2023
Near-Linear Time Algorithm for the Chamfer Distance
NIPS 2023
Data Structures for Density Estimation
ICML 2023
Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation
ICLR 2023
Addressing Feature Suppression in Unsupervised Visual Representations
WACV 2023
Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations
NIPS 2023
Targeted Supervised Contrastive Learning for Long-Tailed Recognition
CVPR 2022
(Optimal) Online Bipartite Matching with Degree Information
NIPS 2022
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks
NIPS 2022
Faster Linear Algebra for Distance Matrices
NIPS 2022
Online Page Migration with ML Advice
AISTATS 2022
Generalization Bounds for Data-Driven Numerical Linear Algebra
COLT 2022
Triangle and Four Cycle Counting with Predictions in Graph Streams
ICLR 2022
Streaming Algorithms for Support-Aware Histograms
ICML 2022
Few-Shot Data-Driven Algorithms for Low Rank Approximation
NIPS 2021
Learning-based Support Estimation in Sublinear Time
ICLR 2021
Faster Kernel Matrix Algebra via Density Estimation
ICML 2021
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering
ICML 2021
Learning Space Partitions for Nearest Neighbor Search
ICLR 2020
Scalable Nearest Neighbor Search for Optimal Transport
ICML 2020
Learning-Based Low-Rank Approximations
NIPS 2019
Space and Time Efficient Kernel Density Estimation in High Dimensions
NIPS 2019
Estimating Entropy of Distributions in Constant Space
NIPS 2019
Scalable Fair Clustering
ICML 2019
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
ICML 2019
Learning-Based Frequency Estimation Algorithms
ICLR 2019
Approximate Nearest Neighbors in Limited Space
COLT 2018
Practical Data-Dependent Metric Compression with Provable Guarantees
NIPS 2017
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks
NIPS 2017
A Nearly-Linear Time Framework for Graph-Structured Sparsity
IJCAI 2016
Fast recovery from a union of subspaces
NIPS 2016
A Nearly-Linear Time Framework for Graph-Structured Sparsity
ICML 2015
Practical and Optimal LSH for Angular Distance
NIPS 2015
Learning Approximate Sequential Patterns for Classification
JMLR 2009