sublinear algorithm

Low-degree phase transitions for detecting a planted clique in sublinear time COLT 2024 Quantum algorithm for large-scale market equilibrium computation NeurIPS 2024 Agent-based Graph Neural Networks ICLR 2023 A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time NeurIPS 2023 A Tale of Two Efficient Value Iteration Algorithms for Solving Linear MDPs with Large Action Space AISTATS 2023 Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time IJCAI 2023 Data Structures for Density Estimation ICML 2023 Near-Optimal Quantum Coreset Construction Algorithms for Clustering ICML 2023 SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search AAAI 2023 Sublinear Algorithms for Hierarchical Clustering NeurIPS 2022 Faster Kernel Matrix Algebra via Density Estimation ICML 2021 Fast Sketching of Polynomial Kernels of Polynomial Degree ICML 2021 Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces NeurIPS 2021 Sublinear Classical and Quantum Algorithms for General Matrix Games AAAI 2021 Composable Sketches for Functions of Frequencies: Beyond the Worst Case ICML 2020 A Bandit Approach to Maximum Inner Product Search AAAI 2019 Sample-Optimal Low-Rank Approximation of Distance Matrices COLT 2019 Sublinear quantum algorithms for training linear and kernel-based classifiers ICML 2019 Sublinear Time Nearest Neighbor Search over Generalized Weighted Space ICML 2019 Robust Subspace Approximation in a Stream NeurIPS 2018 Sublinear Time Low-Rank Approximation of Distance Matrices NeurIPS 2018 Approximation Algorithms for ℓ_0-Low Rank Approximation NeurIPS 2017 Sublinear Time Orthogonal Tensor Decomposition NeurIPS 2016 Faster Algorithms for Testing under Conditional Sampling COLT 2015 Practical and Optimal LSH for Angular Distance NeurIPS 2015