arXiv research

New kernel improves MMDs with theoretical guarantees for gradient flows.

Proposes a new method for posterior sampling using MMD with negative distance kernel.

We provide a unifying framework linking two classes of statistics used in two-sample and independence testing: on the one hand, the energy distances and distance covariances from the statistics literature; on the other, maximum mean discrepancies (MMD), that is, distances between embeddings of distributions to reproduc…

New distances measure mixtures of Gaussians, useful in machine learning.

We provide a unifying framework linking two classes of statistics used in two-sample and independence testing: on the one hand, the energy distances and distance covariances from the statistics literature; on the other, distances between embeddings of distributions to reproducing kernel Hilbert spaces (RKHS), as establ…

A new metric for comparing probability measures on graphs, scalable and negative definite.

We propose $\textit{weighted inner product similarity}$ (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive and negative values. Despite its simplicity, WIPS can approximate arbitrary general similarities in…

Positive definite kernels are an important tool in machine learning that enable efficient solutions to otherwise difficult or intractable problems by implicitly linearizing the problem geometry. In this paper we develop a set-theoretic interpretation of the Earth Mover's Distance (EMD) and propose Earth Mover's Interse…

The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on the arc lengths, angles and curvature of the transformations are proposed, and v…

Optimal transport (\OT) theory defines a powerful set of tools to compare probability distributions. \OT~suffers however from a few drawbacks, computational and statistical, which have encouraged the proposal of several regularized variants of OT in the recent literature, one of the most notable being the \textit{slice…

Algorithm finds best Dirac mass approximation of target measure.

We study the subelliptic heat kernel of the sub-Laplacian on a 2n+1-dimensional anti-de Sitter space H2n+1 which also appears as a model space of a CR Sasakian manifold with constant negative sectional curvature. In particular we obtain an explicit and geometrically meaningful formula for the subelliptic heat kernel. T…

Reconstructing manifolds from partial distance and heat kernel data.

Graph distance metric learning serves as the foundation for many graph learning problems, e.g., graph clustering, graph classification and graph matching. Existing research works on graph distance metric (or graph kernels) learning fail to maintain the basic properties of such metrics, e.g., non-negative, identity of i…

We show in this note that the Sobolev Discrepancy introduced in Mroueh et al in the context of generative adversarial networks, is actually the weighted negative Sobolev norm $||.||_{\dot{H}^{-1}(ν_q)}$, that is known to linearize the Wasserstein $W_2$ distance and plays a fundamental role in the dynamic formulation of…

The paper describes flows of MMD functionals with distance kernel and quantile functions.

Algebraic topology methods have recently played an important role for statistical analysis with complicated geometric structured data such as shapes, linked twist maps, and material data. Among them, \textit{persistent homology} is a well-known tool to extract robust topological features, and outputs as \textit{persist…

Since persistence diagrams do not admit an inner product structure, a map into a Hilbert space is needed in order to use kernel methods. It is natural to ask if such maps necessarily distort the metric on persistence diagrams. We show that persistence diagrams with the bottleneck distance do not even admit a coarse emb…

We construct near-optimal coresets for kernel density estimates for points in $\mathbb{R}^d$ when the kernel is positive definite. Specifically we show a polynomial time construction for a coreset of size $O(\sqrt{d}/\varepsilon\cdot \sqrt{\log 1/\varepsilon} )$, and we show a near-matching lower bound of size $Ω(\min\…

We show that one can obtain logarithmic improvements of $L^2$ geodesic restriction estimates for eigenfunctions on 3-dimensional compact Riemannian manifolds with constant negative curvature. We obtain a $(\logλ)^{-\frac12}$ gain for the $L^2$-restriction bounds, which improves the corresponding bounds of Burq, Gérard …

We extend Sobolev transport to unbalanced measures on graphs.

Distance-based tests, also called "energy statistics", are leading methods for two-sample and independence tests from the statistics community. Kernel-based tests, developed from "kernel mean embeddings", are leading methods for two-sample and independence tests from the machine learning community. A fixed-point transf…

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 …

In the context of kernel methods, the similarity between data points is encoded by the kernel function which is often defined thanks to the Euclidean distance, a common example being the squared exponential kernel. Recently, other distances relying on optimal transport theory - such as the Wasserstein distance between …

Paper improves Monte Carlo sampling with new theoretical insights and methods.

Extends Mahalanobis distance to Banach spaces for anomaly detection.

A new distance metric compares probability distributions using kernel covariance operators.

Complete Finsler spaces with negative Ricci curvature are reversible.

Proposes a new method to improve regression models with reweighted samples.

The paper proves inequalities linking Wasserstein distances and eigenfunctions in RCD(K,∞) spaces.

Optimal transport distances, otherwise known as Wasserstein distances, have recently drawn ample attention in computer vision and machine learning as a powerful discrepancy measure for probability distributions. The recent developments on alternative formulations of the optimal transport have allowed for faster solutio…

The Wasserstein distance is a powerful metric based on the theory of optimal transport. It gives a natural measure of the distance between two distributions with a wide range of applications. In contrast to a number of the common divergences on distributions such as Kullback-Leibler or Jensen-Shannon, it is (weakly) co…

A new method improves graph node embeddings by considering both nearby and distant node similarities.

Study proposes a new metric for comparing Gaussian mixtures in RKHS.

This thesis improves kernel-based distances for statistical inference and integration.

Models like support vector machines or Gaussian process regression often require positive semi-definite kernels. These kernels may be based on distance functions. While definiteness is proven for common distances and kernels, a proof for a new kernel may require too much time and effort for users who simply aim at prac…

Model place cells as spatial embeddings for efficient path planning and cognitive map construction.

In the spirit of Otal and Croke, we prove that a negatively-curved asymptotically hyperbolic surface is boundary distance rigid, where the distance between two points on the boundary at infinity is defined by a renormalized quantity.

Revises SWK for persistence diagrams using Figalli-Gigli distance.

For many machine learning problem settings, particularly with structured inputs such as sequences or sets of objects, a distance measure between inputs can be specified more naturally than a feature representation. However, most standard machine models are designed for inputs with a vector feature representation. In th…

kdiff measures distances for time series and structured data.

New KQEs improve probability metrics without mean function constraints.

Distance correlation has gained much recent attention in the data science community: the sample statistic is straightforward to compute and asymptotically equals zero if and only if independence, making it an ideal choice to discover any type of dependency structure given sufficient sample size. One major bottleneck is…

Maximum mean discrepancy (MMD), also called energy distance or N-distance in statistics and Hilbert-Schmidt independence criterion (HSIC), specifically distance covariance in statistics, are among the most popular and successful approaches to quantify the difference and independence of random variables, respectively. T…

Persistence diagrams (PDs) play a key role in topological data analysis (TDA), in which they are routinely used to describe topological properties of complicated shapes. PDs enjoy strong stability properties and have proven their utility in various learning contexts. They do not, however, live in a space naturally endo…

A new framework for robust transfer learning that avoids negative transfer in domains with unequal information.

Develops a universal Hermitian projective calculus for complex hyperbolic two-space

Kernel methods identify treatment effects with unobserved confounding using negative controls.