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.
A new method for nonstationary Gaussian processes using Fourier features.
Optimizes graph spectral density learning for large networks.
We propose non-stationary spectral kernels for Gaussian process regression. We propose to model the spectral density of a non-stationary kernel function as a mixture of input-dependent Gaussian process frequency density surfaces. We solve the generalised Fourier transform with such a model, and present a family of non-…
Deep learning speeds spectral density estimation for large 2D/3D grids.
Enhances GPLVM for multi-view data with scalable latent representation learning.
SRF improves kernel approximation and GP regression performance.
Spectral algorithms improve under covariate shift with novel weighted techniques.
New kernel models multi-output Gaussian processes accurately.
Multi-output Gaussian processes (MOGPs) are an extension of Gaussian Processes (GPs) for predicting multiple output variables (also called channels, tasks) simultaneously. In this paper we use the convolution theorem to design a new kernel for MOGPs, by modeling cross channel dependencies through cross convolution of t…
Fast simulates Volterra processes using RFF, focusing on S-fBM.
This paper presents a practical, and theoretically well-founded, approach to improve the speed of kernel manifold learning algorithms relying on spectral decomposition. Utilizing recent insights in kernel smoothing and learning with integral operators, we propose Reduced Set KPCA (RSKPCA), which also suggests an easy-t…
Method reduces categorical data to lower dimensions using density matrices.
Develops nonstationary MOGP kernels for better performance.
Efficiently approximates statistical leverage scores for faster KRR.
Spectral mixture (SM) kernels comprise a powerful class of generalized kernels for Gaussian processes (GPs) to describe complex patterns. This paper introduces model compression and time- and phase (TP) modulated dependency structures to the original (SM) kernel for improved generalization of GPs. Specifically, by adop…
Paper analyzes spectral algorithms under covariate shift, providing convergence rates.
Motivated by the local formulae for asymptotic expansion of heat kernels in spectral geometry, we propose a definition of Ricci curvature in noncommutative settings. The Ricci operator of an oriented closed Riemannian manifold can be realized as a spectral functional, namely the functional defined by the zeta function …
The paper proves spectral convergence rates for graph Laplacian to manifold Laplace-Beltrami operator.
Gaussian processes are rich distributions over functions, with generalization properties determined by a kernel function. When used for long-range extrapolation, predictions are particularly sensitive to the choice of kernel parameters. It is therefore critical to account for kernel uncertainty in our predictive distri…
Given a data set and a subset of labels the problem of semi-supervised learning on point clouds is to extend the labels to the entire data set. In this paper we extend the labels by minimising the constrained discrete -Dirichlet energy. Under suitable conditions the discrete problem can be connected, in the large da…
Clustering of data sets is a standard problem in many areas of science and engineering. The method of spectral clustering is based on embedding the data set using a kernel function, and using the top eigenvectors of the normalized Laplacian to recover the connected components. We study the performance of spectral clust…
A natural way to characterize the cluster structure of a dataset is by finding regions containing a high density of data. This can be done in a nonparametric way with a kernel density estimate, whose modes and hence clusters can be found using mean-shift algorithms. We describe the theory and practice behind clustering…
We propose a novel class of Gaussian processes (GPs) whose spectra have compact support, meaning that their sample trajectories are almost-surely band limited. As a complement to the growing literature on spectral design of covariance kernels, the core of our proposal is to model power spectral densities through a rect…
Gaussian processes are rich distributions over functions, which provide a Bayesian nonparametric approach to smoothing and interpolation. We introduce simple closed form kernels that can be used with Gaussian processes to discover patterns and enable extrapolation. These kernels are derived by modelling a spectral dens…
Kernel ridgeless regression with random features shows good generalization without explicit regularization.
Sharp comparison theorems are derived for all eigenvalues of the (weighted) Laplacian, for various classes of weighted-manifolds (i.e. Riemannian manifolds endowed with a smooth positive density). Examples include Euclidean space endowed with strongly log-concave and log-convex densities, extensions to -exponential …
Generative models improved with smoothed score functions for better sample quality.
Early approaches to multiple-output Gaussian processes (MOGPs) relied on linear combinations of independent, latent, single-output Gaussian processes (GPs). This resulted in cross-covariance functions with limited parametric interpretation, thus conflicting with the ability of single-output GPs to understand lengthscal…
Derives spectral density function for symplectic manifolds.
Gaussian processes are flexible function approximators, with inductive biases controlled by a covariance kernel. Learning the kernel is the key to representation learning and strong predictive performance. In this paper, we develop functional kernel learning (FKL) to directly infer functional posteriors over kernels. I…
Graph spectra have been successfully used to classify network types, compute the similarity between graphs, and determine the number of communities in a network. For large graphs, where an eigen-decomposition is infeasible, iterative moment matched approximations to the spectra and kernel smoothing are typically used. …
New spectral mixture representation for isotropic kernels simplifies random Fourier features.
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…
New method for spectral and Bergman kernels under local spectral gap condition.
TAKDE optimizes kernel density estimation for real-time dynamic processes.
We consider a special family of occupation-time derivatives, namely proportional step options introduced by Linetsky in [Math. Finance, 9, 55--96 (1999)]. We develop new closed-form spectral expansions for pricing such options under a class of nonlinear volatility diffusion processes which includes the constant-elastic…
Spectral density matrix estimation of multivariate time series is a classical problem in time series and signal processing. In modern neuroscience, spectral density based metrics are commonly used for analyzing functional connectivity among brain regions. In this paper, we develop a non-asymptotic theory for regularize…
We perform a parallel analysis of the spectral density of (i) the logarithm of price and (ii) the daily number of trades of a set of stocks traded in the New York Stock Exchange. The stocks are selected to be representative of a wide range of stock capitalization. The observed spectral densities show a different power-…
Optimizes kernel density ratios for better predictions and information measures.
Recently there have been increasing interests in learning and inference with implicit distributions (i.e., distributions without tractable densities). To this end, we develop a gradient estimator for implicit distributions based on Stein's identity and a spectral decomposition of kernel operators, where the eigenfuncti…
Study on JNR monopoles, focusing on their spectral curves and energy density.
Standard kernels such as Matérn or RBF kernels only encode simple monotonic dependencies within the input space. Spectral mixture kernels have been proposed as general-purpose, flexible kernels for learning and discovering more complicated patterns in the data. Spectral mixture kernels have recently been generalized in…
A new convolutional spectral kernel network learns hierarchical and local features.
Optimizes spectral density estimation for stationary and nonstationary processes.
Kernel methods are popular in clustering due to their generality and discriminating power. However, we show that many kernel clustering criteria have density biases theoretically explaining some practically significant artifacts empirically observed in the past. For example, we provide conditions and formally prove the…
Sketching reduces data size for accurate spectral estimation.
The generalization performance of kernel methods is largely determined by the kernel, but common kernels are stationary thus input-independent and output-independent, that limits their applications on complicated tasks. In this paper, we propose a powerful and efficient spectral kernel learning framework and learned ke…
New inequalities for spectral zeta kernels on spheres and manifolds.