Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

4283125166 · Jun 202019922001200920172026
48 results for Kernel Spectrum

Kernel method is a very powerful tool in machine learning. The trick of kernel has been effectively and extensively applied in many areas of machine learning, such as support vector machine (SVM) and kernel principal component analysis (kernel PCA). Kernel trick is to define a kernel function which relies on the inner-…

2011-05-15abs ↗pdf ↗

Proposes a Gaussian process for graph signals using adaptive spectral kernels.

problem Predicting signals on graph nodes with various structures.
method Spectral kernel learning approach that incorporates a polynomial function in the graph spectral domain.
result The model accurately recovers ground truth spectral filters and outperforms in real-world graph data.

We study the existence and uniqueness of the heat kernel on infinite, locally finite, connected graphs. For general graphs, a uniqueness criterion, shown to be optimal, is given in terms of the maximal valence on spheres about a fixed vertex. A sufficient condition for non-uniqueness is also presented. Furthermore, we …

2008-02-20abs ↗pdf ↗

Study analyzes learnability of RKHS under L∞ norm for kernel methods.

problem Understand performance of kernel methods and random feature models.
method Relate L∞ learnability to kernel spectrum decay and establish sample complexity bounds.
result Conditions for efficient L∞ learning of RKHS identified.

We consider a complete noncompact smooth Riemannian manifold MM with a weighted measure and the associated drifting Laplacian. We demonstrate that whenever the qq-Bakry-Émery Ricci tensor on MM is bounded below, then we can obtain an upper bound estimate for the heat kernel of the drifting Laplacian from the upper b…

2013-04-11abs ↗pdf ↗

Study reveals an equivalence principle for the spectrum of random inner-product kernel matrices in polynomial scaling.

problem Understanding the spectrum of random kernel matrices in polynomial scaling regimes.
method Investigates random matrices with nonlinear kernel functions applied to inner products of uniformly distributed vectors.
result The spectrum of the random kernel matrix is asymptotically equivalent to a simpler matrix model through free additive convolution.

NTK-SAP improves neural network pruning by aligning training dynamics.

problem Improving neural network pruning to reduce training time and memory.
method Prune connections based on the spectrum of the Neural Tangent Kernel (NTK), using multiple random weight realizations and random inputs.
result Empirically, NTK-SAP achieves better performance than all baselines on multiple datasets.

Introduces tunable basis functions for Gaussian processes.

problem Reduces computational complexity in Gaussian process approximations.
method Introduces tunable, local, and bounded basis functions for kernel approximation.
result Demonstrates superior performance compared to state-of-the-art methods, especially with poorly chosen kernel functions.

This paper shows universality in spectrum behavior for random inner-product kernel matrices in polynomial regime.

problem Understanding spectrum behavior of random inner-product kernel matrices in polynomial regime.
method Analyzing matrices formed by a nonlinear function applied entrywise to a sample-covariance matrix, considering i.i.d. entries with all finite moments.
result The spectrum of random inner-product kernel matrices is universally described by the free convolution of the semicircular and Marčenko-Pastur distributions, with relative weights given by expanding the nonlinear function in the Hermite basis.

In this paper we study the concentration properties for the eigenvalues of kernel matrices, which are central objects in a wide range of kernel methods and, more recently, in network analysis. We present a set of concentration inequalities tailored for each individual eigenvalue of the kernel matrix with respect to its…

2018-12-05abs ↗pdf ↗

We empirically investigate the best trade-off between sparse and uniformly-weighted multiple kernel learning (MKL) using the elastic-net regularization on real and simulated datasets. We find that the best trade-off parameter depends not only on the sparsity of the true kernel-weight spectrum but also on the linear dep…

2010-01-15abs ↗pdf ↗

This study improves graph coarsening methods by preserving graph spectrum and distances.

problem Solving large-scale graph problems by working on a smaller graph.
method Developed a geometric approach using Gromov--Wasserstein distance to minimize the difference between graph distances and their coarsened versions.
result Minimizing the difference between graph distances and their coarsened versions can be achieved using the weighted kernel KK-means method.

Paper provides unbiased spectral moment estimates from finite data.

problem Challenges in estimating spectral moments from limited data.
method Dynamic programming approach to estimate spectral moments of kernel integral operator.
result Demonstrates consistency with theoretical spectra and practical utility in neural networks.

Researchers resolve string theory ambiguities and define a new metric for massless spectrum.

problem Ambiguities in string theory regarding spin connection and Hodge decomposition.
method Constructing a vector bundle Q and operators D and D† to define a metric and gauge fixing.
result Massless spectrum are harmonic representatives of the operator D, resolving previous complications.

