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

73146218291 · Jun 202019922001200920172026
48 results for Convex Distance

The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. This link makes possible a better understanding of both theories. The concepts of the theory of affine spheres lead to a new definition of an …

2007-10-09abs ↗pdf ↗

The paper studies convexity of products of squared Euclidean distances.

problem Convexity of products of squared Euclidean distances.
method Proved a convexity principle and applied it to products of squared distances, computed Hessian-positive regions and exact convexity levels.
result Computed exact convexity and quasiconvexity truncation levels for the two-centre model.

We find a different approach to define convex functions in the sub-Riemannian setting. A function on a sub-Riemannian manifold is nonholonomically geodesic convex if its restriction to any nonholonomic (straightest) geodesic is convex. In the case of Carnot groups, this definition coincides with that by Danniell-Garofa…

2007-01-10abs ↗pdf ↗

Optimally shows the distance between perturbed convex functions and their Γ-regularizations.

problem Understanding the difference between perturbed convex functions and their Γ-regularizations.
method Analyzing the compactly supported perturbation and the Γ-regularization of a strictly convex function.
result The optimal estimate of the distance between perturbed convex functions and their Γ-regularizations is shown to be o(ε)o(ε).

We give a necessary complex geometric condition for a bounded smooth convex domain in Cn, endowed with the Kobayashi distance, to be Gromov hyperbolic. More precisely, we prove that if a smooth bounded convex domain contains an analytic disk in its boundary, then the domain is not Gromov hyperbolic for the Kobayashi di…

2013-12-02abs ↗pdf ↗

We use the intrinsic area to define a distance on the space of homothety classes of convex bodies in the nn-dimensional Euclidean space, which makes it isometric to a convex subset of the infinite dimensional hyperbolic space. The ambient Lorentzian structure is an extension of the intrinsic area form of convex bodies…

2018-06-25abs ↗pdf ↗

Paper introduces length measures for curves and convex shapes, proving isoperimetric and distance properties.

problem Characterizing and comparing convex shapes using length measures.
method Developed length measures for curves and convex shapes, derived properties, and introduced a new distance metric.
result Unique convex curve maximizes signed area among curves with same length measure.

Paper tackles robust optimization under uncertainty using nested distance.

problem Optimizing under distributionally robust uncertainty with nested distance.
method Equivalent recursive and dynamic programming reformulations for tractable optimization.
result Optimal robust policies can be found efficiently using convex optimization.

Optimal inequalities found between Riemannian and Hilbert metrics in convex projective domains.

problem Finding optimal bounds between Riemannian and Hilbert metrics in convex projective domains.
method Optimal control techniques applied to Riemannian metrics induced by centro-affine hypersurface immersions.
result Optimal inequalities between Riemannian and Hilbert metrics for a class of convex projective domains.

We define a novel class of distances between statistical multivariate distributions by modeling an optimal transport problem on their marginals with respect to a ground distance defined on their conditionals. These new distances are metrics whenever the ground distance between the marginals is a metric, generalize both…

2018-12-19abs ↗pdf ↗

CDOT optimizes transport between domains preserving both feature and geometric structure.

problem Optimizing transport between heterogeneous domains with preserved feature and geometric structure.
method CDOT uses operator-based regularization to align distance structures, proving pseudometric properties.
result CDOT improves robustness to local geometric variations and is provably convex.

New examples show flip distance and polyhedron triangulation numbers differ, with ratio close to 3/2.

problem Understanding the relationship between flip distance and polyhedron triangulation numbers.
method Provided examples to demonstrate the difference between flip distance and polyhedron triangulation numbers.
result Ratio of flip distance to polyhedron triangulation numbers can be arbitrarily close to 3/2.

We study the level sets of the distance function from a boundary point of a convex set in Euclidean space. We provide a lower bound for the range of connectivity of the level sets, in terms of the critical points of the distance function in the sense of Grove-Shiohama-Gromov-Cheeger.

2019-10-06abs ↗pdf ↗

Study convexity of Mabuchi functional in big cohomology classes.

problem Convexity of Mabuchi functional in big cohomology classes.
method Defined an invariant related to transcendental Fujita approximations and established convexity under vanishing of this invariant.
result Established almost convexity along weak geodesics in big cohomology classes.

Paper presents efficient computation of robust Wasserstein distance using Riemannian optimization.

problem Intractability of optimizing Projection Robust Wasserstein (PRW) distance due to non-convexity and non-smoothness.
method Riemannian optimization to efficiently compute PRW/Wasserstein Projection Pursuit (WPP) distance.
result The original formulation of PRW/WPP can be efficiently computed in practice, providing better behavior than its convex relaxation.

Paper reconstructs compact Riemannian manifolds from travel time data.

problem Reconstructing compact Riemannian manifolds from partial travel time data.
method Embedding in function space, studying distance function regularity.
result Reconstruction of compact Riemannian manifolds from travel time data.

