(De)-regularized maximum mean discrepancy gradient flow
From MaRDI portal
Cites work
- (f,)-divergences: interpolating between f-divergences and integral probability metrics
- \{Euclidean, metric, and Wasserstein\} gradient flows: an overview
- A blob method for inhomogeneous diffusion with applications to multi-agent control and sampling
- A kernel two-sample test
- An invitation to statistics in Wasserstein space
- Analysis of Langevin Monte Carlo via convex optimization
- Approximation by finitely supported measures
- Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
- Data spectroscopy: eigenspaces of convolution operators and clustering
- Displacement convexity of generalized relative entropies
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization
- Hilbert space embeddings and metrics on probability measures
- scientific article; zbMATH DE number 3121490 (Why is no real title available?)
- scientific article; zbMATH DE number 3173999 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 2152346 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Learning Theory
- Lipschitz-regularized gradient flows and generative particle algorithms for high-dimensional scarce data
- Mehler’s Formula, Branching Process, and Compositional Kernels of Deep Neural Networks
- Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs
- Nonlocal approximation of slow and fast diffusion
- Note on the derivatives with respect to a parameter of the solutions of a system of differential equations.
- On Fréchet subdifferentials
- On regularization algorithms in learning theory
- On the optimal estimation of probability measures in weak and strong topologies
- On the optimality of kernel-embedding based goodness-of-fit tests
- On the rate of convergence in Wasserstein distance of the empirical measure
- Optimal bounds between f-divergences and integral probability metrics
- Optimal rates for the regularized least-squares algorithm
- Rényi Divergence and Kullback-Leibler Divergence
- Sobolev norm learning rates for regularized least-squares algorithms
- Spectral regularized Kernel two-sample tests
- Support Vector Machines
- The Bayesian update: variational formulations and gradient flows
- The Variational Formulation of the Fokker--Planck Equation
- Theory of Reproducing Kernels
- Uniform-in-time propagation of chaos for kinetic mean field Langevin dynamics
- Universality, Characteristic Kernels and RKHS Embedding of Measures
- User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
- VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES AND UNIVERSALITY
- Wasserstein steepest descent flows of discrepancies with Riesz kernels
This page was built for publication: (De)-regularized maximum mean discrepancy gradient flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308349)
