Related papers: A Metric Approach to Elastic Reformations
Geometric mechanics models of locomotion have provided insight into how robots and animals use environmental interactions to convert internal shape changes into displacement through the world, encoding this relationship in a ``motility…
A new variational formulation is herein proposed for the solution of adhesive contact problems for non-planar profiles of arbitrary shape indenting a deformable half-plane. The method exploits the original idea of accounting for the shape…
Many numerical and learning algorithms rely on the solution of the Monge-Kantorovich problem and Wasserstein distances, which provide appropriate distributional metrics. While the natural approach is to treat the problem as an…
We develop a new method for visualizing and refining the invariances of learned representations. Specifically, we test for a general form of invariance, linearization, in which the action of a transformation is confined to a low-dimensional…
For all $1\leq m\leq n-1$, we investigate the interaction of locally finite measures in $\mathbb{R}^n$ with the family of $m$-dimensional Lipschitz graphs. For instance, we characterize Radon measures $\mu$, which are carried by Lipschitz…
This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to…
To quantify the dependence between two random vectors of possibly different dimensions, we propose to rely on the properties of the 2-Wasserstein distance. We first propose two coefficients that are based on the Wasserstein distance between…
An important operation in geometry processing is finding the correspondences between pairs of shapes. The Gromov-Hausdorff distance, a measure of dissimilarity between metric spaces, has been found to be highly useful for nonrigid shape…
A novel framework for density estimation under expectation constraints is proposed. The framework minimizes the Wasserstein distance between the estimated density and a prior, subject to the constraints that the expected value of a set of…
It is perhaps not widely recognized that certain common notions of distance between probability measures have an alternative dual interpretation which compares corresponding functionals against suitable families of test functions. This dual…
This paper analyzes the Lipschitz behavior of the feasible set in two parametric settings, associated with linear and convex systems in R^n. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified…
Geometrization of a Lagrangian conservative system typically amounts to reformulating its equations of motion as the geodesic equations in a properly chosen curved spacetime. The conventional methods include the Jacobi metric and the…
In this paper, we explore the concept of metric-driven numerical methods as a powerful tool for solving various types of multiscale partial differential equations. Our focus is on computing constrained minimizers of functionals - or,…
We provide an implementation to compute the flat metric in any dimension. The flat metric, also called dual bounded Lipschitz distance, generalizes the well-known Wasserstein distance $W_1$ to the case that the distributions are of unequal…
This thesis studies modified theories of gravity from a geometric viewpoint. We review the motivations for considering alternatives to General Relativity and cover the mathematical foundations of gravitational theories in Riemannian and…
The quantum measurement procedure based on the Lorentz transformation formalism and weak perturbation of the system is considered. In the simple case of a single-qubit it turns out that one can perform 4-dimension pseudo-rotation along with…
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…
We propose a learning framework for graph kernels, which is theoretically grounded on regularizing optimal transport. This framework provides a novel optimal transport distance metric, namely Regularized Wasserstein (RW) discrepancy, which…
I here investigate what is arguably the most significant residual challenge for the proposal of phenomenologically viable "DSR deformations" of relativistic kinematics, which concerns the description of composite particles, such as atoms.…
A recent paper by Cordero-Erausquin and Klartag provides a characterization of the measures $\mu$ on $\R^d$ which can be expressed as the moment measures of suitable convex functions $u$, i.e. are of the form $(\nabla u)\_\\#e^{- u}$ for…