Paper introduces robust market making using Wasserstein distance and entropy regularization.

problem Market making robustness under uncertainty.
method Wasserstein distance, entropy regularization, convex optimization, optimal radius selection.
result The robust market making problem can be reformulated as a convex optimization problem.

In this paper we consider the problem of minimizing the relative perimeter under a volume constraint in the interior of a convex body, i.e., a compact convex set in Euclidean space with interior points. We shall not impose any regularity assumption on the boundary of the convex set. Amongst other results, we shall prov…

2013-02-19abs ↗pdf ↗

Expands learning paradigm to stochastic orders using Choquet-Toland distance and Variational Dominance Criterion.

problem Learning high-dimensional distributions with stochastic orders.
method Introduces Choquet-Toland distance and Variational Dominance Criterion, uses input convex maxout networks (ICMNs).
result Proposes surrogates for Choquet-Toland distance and Variational Dominance Criterion with parametric rates.

Existence of harmonic maps near projections in hyperbolic spaces for large convex sets.

problem Existence of harmonic maps near projections in hyperbolic spaces.
method Weak quasi-isometry condition, non-collapsing property, harmonic measures.
result Existence of harmonic maps at finite distance from projections of large convex sets in hyperbolic spaces.

We show that, on an oriented compact surface, two sufficiently C2C^2-close Riemannian metrics with strictly convex boundary, no conjugate points, hyperbolic trapped set for their geodesic flows, and same marked boundary distance, are isometric via a diffeomorphism that fixes the boundary. We also prove that the same co…

2016-02-09abs ↗pdf ↗

Quasifuchsian hyperbolic manifolds, or more generally convex co-compact hyperbolic manifolds, have infinite volume, but they have a well-defined ``renormalized'' volume. We outline some relations between this renormalized volume and the volume, or more precisely the ``dual volume'', of the convex core. On one hand, the…

2019-03-23abs ↗pdf ↗

Let Uc(H)=u:uisunitaryandu1iscompactU_c(H)={u: u is unitary and u-1 is compact} stand for the unitary Fredholm group. We prove the following convexity result. Denote by dd_\infty the rectifiable distance induced by the Finsler metric given by the operator norm in Uc(H)U_c(H). If u0,u1,uUc(H)u_0,u_1,u\in U_c(H) and the geodesic ββ joining u0u_0 and u1u_1 in $U…

2008-12-24abs ↗pdf ↗

New tools for estimating and inferring Wasserstein distance in topic models.

problem Estimating and inferring the Wasserstein distance between mixing measures in topic models.
method New canonical interpretation and tools for inference on Wasserstein distance in topic models.
result First minimax lower bounds and fully data-driven inferential tools for the Wasserstein distance in topic models.

Estimates convex hulls of smooth function images with error bounds.

problem Estimating the convex hull of the image of a smooth boundary set.
method Using submersion properties and sampling inputs, derive bounds on Hausdorff distance.
result New tighter and more general error bounds for geometric inference.

Study improves estimation of functions from noisy data using convex penalties.

problem Estimating functions from noisy point evaluations of linear operators.
method Tikhonov regularization with convex and pp-homogeneous penalty functionals.
result Derives concentration rates for regularized solutions in symmetric Bregman distance.

Transportation distances have been used for more than a decade now in machine learning to compare histograms of features. They have one parameter: the ground metric, which can be any metric between the features themselves. As is the case for all parameterized distances, transportation distances can only prove useful in…

2011-10-11abs ↗pdf ↗

New adapted renormalized volume for hyperbolic 3-manifolds with compressible boundary.

problem Analyzing convex co-compact hyperbolic 3-manifolds with compressible boundaries.
method Defining and analyzing a new version of the renormalized volume.
result The adapted renormalized volume is bounded and has properties analogous to the classical renormalized volume.

Maps between Hadamard manifolds are quasi-isometric to harmonic maps.

problem Understanding the relationship between quasi-isometric maps and harmonic maps on Hadamard manifolds.
method Extending a previous result to quotient spaces of Hadamard manifolds by convex cocompact discrete groups.
result Locally quasi-isometric maps to Hadamard manifolds are within bounded distance from a unique harmonic map.

Revisits Isomap, showing it constructs Euclidean representations of geodesic structure.

problem Nonlinear dimension reduction of manifold data.
method Revisits Isomap's rationale, clarifying its approach to constructing Euclidean representations of geodesic structure.
result Convexity is not required for shortest path distances to converge to Riemannian distances.

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the orthogonal direction. This result has important applications in the regularity theory …

2011-07-06abs ↗pdf ↗

We characterize convex isoperimetric sets in the Heisenberg group endowed with horizontal perimeter. We first prove Sobolev regularity for a certain class of vector fields in the plane with bounded variation, related to the curvature equations. Then, by an approximation-reparameterization argument, we show that the bou…

2006-07-26abs ↗pdf ↗