We study the relationship between the geometry and the Laplace spectrum of a Riemannian orbifold O via its heat kernel; as in the manifold case, the time-zero asymptotic expansion of the heat kernel furnishes geometric information about O. In the case of a good Riemannian orbifold (i.e., an orbifold arising as the orbi…

2008-05-20abs ↗pdf ↗

We study quadrature rules for functions from an RKHS, using nodes sampled from a determinantal point process (DPP). DPPs are parametrized by a kernel, and we use a truncated and saturated version of the RKHS kernel. This link between the two kernels, along with DPP machinery, leads to relatively tight bounds on the qua…

2019-06-18abs ↗pdf ↗

Study the Bochner-Schrödinger operator on symplectic manifolds, proving gap existence and asymptotic kernel behavior.

problem Analyzing the spectrum and asymptotic behavior of the Bochner-Schrödinger operator on symplectic manifolds.
method Rough asymptotic description, existence proof, off-diagonal exponential estimate, complete asymptotic expansion.
result Existence of gaps in the spectrum and asymptotic kernel behavior.

Gaussian process regression generally does not scale to beyond a few thousands data points without applying some sort of kernel approximation method. Most approximations focus on the high eigenvalue part of the spectrum of the kernel matrix, KK, which leads to bad performance when the length scale of the kernel is sma…

2017-08-07abs ↗pdf ↗

Expressiveness and generalization of deep models was recently addressed via the connection between neural networks (NNs) and kernel learning, where first-order dynamics of NN during a gradient-descent (GD) optimization were related to gradient similarity kernel, also known as Neural Tangent Kernel (NTK). In the majorit…

2019-10-19abs ↗pdf ↗

We study the sub-Laplacian of the 1515-dimensional unit sphere which is obtained by lifting with respect to the Hopf fibration the Laplacian of the octonionic projective space. We obtain in particular explicit formulas for its heat kernel and deduce an expression for the Green function of a related sub-Laplacian. As a …

2019-04-18abs ↗pdf ↗

We analyze kernel matrices in polynomial high-dimensional settings and explain double descent in KRR.

problem Understanding the spectrum of kernel matrices in polynomial high-dimensional settings and its implications for KRR risk.
method Generalized decomposition of kernel matrices into low-rank spike matrix, identity, and Gegenbauer matrix.
result The test error in KRR can exhibit double descent behavior, depending on effective regularization and signal-to-noise ratio.

In this paper we propose a family of tractable kernels that is dense in the family of bounded positive semi-definite functions (i.e. can approximate any bounded kernel with arbitrary precision). We start by discussing the case of stationary kernels, and propose a family of spectral kernels that extends existing approac…

2015-06-07abs ↗pdf ↗

The dynamics of DNNs during gradient descent is described by the so-called Neural Tangent Kernel (NTK). In this article, we show that the NTK allows one to gain precise insight into the Hessian of the cost of DNNs. When the NTK is fixed during training, we obtain a full characterization of the asymptotics of the spectr…

2019-10-01abs ↗pdf ↗

We present a novel attention-based model for discrete event data to capture complex non-linear temporal dependence structures. We borrow the idea from the attention mechanism and incorporate it into the point processes' conditional intensity function. We further introduce a novel score function using Fourier kernel emb…

2020-02-17abs ↗pdf ↗

In this paper, we study the spectrum and the eigenvectors of radial kernels for mixtures of distributions in Rn\mathbb{R}^n. Our approach focuses on high dimensions and relies solely on the concentration properties of the components in the mixture. We give several results describing of the structure of kernel matrices …

2019-06-25abs ↗pdf ↗

New method interpolates high-dimensional scattered data using kernel theory.

problem Scattered data in high-dimensional spaces defy traditional distributional assumptions.
method Kernel interpolation framework based on integral operator theory.
result Spectra of kernel matrices predict performance of interpolation methods.

The study bounds heat kernel for manifolds with specific curvature conditions.

problem Estimating heat kernel for manifolds with Bakry-Émery Ricci curvature.
method Gaussian upper bound for heat kernel, proving L^1-Liouville property, deriving eigenvalue bounds.
result Established Gaussian upper bound for heat kernel, derived eigenvalue bounds.

In this thesis, we analyze the stochastic completeness of a heat kernel on graphs which is a function of three variables: a pair of vertices and a continuous time, for infinite, locally finite, connected graphs. For general graphs, a sufficient condition for stochastic completeness is given in terms of the maximum vale…

2007-12-10abs ↗pdf ↗

A fundamental task in kernel methods is to pick nodes and weights, so as to approximate a given function from an RKHS by the weighted sum of kernel translates located at the nodes. This is the crux of kernel density estimation, kernel quadrature, or interpolation from discrete samples. Furthermore, RKHSs offer a conven…

2020-02-22abs ↗pdf ↗

Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include previously unstudied graphs including kNN graphs. We also introduce a kernel-fr…

2011-01-28abs ↗pdf ↗

Manifolds with fibered cusps are a class of complete noncompact Riemannian manifolds including all locally symmetric spaces of rank one. We study the spectrum of the Hodge Laplacian with coefficients in a flat bundle on a closed manifold undergoing degeneration to a manifold with fibered cusps. We obtain precise asympt…

2014-10-30abs ↗pdf ↗

We study the spectrum and heat kernel of the Hodge Laplacian with coefficients in a flat bundle on a closed manifold degenerating to a manifold with wedge singularities. Provided the Hodge Laplacians in the fibers of the wedge have an appropriate spectral gap, we give uniform constructions of the resolvent and heat ker…

2018-07-05abs ↗pdf ↗