conftrace_

algorithm complexity

13 papers

Explore in graph

Co-occurring keywords

learning theory (519) complexity bound (50) lower bound (173) computational complexity (399) convex optimization (1321) top-k selection (20) private algorithm (14) approximate accuracy (1) privacy-preserving algorithm (12) constraint handling (6)

Papers

Faster Differentially Private Top-$k$ Selection: A Joint Exponential Mechanism with Pruning NIPS 2024
Optimal Hypothesis Selection in (Almost) Linear Time NIPS 2024
BanditPAM++: Faster $k$-medoids Clustering NIPS 2023
Tighter Analysis for ProxSkip ICML 2023
Fast Attention Requires Bounded Entries NIPS 2023
Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis NIPS 2022
On the Efficiency of Entropic Regularized Algorithms for Optimal Transport JMLR 2022
Almost Linear Time Density Level Set Estimation via DBSCAN AAAI 2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness NIPS 2021
Training Neural Networks is ER-complete NIPS 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 NIPS 2013