Co-occurring keywords · papers mentioning both
Papers
Faster Differentially Private Top-k Selection: A Joint Exponential Mechanism with Pruning
NeurIPS 2024
Optimal Hypothesis Selection in (Almost) Linear Time
NeurIPS 2024
BanditPAM++: Faster k-medoids Clustering
NeurIPS 2023
Fast Attention Requires Bounded Entries
NeurIPS 2023
Tighter Analysis for ProxSkip
ICML 2023
On the Efficiency of Entropic Regularized Algorithms for Optimal Transport
JMLR 2022
Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis
NeurIPS 2022
Almost Linear Time Density Level Set Estimation via DBSCAN
AAAI 2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness
NeurIPS 2021
Training Neural Networks is ER-complete
NeurIPS 2021
Fast Lexically Constrained Decoding with Dynamic Beam Allocation for Neural Machine Translation
NAACL 2018
A General Characterization of the Statistical Query Complexity
COLT 2017
Improved and Generalized Upper Bounds on the Complexity of Policy Iteration
NeurIPS 2013