Cover Image

Finer-Grained Hardness of Kernel Density Estimation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alman, Josh, Guan, Yunfeng
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stochastic Rounding 2.0, with a View towards Complexity Analysis
by: Drineas, Petros, et al.
Published: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
by: Chen, Tyler
Published: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
by: Netay, Igor V.
Published: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
by: Chen, Tyler, et al.
Published: (2024)

Fixed-sparsity matrix approximation from matrix-vector products
by: Amsel, Noah, et al.
Published: (2024)

Analysis of Different Algorithmic Design Techniques for Seam Carving
by: Aijaz, Owais, et al.
Published: (2024)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
by: Musco, Cameron, et al.
Published: (2024)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
by: Suslo, Tomasz
Published: (2005)

Stability of the Lanczos Method for Matrix Function Approximation
by: Musco, Cameron, et al.
Published: (2017)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
by: Amsel, Noah, et al.
Published: (2026)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
by: Bentert, Matthias, et al.
Published: (2025)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
by: Balabanov, Oleg, et al.
Published: (2022)

Sublinear Time Low-Rank Approximation of Hankel Matrices
by: Kapralov, Michael, et al.
Published: (2025)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
by: Larsen, Brett W., et al.
Published: (2022)

Fast algorithms for least square problems with Kronecker lower subsets
by: Malik, Osman Asif, et al.
Published: (2022)

Preserving Extreme Singular Values with One Oblivious Sketch
by: Mango, John M., et al.
Published: (2025)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
by: Doney, Kyle, et al.
Published: (2025)

Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
by: Alman, Josh, et al.
Published: (2024)

Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
by: Saak, Jens, et al.
Published: (2023)

Asymptotic Rank Speedup Theorems, Revisited
by: Alman, Josh, et al.
Published: (2026)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
by: Alman, Josh, et al.
Published: (2025)

Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum
by: Alman, Josh, et al.
Published: (2025)

The Fine-Grained Complexity of Gradient Computation for Training Large Language Models
by: Alman, Josh, et al.
Published: (2024)

Faster exact learning of k-term DNFs with membership and equivalence queries
by: Alman, Josh, et al.
Published: (2025)

Sinkhorn Algorithm for Sequentially Composed Optimal Transports
by: Watanabe, Kazuki, et al.
Published: (2024)

On the Robustness of the Successive Projection Algorithm
by: Barbarino, Giovanni, et al.
Published: (2024)

Distributed Least Squares in Small Space via Sketching and Bias Reduction
by: Garg, Sachin, et al.
Published: (2024)

Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
by: Jambulapati, Arun, et al.
Published: (2024)

A square root algorithm faster than Newton's method for multiprecision numbers, using floating-point arithmetic
by: Romano, Fabio
Published: (2024)

Quantum Realization of the Finite Element Method
by: Deiml, Matthias, et al.
Published: (2024)

Quantum linear system algorithm with optimal queries to initial state preparation
by: Low, Guang Hao, et al.
Published: (2024)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
by: Cai, Xufeng, et al.
Published: (2025)

The matrix-vector complexity of $Ax=b$
by: Dereziński, Michał, et al.
Published: (2026)

Internal versus external balancing in the evaluation of graph-based number types
by: Geppert, Hanna, et al.
Published: (2019)

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $MAM^*$!
by: Boahen, Edem, et al.
Published: (2025)

Permutation-Avoiding FFT-Based Convolution
by: Venkovic, Nicolas, et al.
Published: (2025)

Optimal Embedding Dimension for Sparse Subspace Embeddings
by: Chenakkod, Shabarish, et al.
Published: (2023)

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
by: Chenakkod, Shabarish, et al.
Published: (2026)

Block Encoding of Sparse Matrices via Coherent Permutation
by: Setty, Abhishek
Published: (2025)