Faster Kernel Matrix Algebra via Density Estimation

Faster Kernel Matrix Algebra via Density Estimation

Bibliographic Details
Main Authors:	Backurs, Arturs, Indyk, Piotr, Musco, Cameron, Wagner, Tal
Other Authors:	Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format:	Article
Language:	English
Published:	2022
Online Access:	https://hdl.handle.net/1721.1/143598

Similar Items

Space and time efficient kernel density estimation in high dimensions
by: Indyk, Piotr, et al.
Published: (2021)

On the fine-grained complexity of empirical risk minimization: Kernel methods and neural networks
by: Indyk, Piotr, et al.
Published: (2021)

On the fine-grained complexity of empirical risk minimization: Kernel methods and neural networks
by: Indyk, Piotr, et al.
Published: (2021)

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
by: Backurs, Arturs, et al.
Published: (2021)

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
by: Backurs, Arturs, et al.
Published: (2018)

Which Regular Expression Patterns Are Hard to Match?
by: Backurs, Arturs, et al.
Published: (2017)

Scalable Nearest Neighbor Search for Optimal Transport
by: Backurs, Arturs, et al.
Published: (2022)

Better approximations for Tree Sparsity in Nearly-Linear Time
by: Backurs, Arturs, et al.
Published: (2017)

Faster linear algebra for data analysis and machine learning
by: Musco, Christopher Paul
Published: (2018)

Faster GPS via the sparse fourier transform
by: Hassanieh, Haitham, et al.
Published: (2014)

Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
by: Woodruff, David P., et al.
Published: (2018)

Ant-inspired density estimation via random walks
by: Musco, Cameron Nicholas, et al.
Published: (2018)

Below P vs NP : fine-grained hardness for big data problems
by: Backurs, Arturs
Published: (2019)

Better embeddings for Planar Earth-Mover Distance over sparse sets
by: Backurs, Arturs
Published: (2014)

Near-optimal (euclidean) metric compression
by: Indyk, Piotr, et al.
Published: (2018)

A flexible method for estimating luminosity functions via kernel density estimation
by: Yuan, Z, et al.
Published: (2020)

Faster algorithms for matrix scaling and balancing via convex optimization
by: Tsipras, Dimitris
Published: (2017)

The power of randomized algorithms : from numerical linear algebra to biological systems
by: Musco, Cameron N. (Cameron Nicholas)
Published: (2019)

Weakly supervised segment annotation via expectation kernel density estimation
by: Liantao Wang, et al.
Published: (2019-06-01)

Robust Kernel Density Function Estimation
by: Dadkhah, Kourosh
Published: (2010)

The Archaeological Application of Kernel Density Estimates
by: Christian Beardah, et al.
Published: (1996-09-01)

On the fourth-order hybrid beta polynomial kernels in kernel density estimation
by: Benson Ade Eniola Afere
Published: (2024-02-01)

Practical data-dependent metric compression with provable guarantees
by: Indyk, Piotr, et al.
Published: (2019)

Kernel Density Estimators for Axisymmetric Particle Beams
by: Christopher M. Pierce, et al.
Published: (2023-11-01)

Kernel Density Derivative Estimation of Euler Solutions
by: Shujin Cao, et al.
Published: (2023-01-01)

Manifold learning based on kernel density estimation
by: A.P. Kuleshov, et al.
Published: (2018-06-01)

Convolutional kernel function algebra
by: Edward Stow, et al.
Published: (2022-08-01)

Faster Born probability estimation via gate merging and frame optimisation
by: Nikolaos Koukoulekidis, et al.
Published: (2022-10-01)

A Review of Kernel Density Estimation with Applications to Econometrics
by: Adriano Z. Zambom, et al.
Published: (2013-04-01)

Empirical Testing of Fast Kernel Density Estimation Algorithms
by: Lang, D, et al.
Published: (2005)

Generalised empirical likelihood-based kernel density estimation
by: Oryshchenko, V
Published: (2013)

Non‐concept density estimation via kernel regression for concept ranking in weakly labelled data
by: Liantao Wang, et al.
Published: (2018-02-01)

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth
by: Chatterjee, Krishnendu, et al.
Published: (2022)

DEMANDE: Density Matrix Neural Density Estimation
by: Joseph A. Gallego-Mejia, et al.
Published: (2023-01-01)

Estimating entropy of distributions in constant space
by: Indyk, Piotr
Published: (2021)

Faster streaming algorithms for low-rank matrix approximations
by: Galvin, Timothy Matthew
Published: (2014)

If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
by: Abboud, Amir, et al.
Published: (2021)

Scalable fair clustering
by: Indyk, Piotr, et al.
Published: (2021)

Faster Parallel Exact Density Peaks Clustering (Abstract)
by: Huang, Yihao, et al.
Published: (2023)

Exact Boundary Correction Methods for Multivariate Kernel Density Estimation
by: Ji-Yeon Yang
Published: (2023-08-01)