conftrace_

sublinear time

15 papers

Explore in graph

Co-occurring keywords

determinantal point process (140) approximation algorithm (630) maximum inner product search (29) sublinear algorithm (25) sampling algorithm (130) sublinear time algorithms (9) approximate nearest neighbor (88) low-rank approximation (323) matrix factorization (529) combinatorial optimization (1039)

Papers

Semi-Random Sparse Recovery in Nearly-Linear Time COLT 2023
Rejection sampling from shape-constrained distributions in sublinear time AISTATS 2022
Linear Bandit Algorithms with Sublinear Time Complexity ICML 2022
Optimization from Structured Samples for Coverage Functions ICML 2020
MAP Inference for Customized Determinantal Point Processes via Maximum Inner Product Search AISTATS 2020
Exact sampling of determinantal point processes with sublinear time preprocessing NIPS 2019
Learning Determinantal Point Processes in Sublinear Time AISTATS 2018
Sublinear Time Low-Rank Approximation of Distance Matrices NIPS 2018
Approximation Algorithms for $\ell_0$-Low Rank Approximation NIPS 2017
Probabilistic Submodular Maximization in Sub-Linear Time ICML 2017
Recycling Randomness with Structure for Sublinear time Kernel Expansions ICML 2016
Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS) NIPS 2014
Beating SGD: Learning SVMs in Sublinear Time NIPS 2011
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning NIPS 2010