Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

214428641855 · Jun 202019922001200920172026
48 results for displacement convex optimization

This paper optimizes functions of probability measures using particle gradient descent for displacement convex functions.

problem Optimizing functions of probability measures with displacement convex properties.
method Particle gradient descent applied to displacement convex functions with theoretical guarantees.
result Finite number of particles and computations are sufficient to find optimal solutions for displacement convex functions.

Nonnegative sectional curvature linked to matrix displacement convexity.

problem Nonnegative sectional curvature in Riemannian manifolds.
method Matrix displacement convexity as a criterion for nonnegative sectional curvature.
result Entropy functional matrix displacement convexity implies nonnegative sectional curvature.

Alexandrov spaces with non-negative curvature are characterized by the matrix displacement convexity of an entropy tensor.

problem Characterizing non-negative curvature in Alexandrov spaces
method Constructing a parallel trivialization of the entropy tensor
result The entropy tensor is matrix displacement convex on Alexandrov spaces

The null energy condition is characterized via convexity of entropy in Lorentzian manifolds.

problem Characterizing the null energy condition in Lorentzian manifolds.
method Characterization via convexity of the relative entropy along displacement interpolations on null hypersurfaces.
result The null energy condition is characterized in terms of convexity of the relative entropy.

Study compares synthetic and distributional Ricci curvature bounds.

problem Comparing synthetic and distributional approaches to lower Ricci curvature bounds.
method Analyzes synthetic via weak displacement convexity and distributional via non-negativity of Ricci-tensor.
result Distributional bounds imply entropy bounds for C1C^1 metrics and vice versa for C1,1C^{1,1} under convergence condition.

One of the most well-known results in the theory of optimal transportation is the equivalence between the convexity of the entropy functional with respect to the Riemannian Wasserstein metric and the Ricci curvature lower bound of the underlying Riemannian manifold. There are also generalizations of this result to the …

2012-05-07abs ↗pdf ↗

We investigate the mm-relative entropy, which stems from the Bregman divergence, on weighted Riemannian and Finsler manifolds. We prove that the displacement KK-convexity of the mm-relative entropy is equivalent to the combination of the nonnegativity of the weighted Ricci curvature and the KK-convexity of the weig…

2010-05-08abs ↗pdf ↗

We show the equivalence of the definitions of very strict CD(K,N)CD(K,N) -condition defined, on one hand, using (only) the entropy functionals, and on the other, the full displacement convexity class DCN\mathcal{DC}_N. In particular, we show that assuming the convexity inequalities for the critical exponent implies it for al…

2019-06-18abs ↗pdf ↗

We define a notion of a measured length space X having nonnegative N-Ricci curvature, for N finite, or having infinity-Ricci curvature bounded below by K, for K a real number. The definitions are in terms of the displacement convexity of certain functions on the associated Wasserstein space P_2(X) of probability measur…

2004-12-07abs ↗pdf ↗

Training models to prefer certain responses can unintentionally shift probability to harmful ones.

problem Likelihood displacement in DPO models, leading to unintended unalignment.
method Characterized and mitigated likelihood displacement using CHES score.
result Training models to prefer certain responses can unintentionally shift probability mass to harmful responses.

This work introduces methods to compute optimal Monge maps and learn elastic costs for efficient data mapping.

problem Efficiently mapping one probability distribution to another using elastic costs.
method Proposes numerical methods to compute optimal Monge maps and a learning loss for parameterized regularizers.
result Proves the optimality of computed Monge maps and learns the parameters of elastic costs.

The paper studies optimal transport in linear quadratic systems and derives interpolation inequalities.

problem Optimal transport problem in Linear Quadratic optimal control systems.
method Well-posedness of the Monge problem, regularity of optimal transport map, displacement interpolation of measures.
result Derivation of general interpolation inequalities for entropy functionals.

Paper proves generalized Talagrand inequality for Sinkhorn distance.

problem Proving a generalized Talagrand inequality for Sinkhorn distance.
method Using entropy power inequality and infinitesimal displacement convexity of optimal transport map.
result Extends previous results of Gaussian Talagrand inequality for Sinkhorn distance to strongly log-concave case.

CAVI converges for log-concave measures via optimal transport.

problem Finding the closest product measure to a log-concave measure via CAVI.
method Adapting coordinate descent techniques from Euclidean space to optimal transport for log-concave densities.
result Proves convergence of CAVI for log-concave densities and provides rates of convergence under additional conditions.

PIE-PINN estimates elastic properties from noisy, low-res displacement data.

problem Estimating heterogeneous elastic properties from low-resolution, noisy data.
method Probabilistic Physics-Informed Neural Network (PIE-PINN) framework combining B-spline and hierarchical scale model.
result Robust estimation of Young's modulus and Poisson's ratio from noisy, low-resolution displacement data.

We introduce a class of generalized relative entropies (inspired by the Bregman divergence in information theory) on the Wasserstein space over a weighted Riemannian or Finsler manifold. We prove that the convexity of all the entropies in this class is equivalent to the combination of the nonnegative weighted Ricci cur…

2011-12-23abs ↗pdf ↗

We define the symplectic displacement energy of a non-empty subset of a compact symplectic manifold as the infimum of the Hofer-like norm [5] of symplectic diffeomorphisms that displace the set. We show that this energy (like the usual displacement energy defined using Hamiltonian diffeomorphisms) is a strictly positiv…

2013-12-13abs ↗pdf ↗

We prove a Kazhdan-Margulis-Zassenhaus lemma for Hilbert geometries. More precisely, in every dimension nn there exists a constant εn>0\varepsilon_n > 0 such that, for any properly open convex set ØØ and any point xØx \in Ø, any discrete group generated by a finite number of automorphisms of ØØ, which displace xx at …

2011-06-16abs ↗pdf ↗

We discuss in this article a property of action of groups by isometries called "well displacing". An action is said to be well displacing, if the displacement function is equivalent to the the displacement function for the action on the Cayley graph. We relate this property with the fact that orbit maps are quasi-isome…

2007-04-26abs ↗pdf ↗

This paper explores the possibility that asset prices, especially those traded in large volume on public exchanges, might comply with specific physical laws of motion and probability. The paper first examines the basic dynamics of asset price displacement and finds one can model this dynamic as a harmonic oscillator at…

2017-05-28abs ↗pdf ↗

The low displacement rank (LDR) framework for structured matrices represents a matrix through two displacement operators and a low-rank residual. Existing use of LDR matrices in deep learning has applied fixed displacement operators encoding forms of shift invariance akin to convolutions. We introduce a class of LDR ma…

2018-10-04abs ↗pdf ↗

This paper presents a methodology and numerical algorithms for constructing accelerated gradient flows on the space of probability distributions. In particular, we extend the recent variational formulation of accelerated gradient methods in (wibisono, et. al. 2016) from vector valued variables to probability distributi…

2019-01-10abs ↗pdf ↗

The paper establishes general results in Lorentzian optimal transport theory.

problem Establishing strong duality and optimality conditions in Lorentzian optimal transport.
method Providing non-trivial assumptions on measures, characterizing optimality, and proving regularity results.
result Regularity results for cc-convex functions and (weak) Kantorovich potentials do not extend to the Lorentzian setting, but under suitable assumptions, they are locally semconvex.

We generalize Lagrangian Floer cohomology to sequences of Lagrangian correspondences. For sequences related by the geometric composition of Lagrangian correspondences we establish an isomorphism of the Floer cohomologies. We give applications to calculations of Floer cohomology, displaceability of Lagrangian correspond…

2009-05-09abs ↗pdf ↗