Generalising maximum mean discrepancy: kernelised functional Bregman divergences

• URL: http://arxiv.org/abs/2604.24047v1
• Date: Mon, 27 Apr 2026 05:09:31 GMT
• Title: Generalising maximum mean discrepancy: kernelised functional Bregman divergences
• Abstract summary: We consider functional Bregman divergences on a Hilbert space, where the self-dual pairing and Riesz representer afford us convenient calculus.<n>We discuss applications in clustering, universal estimation, robust estimation and generative modelling.
• Score: 13.16479037959388
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bregman divergences play a pivotal role in statistics, machine learning and computational information geometry. Particularly in the context of machine learning, they are central to clustering, exponential families, parameter estimation and optimisation, among other things. Despite this, the full toolkit of Hilbert spaces and in particular reproducing kernel Hilbert spaces have not been systematically developed and applied to functional Bregman divergences, where points are functions rather than finite-dimensional parameter vectors. While other types of functional Bregman divergences have been studied, these are typically in a Banach space rather than more directly aligned with kernel methods and Hilbert-space geometry commonly used in machine learning. We consider functional Bregman divergences on a Hilbert space, where the self-dual pairing and Riesz representer afford us particularly convenient calculus. Further specialising Bregman generators as a composition involving a kernel mean embedding makes such divergences easy to estimate. We discuss applications in clustering, universal estimation, robust estimation and generative modelling, and contrast our approach with other types of Bregman divergences.

Related papers

• Generalized Splines and Gaussian Processes [15.333202915986627]
  We show that generalized splines take the role of linear regressors and generalized Gaussian processes on a nuclear space $S$ are the counterpart of Gaussian random vectors.<n>Our formalism involves a whitening/regularization operator $L: Sto S'$ whose continuous extension induces a native Hilbert space $Hsubset S'$ that plays a central role in our characterization.
  arXiv  Detail & Related papers  (2026-08-28T15:34:46Z)
• Random features for Grassmannian kernel approximation with bounded rank-one projections [5.3340963304980535]
  We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces.<n>We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels.<n>Experiments on synthetic data and ETH-80 classification tasks show that these features accurately preserve Grassmannian geometry while reducing computation, memory, and storage.
  arXiv  Detail & Related papers  (2026-08-04T21:02:15Z)
• Notes on Kernel Methods in Machine Learning [0.8435614464136675]
  We develop the theory of positive definite kernels, reproducing kernel Hilbert spaces (RKHS), and Hilbert-Schmidt operators.<n>We also introduce kernel density estimation, kernel embeddings of distributions, and the Maximum Mean Discrepancy (MMD)<n>The exposition is designed to serve as a foundation for more advanced topics, including Gaussian processes, kernel Bayesian inference, and functional analytic approaches to modern machine learning.
  arXiv  Detail & Related papers  (2025-11-18T13:29:07Z)
• Unified Native Spaces in Kernel Methods [0.0]
  This paper unifies a wealth of well-known kernels into a single class that encompasses them as special cases.<n>As a by-product, we infer the Sobolev spaces that are associated with existing classes of kernels.
  arXiv  Detail & Related papers  (2025-01-03T14:17:41Z)
• pyBregMan: A Python library for Bregman Manifolds [56.880400342980394]
  A Bregman manifold is a dually flat space in information geometry which admits as a canonical divergence a Bregman divergence. We describe the design of pyBregMan, a library which implements generic operations on Bregman manifold. The library also provides several core algorithms for various applications in statistics, machine learning, information fusion, and so on.
  arXiv  Detail & Related papers  (2024-08-08T02:38:19Z)
• Decentralized Riemannian Conjugate Gradient Method on the Stiefel Manifold [59.73080197971106]
  This paper presents a first-order conjugate optimization method that converges faster than the steepest descent method. It aims to achieve global convergence over the Stiefel manifold.
  arXiv  Detail & Related papers  (2023-08-21T08:02:16Z)
• Non-separable Covariance Kernels for Spatiotemporal Gaussian Processes based on a Hybrid Spectral Method and the Harmonic Oscillator [0.0]
  We present a hybrid spectral approach for generating covariance kernels based on physical arguments. We derive explicit relations for the covariance kernels in the three oscillator regimes (underdamping, critical damping, overdamping) and investigate their properties.
  arXiv  Detail & Related papers  (2023-02-19T14:12:48Z)
• Stationary Kernels and Gaussian Processes on Lie Groups and their Homogeneous Spaces II: non-compact symmetric spaces [43.877478563933316]
  In to symmetries is one of the most fundamental forms of prior information one can consider. In this work, we develop constructive and practical techniques for building stationary Gaussian processes on a very large class of non-Euclidean spaces.
  arXiv  Detail & Related papers  (2023-01-30T17:27:12Z)
• Continuous percolation in a Hilbert space for a large system of qubits [58.720142291102135]
  The percolation transition is defined through the appearance of the infinite cluster. We show that the exponentially increasing dimensionality of the Hilbert space makes its covering by finite-size hyperspheres inefficient. Our approach to the percolation transition in compact metric spaces may prove useful for its rigorous treatment in other contexts.
  arXiv  Detail & Related papers  (2022-10-15T13:53:21Z)
• Minimax Optimal Kernel Operator Learning via Multilevel Training [11.36492861074981]
  We study the statistical limit of learning a Hilbert-Schmidt operator between two infinite-dimensional Sobolev reproducing kernel Hilbert spaces. We develop a multilevel kernel operator learning algorithm that is optimal when learning linear operators between infinite-dimensional function spaces.
  arXiv  Detail & Related papers  (2022-09-28T21:31:43Z)
• Stationary Kernels and Gaussian Processes on Lie Groups and their Homogeneous Spaces I: the compact case [43.877478563933316]
  In to symmetries is one of the most fundamental forms of prior information one can consider. In this work, we develop constructive and practical techniques for building stationary Gaussian processes on a very large class of non-Euclidean spaces.
  arXiv  Detail & Related papers  (2022-08-31T16:40:40Z)
• Experimental Design for Linear Functionals in Reproducing Kernel Hilbert Spaces [102.08678737900541]
  We provide algorithms for constructing bias-aware designs for linear functionals. We derive non-asymptotic confidence sets for fixed and adaptive designs under sub-Gaussian noise.
  arXiv  Detail & Related papers  (2022-05-26T20:56:25Z)
• Geometry-aware Bayesian Optimization in Robotics using Riemannian Mat\'ern Kernels [64.62221198500467]
  We show how to implement geometry-aware kernels for Bayesian optimization. This technique can be used for control parameter tuning, parametric policy adaptation, and structure design in robotics.
  arXiv  Detail & Related papers  (2021-11-02T09:47:22Z)
• Vector-valued Gaussian Processes on Riemannian Manifolds via Gauge Equivariant Projected Kernels [108.60991563944351]
  We present a recipe for constructing gauge equivariant kernels, which induce vector-valued Gaussian processes coherent with geometry. We extend standard Gaussian process training methods, such as variational inference, to this setting.
  arXiv  Detail & Related papers  (2021-10-27T13:31:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.