Search arXiv⌕ Search

arXiv · 2611.09691

A Regular First-Order Calculus for the Wasserstein--Fisher--Rao Geometry

Abstract

We introduce a notion of intrinsic differentiability for functionals on the space of finite nonnegative measures equipped with the Wasserstein--Fisher--Rao (WFR) distance, also known as the Hellinger--Kantorovich (HK) distance. The resulting static first-order calculus accounts simultaneously for spatial transport and mass reweighting. We characterize regular barycentric logarithms through optimal semicouplings and measurable selections at the transport threshold, and prove their tangency at arbitrary finite source measures. The defining expansion extends to non-optimal semicouplings, with remainder of smaller order than the square root of their cost. This yields differentiation formulas for simultaneous transport and reweighting and uniqueness of the gradients. We also give a sufficient criterion in terms of regular flat derivatives. We characterize differentiability of one half the squared WFR distance by a common optimal Monge transport--growth representation with no target mass created from the cone vertex. Equivalently, the regular barycentric logarithm is unique and its norm equals the distance; the gradient is minus this logarithm. Finally, we formulate the corresponding calculus on probability measures. On $\mathcal{P}_2(\mathbb{R}^d)$, WFR differentiability implies intrinsic Wasserstein differentiability, with the transport component of the WFR gradient coinciding with the Wasserstein gradient. Whenever a flat derivative exists, one quarter of the reaction component agrees almost everywhere with its centered representative. As a byproduct we obtain a Wasserstein differentiability result for the squared $\mathrm{WFR}$ distance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Enrico Sartor. 2026-11-06. A Regular First-Order Calculus for the Wasserstein--Fisher--Rao Geometry. https://arxiv.org/abs/2611.09691

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Integer matrices that are not copositive have certificates of less than quadratic complexity

A real symmetric matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic form is negative. Due to the scaling property, we can find such certificates in every neighborhood of the origin but their properties depend on the matrix of course and are hard to describe. If it is an integer matrix however, we are guaranteed certificates of a complexity that is at most a constant times the binary encoding length of the matrix raised to the power 3/2.

math.OC↗

Kernel Metrics and Learning for Borel MDPs: Identifiability and Adaptive Control

We consider a Markov decision process with standard Borel spaces and an unknown transition kernel under the average cost criterion. We do not impose any parametrization on the set of possible kernels. To facilitate our analysis, we first develop implication relations between several topologies on kernels defined by pointwise, continuous, or uniform weak convergence; we then review robustness properties on the space of kernels, and finally we establish compactness conditions on the space of kernels. Building on this regularity analysis, we then present two data-driven identifiability results; the first one being Bayesian and the second one empirical. Our conditions for the Bayesian setting are significantly more relaxed compared with prior work which considered either finite or parametric models, though we do not obtain a rate of convergence. Our analysis is asymptotic and builds on measurability in terms of the tail $σ$-field of the available information. Identifiability results are then used to design near-optimal adaptive control policies which alternate between periods of exploration, where the controller acts according to a policy which is conducive to the identification of the true kernel, and periods of exploitation where the controller's information on the kernel is utilized. We will establish that such policies are near optimal. In summary, our contribution is with regard to the general standard Borel setup where there is no apriori parametric representation.

math.OC↗

Differentiable Nonlinear Model Predictive Control

The efficient computation of parametric solution sensitivities is a key challenge in the integration of learning-enhanced methods with nonlinear model predictive control, as their availability is crucial for many learning algorithms. This paper discusses the computation of solution sensitivities of general nonlinear programs using the implicit function theorem and smoothed optimality conditions treated in interior-point methods (IPM). We introduce sequential barrier quadratic programming (SBQP), which generalizes SQP with an IPM quadratic programming (QP) solver by allowing the barrier parameter to approach a prescribed nonnegative target value, recovering classical SQP when this target is zero. Previous works are limited to convex or unconstrained formulations, or lack an implementation for efficient sensitivity evaluation. The publication is accompanied by an efficient open-source implementation within the `acados` framework, providing both forward and adjoint sensitivities for general optimal control problems, achieving speedups exceeding 3x over the state-of-the-art solvers `mpc.pytorch` and `cvxpygen`.

math.OC↗