Fetching the paper…
Reading the bibliography…
For a function $\mathsf{K} : \mathbb{R}^{d} \times \mathbb{R}^{d} \to \mathbb{R}_{\geq 0}$, and a set $P = \{ x_1, \ldots, x_n\} \subset \mathbb{R}^d$ of $n$ points, the $\mathsf{K}$ graph $G_P$ of $P$ is the complete graph on $n$ nodes where the weight between nodes $i$ and $j$ is given by $\mathsf{K}(x_i, x_j)$.
Monotone funktionen, stieltjessche integrale und harmonische analyse
Salomon Bochner · 1933
Earlier work this paper cites.
On certain metric spaces arising from euclidean spaces by a change of metric and their imbedding in hilbert space
I. J. Schoenberg · 1937
Earlier work this paper cites.
Fourier integrals and metric geometry
J. Von Neumann and I. J. Schoenberg · 1941
Earlier work this paper cites.
Maximization of a linear function of variables subject to linear inequalities
George B Dantzig · 1947
Earlier work this paper cites.
The stability of out-input matrices
Max A Woodbury · 1949
Earlier work this paper cites.
Inverting modified matrices
Max A Woodbury · 1950
Earlier work this paper cites.
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
Herman Chernoff · 1952
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
A lower bound for the smallest eigenvalue of the laplacian
Jeff Cheeger · 1970
Earlier work this paper cites.
Polynomial algorithms in linear programming
Leonid G Khachiyan · 1980
Earlier work this paper cites.
Least squares quantization in pcm
Stuart Lloyd · 1982
Earlier work this paper cites.
On constructing minimum spanning trees in k k -dimensional spaces and related problems
Andrew Chi-Chih Yao · 1982
Earlier work this paper cites.
Extensions of lipschitz mappings into a hilbert space
William B Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · 1984
Earlier work this paper cites.
Interpolation of scattered data: distance matrices and conditionally positive definite functions
Charles A Micchelli · 1984
Earlier work this paper cites.
A fast algorithm for particle simulations
Leslie Greengard and Vladimir Rokhlin · 1987
Earlier work this paper cites.
An algorithm for linear programming which requires O ( ( ( m + n ) n 2 + ( m + n ) 1.5 n ) L ) {O}(((m+n)n^{2}+(m+n)^{1.5}n){L}) arithmetic operations
Pravin M Vaidya · 1987
Earlier work this paper cites.
The rapid evaluation of potential fields in three dimensions
Leslie Greengard and Vladimir Rokhlin · 1988
Earlier work this paper cites.
The rapid evaluation of potential fields in particle systems
Leslie Greengard · 1988
Earlier work this paper cites.
On the evaluation of electrostatic interactions in molecular modeling
Leslie Greengard and Vladimir Rokhlin · 1989
Earlier work this paper cites.
Speeding-up linear programming using fast matrix multiplication
Pravin M Vaidya · 1989
Earlier work this paper cites.
The numerical solution of the n n -body problem
Leslie Greengard · 1990
Earlier work this paper cites.
Euclidean minimum spanning trees and bichromatic closest pairs
Pankaj K Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl · 1991
Earlier work this paper cites.
The fast gauss transform
Leslie Greengard and John Strain · 1991
Earlier work this paper cites.
The fast multipole method for electromagnetic scattering computation
Nader Engheta, William D. Murphy, Vladimir Rokhlin, and Marius Vassiliou · 1992
Earlier work this paper cites.
Efficient partition trees
Jiří Matoušek · 1992
Earlier work this paper cites.
Faster algorithms for some geometric graph problems in higher dimensions
Paul B Callahan and S Rao Kosaraju · 1993
Earlier work this paper cites.
Fast algorithms for classical physics
Leslie Greengard · 1994
Earlier work this paper cites.
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
Paul B Callahan and S Rao Kosaraju · 1995
Earlier work this paper cites.
Support-vector networks
Corinna Cortes and Vladimir Vapnik · 1995
Earlier work this paper cites.
An improved fast multipole algorithm in thre dimensions
Leslie Greengard and Vladimir Rokhlin · 1996
Earlier work this paper cites.
A short course on fast multipole methods
Rick Beatson and Leslie Greengard · 1997
Earlier work this paper cites.
Spectral graph theory
Fan Chung · 1997
Earlier work this paper cites.
Long short-term memory
Sepp Hochreiter and Jürgen Schmidhuber · 1997
Earlier work this paper cites.
Support vector machines for classification and regression
Steve R Gunn · 1998
Earlier work this paper cites.
Approximate nearest neighbors: Towards removing the curse of dimensionality
Piotr Indyk and Rajeev Motwani · 1998
Earlier work this paper cites.
Nonlinear component analysis as a kernel eigenvalue problem
Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller · 1998
Earlier work this paper cites.
Kernel pca and de-noising in feature spaces
Sebastian Mika, Bernhard Schölkopf, Alex J Smola, Klaus-Robert Müller, Matthias Scholz, and Gunnar Rätsch · 1999
Earlier work this paper cites.
Splines: A perfect fit for signal and image processing
Michael Unser · 1999
Earlier work this paper cites.
The fast multipole method: numerical implementation
Eric Darve · 2000
Earlier work this paper cites.
Guest editors’ introduction: The top 10 algorithms
Jack Dongarra and Francis Sullivan · 2000
Earlier work this paper cites.
On the complexity of k-sat
Russell Impagliazzo and Ramamohan Paturi · 2001
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Andrew Y Ng, Michael I Jordan, and Yair Weiss · 2002
Earlier work this paper cites.
Database-friendly random projections: Johnson-lindenstrauss with binary coins
Dimitris Achlioptas · 2003
Earlier work this paper cites.
An elementary proof of a theorem of johnson and lindenstrauss
Sanjoy Dasgupta and Anupam Gupta · 2003
Earlier work this paper cites.
Scale-invariance of support vector machines based on the triangular kernel
François Fleuret and Hichem Sahbi · 2003
Earlier work this paper cites.
Improved fast gauss transform and efficient kernel density estimation
Changjiang Yang, Ramani Duraiswami, Nail A. Gumerov, and Larry Davis · 2003
Earlier work this paper cites.
Non-mercer kernels for svm object recognition
Sabri Boughorbel, Jean-Philippe Tarel, and Francois Fleuret · 2004
Cited alongside, same era.
Kernel models for large scale applications
Bart Hamers · 2004
Cited alongside, same era.
On clusterings: Good, bad and spectral
Ravi Kannan, Santosh Vempala, and Adrian Vetta · 2004
Cited alongside, same era.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A Spielman and Shang-Hua Teng · 2004
Cited alongside, same era.
Efficient kernel machines using the improved fast gauss transform
Changjiang Yang, Ramani Duraiswami, and Larry Davis · 2004
Cited alongside, same era.
Conditionally positive definite kernels for svm based image recognition
Sabri Boughorbel, J-P Tarel, and Nozha Boujemaa · 2005
Cited alongside, same era.
Path finding methods for linear programming: Solving linear programs in O ( r a n k ) {O}(\sqrt{rank}) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Later among the works it cites.
Flow-based algorithms for local graph clustering
Lorenzo Orecchia and Zeyuan Allen Zhu · 2014
Later among the works it cites.
A tutorial on principal component analysis
Jonathon Shlens · 2014
Later among the works it cites.
Faster algorithms via approximation theory
Sushant Sachdeva and Nisheeth K Vishnoi · 2014
Later among the works it cites.
Probabilistic polynomials and hamming nearest neighbors
Josh Alman and Ryan Williams · 2015
Later among the works it cites.
More applications of the polynomial method to algorithm design
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Generalized histogram intersection kernel for image recognition
Sabri Boughorbel, J-P Tarel, and Nozha Boujemaa · 2005
Cited alongside, same era.
The gcs kernel for svm-based image recognition
Sabri Boughorbel, Jean-Philippe Tarel, François Fleuret, and Nozha Boujemaa · 2005
Cited alongside, same era.
A new algorithm for optimal 2-constraint satisfaction and its implications
Ryan Williams · 2005
Cited alongside, same era.
Semi-supervised learning with graphs
Xiaojin Zhu · 2005
Cited alongside, same era.
Semi-supervised learning literature survey
Xiaojin Jerry Zhu · 2005
Cited alongside, same era.
Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning
Xiaojin Zhu and John Lafferty · 2005
Cited alongside, same era.
Amir Abboud, Ryan Williams, and Huacheng Yu · 2015
Later among the works it cites.
Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak · 2015
Later among the works it cites.
Constructing linear-sized spectral sparsification in almost-linear time
Yin Tat Lee and He Sun · 2015
Later among the works it cites.
Polynomial representations of threshold functions and algorithmic applications
Josh Alman, Timothy M Chan, and Ryan Williams · 2016
Later among the works it cites.
Spectral sparsification in spectral clustering
Alireza Chakeri, Hamidreza Farhidzadeh, and Lawrence O Hall · 2016
Later among the works it cites.
Deterministic apsp, orthogonal vectors, and more: Quickly derandomizing razborov-smolensky
Timothy M Chan and Ryan Williams · 2016
Later among the works it cites.
Sparsified cholesky and multigrid solvers for connection laplacians
Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Daniel A. Spielman · 2016
Later among the works it cites.
Approximate gaussian elimination for laplacians-fast, sparse, and simple
Rasmus Kyng and Sushant Sachdeva · 2016
Later among the works it cites.
On the fine-grained complexity of empirical risk minimization: Kernel methods and neural networks
Arturs Backurs, Piotr Indyk, and Ludwig Schmidt · 2017
Later among the works it cites.
Hashing-based-estimators for kernel density in high dimensions
Moses Charikar and Paris Siminelakis · 2017
Later among the works it cites.
High-dimensional similarity search and sketching: algorithms and hardness
Ilya Razenshteyn · 2017
Later among the works it cites.
Generalized preconditioning and network flow problems
Jonah Sherman · 2017
Later among the works it cites.
Recent advances in recurrent neural networks
Hojjat Salehinejad, Sharan Sankar, Joseph Barfett, Errol Colak, and Shahrokh Valaee · 2017
Later among the works it cites.
Learning non-overlapping convolutional neural networks with multiple kernels
Kai Zhong, Zhao Song, and Inderjit S Dhillon · 2017
Later among the works it cites.
Recovery guarantees for one-hidden-layer neural networks
Kai Zhong, Zhao Song, Prateek Jain, Peter L Bartlett, and Inderjit S Dhillon · 2017
Later among the works it cites.
Graph clustering using effective resistance
Vedat Levi Alev, Nima Anari, Lap Chi Lau, and Shayan Oveis Gharan · 2018
Later among the works it cites.
Efficient density evaluation for smooth kernels
Arturs Backurs, Moses Charikar, Piotr Indyk, and Paris Siminelakis · 2018
Later among the works it cites.
On the hardness of approximate and exact (bichromatic) maximum inner product
Lijie Chen · 2018
Later among the works it cites.
Neural tangent kernel: Convergence and generalization in neural networks
Arthur Jacot, Franck Gabriel, and Clément Hongler · 2018
Later among the works it cites.
Learning overparameterized neural networks via stochastic gradient descent on structured data
Yuanzhi Li and Yingyu Liang · 2018
Later among the works it cites.
Hardness of approximate nearest neighbor search
Aviad Rubinstein · 2018
Later among the works it cites.
On some fine-grained questions in algorithms and complexity
Virginia Vassilevska Williams · 2018
Later among the works it cites.
Efficient algorithms for geometric partial matching
Pankaj K. Agarwal, Hsien-Chih Chang, and Allen Xiao · 2019
Later among the works it cites.
A convergence theory for deep learning via over-parameterization
Zeyuan Allen-Zhu, Yuanzhi Li, and Zhao Song · 2019
Later among the works it cites.
On the convergence rate of training recurrent neural networks
Zeyuan Allen-Zhu, Yuanzhi Li, and Zhao Song · 2019
Later among the works it cites.
Solving linear programs in the current matrix multiplication time
Michael B Cohen, Yin Tat Lee, and Zhao Song · 2019
Later among the works it cites.
Gradient descent provably optimizes over-parameterized neural networks
Simon S Du, Xiyu Zhai, Barnabas Poczos, and Aarti Singh · 2019
Later among the works it cites.
Solving empricial risk minimization in the current matrix multiplication time
Yin Tat Lee, Zhao Song, and Qiuyi Zhang · 2019
Later among the works it cites.
A unified framework for data poisoning attack to graph-based semi-supervised learning
Xuanqing Liu, Si Si, Xiaojin Zhu, Yang Li, and Cho-Jui Hsieh · 2019
Later among the works it cites.
On closest pair in euclidean metric: Monochromatic is as hard as bichromatic
Karthik C. S. and Pasin Manurangsi · 2019
Later among the works it cites.
Matrix Theory : Optimization, Concentration and Algorithms
Zhao Song · 2019
Later among the works it cites.
Quadratic suffices for over-parametrization via matrix chernoff bound
Zhao Song and Xin Yang · 2019
Later among the works it cites.
Solving tall dense linear programs in nearly linear time
Jan van den Brand, Yin Tat Lee, Aaron Sidford, and Zhao Song · 2020
Closest in time.
A deterministic linear program solver in current matrix multiplication time
Jan van den Brand · 2020
Closest in time.
Exact computation of a manifold metric, via lipschitz embeddings and shortest paths on a graph
Timothy Chu, Gary L. Miller, and Donald Sheehy · 2020
Closest in time.
Graph neural network acceleration via matrix dimension reduction
Shunhua Jiang, Yunze Man, Zhao Song, and Danyang Zhuo · 2020
Closest in time.
Faster dynamic matrix inverse for faster lps
Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang · 2020
Closest in time.
Generalized leverage score sampling for neural network
Jason D. Lee, Ruoqi Shen, Zhao Song, Mengdi Wang, and Zheng Yu · 2020
Closest in time.
Oblivious sketching-based central path method for solving linear programming problems
Zhao Song and Zheng Yu · 2020
Closest in time.
A refined laser method and faster matrix multiplication
Josh Alman and Virginia Vassilevska Williams · 2021
Closest in time.
Training (overparametrized) neural networks in near-linear time
Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein · 2021
Closest in time.