Co-occurring keywords · papers mentioning both
Papers
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
ICML 2024
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
ICML 2023
Compress Then Test: Powerful Kernel Testing in Near-linear Time
AISTATS 2023
Near-Linear Time Algorithm for the Chamfer Distance
NeurIPS 2023
Bring Your Own Algorithm for Optimal Differentially Private Stochastic Minimax Optimization
NeurIPS 2022
Dynamic visualization for L1 fusion convex clustering in near-linear time
UAI 2021
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
ICML 2021
Fast and Accurate k-means++ via Rejection Sampling
NeurIPS 2020
Average Case Column Subset Selection for Entrywise ℓ_1-Norm Loss
NeurIPS 2019
Unified Sample-Optimal Property Estimation in Near-Linear Time
NeurIPS 2019
Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms
COLT 2018
Computation-Risk Tradeoffs for Covariance-Thresholded Regression
ICML 2013