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.
CKA with Gaussian RBF kernels converges linearly as bandwidth increases.
Changing kernel bandwidth during training improves kernel regression performance.
A new method for faster bandwidth selection in Gaussian kernel ridge regression.
Support vector data description (SVDD) is a popular technique for detecting anomalies. The SVDD classifier partitions the whole space into an inlier region, which consists of the region near the training data, and an outlier region, which consists of points away from the training data. The computation of the SVDD class…
Consistency of the kernel density estimator requires that the kernel bandwidth tends to zero as the sample size grows. In this paper we investigate the question of whether consistency is possible when the bandwidth is fixed, if we consider a more general class of weighted KDEs. To answer this question in the affirmativ…
Support vector data description (SVDD) is a popular anomaly detection technique. The SVDD classifier partitions the whole data space into an inlier region, which consists of the region near the training data, and an outlier region, which consists of points away from the training data. The computation of the SVDD classi…
Study shows that ridgeless Gaussian kernel regression overfits even with varying bandwidth or dimensionality.
Study provides bounds for estimating intrinsic dimension using Gaussian kernels.
This paper proposes a new method for automatically selecting the optimal kernel bandwidth in density estimation.
Paper proves MS convergence for radially symmetric kernels with large bandwidths.
Support Vector Data Description (SVDD) provides a useful approach to construct a description of multivariate data for single-class classification and outlier detection with various practical applications. Gaussian kernel used in SVDD formulation allows flexible data description defined by observations designated as sup…
Support Vector Data Description (SVDD) is a machine-learning technique used for single class classification and outlier detection. SVDD formulation with kernel function provides a flexible boundary around data. The value of kernel function parameters affects the nature of the data boundary. For example, it is observed …
New method selects optimal bandwidth for price return density estimation, impacting efficient market hypothesis evaluation.
Optimal kernel improves estimation accuracy in modal statistical methods.
Kernel Density Estimation is a very popular technique of approximating a density function from samples. The accuracy is generally well-understood and depends, roughly speaking, on the kernel decay and local smoothness of the true density. However concrete statements in the literature are often invoked in very specific …
The article introduces practical estimators for kernel discrepancies.
In kernel methods, the median heuristic has been widely used as a way of setting the bandwidth of RBF kernels. While its empirical performances make it a safe choice under many circumstances, there is little theoretical understanding of why this is the case. Our aim in this paper is to advance our understanding of the …
The paper proves convergence of graph Laplacian with kNN self-tuned kernels.
A streaming algorithm estimates quadratic covariation from financial data efficiently.
Kernel Estimation is one of the most widely used estimation methods in non-parametric Statistics, having a wide-range of applications, including spot volatility estimation of stochastic processes. The selection of bandwidth and kernel function is of great importance, especially for the finite sample settings commonly e…
Kernel based methods have shown effective performance in many remote sensing classification tasks. However their performance significantly depend on its hyper-parameters. The conventional technique to estimate the parameter comes with high computational complexity. Thus, the objective of this letter is to propose an fa…
Ad-SVGD optimizes kernel parameters for SVGD, improving inference performance.
This paper improves bandwidth selectors for SPBNs to enhance their performance.
The paper analyzes Kernel Density Estimation in high dimensions with varying data and dimensionality.
New random feature maps for Laplacian and related kernels.
Proposes a new method for kernel density estimation using stagewise minimization and a simple dictionary.
New method for spot volatility estimation with reduced microstructure noise.
Two adaptive kernel selection methods improve the accuracy of Kernelized Diffusion Maps.
Estimators of information theoretic measures such as entropy and mutual information are a basic workhorse for many downstream applications in modern data science. State of the art approaches have been either geometric (nearest neighbor (NN) based) or kernel based (with a globally chosen bandwidth). In this paper, we co…
New kernel models multi-output Gaussian processes accurately.
We address the problem of setting the kernel bandwidth used by Manifold Learning algorithms to construct the graph Laplacian. Exploiting the connection between manifold geometry, represented by the Riemannian metric, and the Laplace-Beltrami operator, we set the bandwidth by optimizing the Laplacian's ability to preser…
Proposes GRAB-MDM for robust multiview data fusion.
EVI-MMD approximates target distributions via MMD minimization with adaptive kernel.
We propose a procedure for supervised classification that is based on potential functions. The potential of a class is defined as a kernel density estimate multiplied by the class's prior probability. The method transforms the data to a potential-potential (pot-pot) plot, where each data point is mapped to a vector of …
Algorithm selects variables and bandwidths for geographically weighted regression.
Proposes SD-KDE for density estimation using debiased kernel density with score-based adjustments.
This paper presents a new insight into improving the performance of Stochastic Neighbour Embedding (t-SNE) by using Isolation kernel instead of Gaussian kernel. Isolation kernel outperforms Gaussian kernel in two aspects. First, the use of Isolation kernel in t-SNE overcomes the drawback of misrepresenting some structu…
The article derives a novel Gram-Charlier A (GCA) Series based Extended Rule-of-Thumb (ExROT) for bandwidth selection in Kernel Density Estimation (KDE). There are existing various bandwidth selection rules achieving minimization of the Asymptotic Mean Integrated Square Error (AMISE) between the estimated probability d…
Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation do…
Enhanced kernel ridgeless regression improves performance with LAB RBF kernels.
We show that minimum-norm interpolation in the Reproducing Kernel Hilbert Space corresponding to the Laplace kernel is not consistent if input dimension is constant. The lower bound holds for any choice of kernel bandwidth, even if selected based on data. The result supports the empirical observation that minimum-norm …
A new method optimizes MMD test power by dynamically selecting kernels, overcoming traditional trade-offs.
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, , which leads to bad performance when the length scale of the kernel is sma…
The Nadaraya-Watson kernel estimator is among the most popular nonparameteric regression technique thanks to its simplicity. Its asymptotic bias has been studied by Rosenblatt in 1969 and has been reported in a number of related literature. However, Rosenblatt's analysis is only valid for infinitesimal bandwidth. In co…
Study on sensor fusion algorithms under high dimensional noise.
A number of applications in engineering, social sciences, physics, and biology involve inference over networks. In this context, graph signals are widely encountered as descriptors of vertex attributes or features in graph-structured data. Estimating such signals in all vertices given noisy observations of their values…
We study the density estimation problem with observations generated by certain dynamical systems that admit a unique underlying invariant Lebesgue density. Observations drawn from dynamical systems are not independent and moreover, usual mixing concepts may not be appropriate for measuring the dependence among these ob…
Kernel test detects manifold data differences with high-dimensional noise.