New kernels defined for various spaces, including measures.
problem Defining kernels on non-standard spaces like measures.
method Integrally strictly positive definite and characteristic kernels on Hilbert, Banach, and metric spaces.
result Explicit classes of kernels on Lp spaces and sets of measures. Measuring conditional independence is one of the important tasks in statistical inference and is fundamental in causal discovery, feature selection, dimensionality reduction, Bayesian network learning, and others. In this work, we explore the connection between conditional independence measures induced by distances on …
Paper compares Bergman kernel and Masur-Veech measure on Teichmüller space.
problem Comparing Bergman kernel and Masur-Veech measure on Teichmüller space.
method Comparison between Bergman kernel form and pushforward measure of Masur-Veech measure.
result Obtained a comparison between the Bergman kernel form and the pushforward measure of the Masur-Veech measure.
A Hilbert space embedding for probability measures has recently been proposed, wherein any probability measure is represented as a mean element in a reproducing kernel Hilbert space (RKHS). Such an embedding has found applications in homogeneity testing, independence testing, dimensionality reduction, etc., with the re…
New quantum kernels avoid overfitting by combining local and global components.
problem Exponential concentration in quantum kernels leads to overfitting.
method Local-global quantum kernels combining small subsystem and full-system measurements.
result Demonstrated benign overfitting in local-global quantum kernels.
Paper generalizes kernel mean embedding to von Neumann-algebra-valued measures.
problem Analyzing complex multivariate distributions and quantum mechanics.
method Generalizes kernel mean embedding to von Neumann-algebra-valued measures in reproducing kernel Hilbert modules.
result Injectivity and universality of the generalized KME are confirmed.
Paper solves open question about non-positive kernels by decomposing them into PD kernels.
problem Can non-positive definite kernels be decomposed into the difference of two positive definite kernels?
method Introduced signed measure to transform positive decomposition into measure decomposition, providing a sufficient and necessary condition.
result First random features algorithm for unbiased estimation of non-positive kernels.
Kernel mean embeddings have recently attracted the attention of the machine learning community. They map measures μ from some set M to functions in a reproducing kernel Hilbert space (RKHS) with kernel k. The RKHS distance of two mapped measures is a semi-metric dk over M. We study three questions. (I) For a…
We present in this work a new family of kernels to compare positive measures on arbitrary spaces $\Xcal$ endowed with a positive kernel κ, which translates naturally into kernels between histograms or clouds of points. We first cover the case where $\Xcal$ is Euclidian, and focus on kernels which take into account th…
A new kernel for probability measures based on optimal transport.
problem Efficiently comparing and modeling distributions.
method Kernel over probability measures using regularized optimal transport and Hilbertian embedding.
result The proposed kernel enables Gaussian process modeling on distributions with theoretical and computational advantages.
The paper shows how MMD metrizes weak convergence for certain kernels.
problem Characterizing MMD metrizing weak convergence for a wide class of kernels.
method Proving MMD metrizes weak convergence for specific kernels on a locally compact space.
result Corrected prior results and identified new kernels metrizing weak convergence.
Kernel embeddings separate distinct probability distributions, simplifying testing.
problem Testing equality of non-atomic probability distributions.
method Kernel covariance embeddings and Gaussian measures in reproducing kernel Hilbert spaces.
result Testing for singularity between Gaussian measures is equivalent to testing for equality of non-atomic probability distributions.
Toeplitz operators linked to submultiplicative filtrations and weighted Bergman kernels.
problem Analyzing the asymptotics of weighted Bergman kernels for submultiplicative filtrations.
method Demonstrated that weight operator is a Toeplitz operator; analyzed asymptotics of weighted Bergman kernels.
result Local refinement of convergence of jumping measures towards geodesic ray pushforward measure.
New conditions ensure MMDs separate and converge to target distributions.
problem Ensuring MMDs separate and converge to target distributions.
method Deriving new sufficient and necessary conditions for MMDs on separable metric spaces.
result First KSDs that exactly metrize weak convergence to P.
Paper advances sparse regularisation theory for measures with new kernel insights.
problem Estimating sparse measures from noisy observations using continuous sparse regularisation.
method Develops new continuous sparse regularisation theory on measures with Beurling-LASSO, introduces kernel switch analysis.
result Proves the ``sinc-4'' kernel satisfies a technical LPC assumption for error bounds.
New method uses kernel Stein discrepancy for measure transport without strict continuity constraints.
problem Minimizing Kullback-Leibler divergence for posterior approximation.
method Proposes minimizing kernel Stein discrepancy instead of Kullback-Leibler divergence.
result Demonstrates consistency and competitiveness of the new method.
We analyzed optimism in linear and kernel regression models.
problem Understanding predictive complexity in regression models.
method Derived closed-form asymptotic optimism for linear and kernel regression models.
result Scaled optimism is a useful measure for model complexity.
We prove that a metric measure space equipped with a Dirichlet form admitting an Euclidean heat kernel is necessarily isometric to the Euclidean space. This helps us providing an alternative proof of Colding's celebrated almost rigidity volume theorem via a quantitative version of our main result. We also discuss the c…
Kernel approximation methods create explicit, low-dimensional kernel feature maps to deal with the high computational and memory complexity of standard techniques. This work studies a supervised kernel learning methodology to optimize such mappings. We utilize the Discriminant Information criterion, a measure of class …
A new kernel measures brain network similarities, improving disease classification.
problem Lack of edge weight information in existing graph kernels for brain connectivity networks.
method Ordinal pattern kernel for weighted brain connectivity networks.
result The ordinal pattern kernel achieves better classification performance than state-of-the-art graph kernels.
A new measure of dependence for various data types.
problem Measuring dependence in multivariate, functional, and structured data.
method Combines local normalization with RKHS flexibility.
result Validates the measure's properties and competitive performance.
Many contemporary statistical learning methods assume a Euclidean feature space. This paper presents a method for defining similarity based on hyperspherical geometry and shows that it often improves the performance of support vector machine compared to other competing similarity measures. Specifically, the idea of usi…
Fourier representation improves KSD for infinite-dimensional data.
problem Applying KSD to infinite-dimensional data.
method Combining measure equations with kernel methods for a Fourier representation of KSD.
result KSD can separate measures in infinite-dimensional Hilbert spaces.
Despite the success of the popular kernelized support vector machines, they have two major limitations: they are restricted to Positive Semi-Definite (PSD) kernels, and their training complexity scales at least quadratically with the size of the data. Many natural measures of similarity between pairs of samples are not…
A new kernel-based CI test improves on existing methods.
problem Testing conditional independence (CI) in a broad range of dependencies.
method Regression-model-agnostic kernel-based CI test using reproducing kernel Hilbert spaces.
result GKCM outperforms state-of-the-art CI tests in simulations.
The rate of convergence of weighted kernel herding (WKH) and sequential Bayesian quadrature (SBQ), two kernel-based sampling algorithms for estimating integrals with respect to some target probability measure, is investigated. Under verifiable conditions on the chosen kernel and target measure, we establish a near-geom…
kdiff measures distances for time series and structured data.
problem Estimating distances between time series and structured data.
method kdiff uses non-linear kernel distances based on matching overlapping distributions.
result kdiff is more robust to noise and partial occlusions.
This paper studies Brownian motion and heat kernel measure on a class of infinite dimensional Lie groups. We prove a Cameron-Martin type quasi-invariance theorem for the heat kernel measure and give estimates on the Lp norms of the Radon-Nikodym derivatives. We also prove that a logarithmic Sobolev inequality holds …
Study birth-death dynamics for sampling Gibbs measures with nonconvex potentials.
problem Sampling Gibbs measures with nonconvex potentials.
method Birth-death dynamics, Kullback-Leibler divergence, χ2 divergence, kernel-based approximations, Γ-convergence of gradient flows. result Probability density converges exponentially fast to Gibbs equilibrium measure with a universal rate.
Improved kernel quadrature with convex weights using subsampling.
problem Constructing quadrature rules with small worst-case error.
method Combining spectral properties of the kernel with recombination results.
result Effective algorithms for constructing convex quadrature rules with i.i.d. samples.
Extends Tanimoto kernel to real-valued functions.
problem Measuring similarity between real-valued functions.
method Unified representation of real-valued functions via sets, derived general form of the kernel, explicit feature representation, and smooth approximation.
result General Tanimoto kernel for real-valued functions.
A novel kernel-based test detects equality versus singularity of two probability measures.
problem Detecting equality versus singularity of two probability distributions.
method Combines kernel mean and kernel covariance embeddings to construct a likelihood ratio test statistic.
result The test statistic satisfies a '0/\infty' law, vanishing under the null and diverging under the alternative.
A new method warps inputs to learn nonstationary kernels efficiently.
problem Learning nonstationary patterns in data with varying smoothness.
method Sparse spectrum Gaussian processes with input warping as conditional Gaussian measures.
result Efficient learning of nonstationary patterns with fewer parameters.
In this survey article, we review the relation between heat kernels and path integrals. In particular, we review recent results on the approximation of the Wiener measure on compact manifold by measures on (finite-dimensional) spaces of piece-wise geodesics.
Develops efficient inference for noise heterogeneity in machine learning models.
problem Downstream procedures based on residuals can be biased in additive noise models.
method Semiparametrically efficient inference using a novel Hilbert-valued one-step estimator.
result Constructs tests and confidence intervals for residual independence and goodness of fit.
Diffusion Maps framework is a kernel based method for manifold learning and data analysis that defines diffusion similarities by imposing a Markovian process on the given dataset. Analysis by this process uncovers the intrinsic geometric structures in the data. Recently, it was suggested to replace the standard kernel …
Producing overlapping schemes is a major issue in clustering. Recent proposed overlapping methods relies on the search of an optimal covering and are based on different metrics, such as Euclidean distance and I-Divergence, used to measure closeness between observations. In this paper, we propose the use of another meas…
Paper proposes a new method to learn distribution kernels via entropy maximization.
problem Challenges in applying kernel methods to distribution regression tasks.
method Proposes a novel objective for unsupervised learning of data-dependent distribution kernels based on entropy maximization.
result Demonstrates the effectiveness of the learned kernel across different modalities.
Optimizes kernel density ratios for better predictions and information measures.
problem Improving accuracy of kernel density estimates for density ratios.
method Derives an optimal weight function using calculus of variations.
result Reduces bias in kernel density estimates, leading to improved prediction posteriors and information-theoretic measures.
Regularized empirical risk minimization using kernels and their corresponding reproducing kernel Hilbert spaces (RKHSs) plays an important role in machine learning. However, the actually used kernel often depends on one or on a few hyperparameters or the kernel is even data dependent in a much more complicated manner. …
A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality reduction, homogeneity testing, and independence testing. This embedding represents any probability measure as a mean element in a reproducing kernel Hilbert space (RKHS). A pseudometric on the spac…
In signal analysis and synthesis, linear approximation theory considers a linear decomposition of any given signal in a set of atoms, collected into a so-called dictionary. Relevant sparse representations are obtained by relaxing the orthogonality condition of the atoms, yielding overcomplete dictionaries with an exten…
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.
A new method quantizes conditional probability measures using deep learning.
problem Quantizing conditional probability measures efficiently.
method DCMQ method using Huber-energy kernel and deep neural network.
result Promising results on various examples.
Algorithm finds best Dirac mass approximation of target measure.
problem Finding optimal Dirac mass approximation of target measure.
method Minimizes statistical distance between original measure and quantized version using Huber-energy kernel.
result HEMQ algorithm robust and versatile, matches intuitive behavior.
In this article, we construct the canonical semipositive current or the canonical measure (= the potential of the canonical semipositive current) on a smooth projective variety of nonnegative Kodaira dimension in terms of a dynamical system of Bergman kernels. This current is considered to be a generalization of a Kä…
Extends Mahalanobis distance to Banach spaces for anomaly detection.
problem Anomaly detection in infinite-dimensional spaces.
method Generalizes Mahalanobis distance to Banach spaces via Cameron-Martin norm and variance norm.
result Kernelized nearest-neighbour Mahalanobis distance outperforms traditional methods for time series novelty detection.
Study entropic regularization of Gaussian measures and processes on Hilbert space.
problem Regularizing 2-Wasserstein distance for infinite-dimensional Gaussian measures and processes.
method Minimum Mutual Information property, closed form formulas, Fréchet differentiability, Sinkhorn barycenter equation.
result Entropic 2-Wasserstein distance and Sinkhorn divergence are Fréchet differentiable in Hilbert space.