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

181361542722 · Jun 202019922001200920172026
48 results for Distance function

The paper tightens bounds on distances between Reeb graphs.

problem Certifying quasi-universality of distances between Reeb graphs.
method Establishes tight bi-Lipschitz bounds for various distances.
result Proves strict universality of the functional contortion distance for contour trees and coincides with interleaving distance for merge trees.

Learning a distance function or metric on a given data manifold is of great importance in machine learning and pattern recognition. Many of the previous works first embed the manifold to Euclidean space and then learn the distance function. However, such a scheme might not faithfully preserve the distance function if t…

2014-05-01abs ↗pdf ↗

A distance-squared function is one of the most significant functions in the application of singularity theory to differential geometry. Moreover, distance-squared mappings are naturally extended mappings of distance-squared functions, wherein each component is a distance-squared function. In this paper, compositions of…

2018-01-04abs ↗pdf ↗

A distance-squared function is one of the most significant functions in the application of singularity theory to differential geometry. In this paper, we define naturally extended mappings of distance-squared functions, wherein each component is a distance-squared function. We investigate the properties of these mappin…

2012-11-21abs ↗pdf ↗

We propose fast approximations for the generalized sliced-Wasserstein distance.

problem Efficient approximation of the generalized sliced-Wasserstein distance in high dimensions.
method Deterministic approximations using random projections and concentration of measure results.
result One-dimensional projections of high-dimensional random vectors are approximately Gaussian.

The paper classifies singularities of plane congruences and affine distance functions.

problem Classifying singularities of plane congruences and affine distance functions.
method Classification through 2-parameter plane congruences in \(\mathbb{R^4}\) and affine normal plane congruences.
result Generic singularities of plane congruences and affine distance functions are classified.

The aim of this article is to generalize the notion of the cut locus and to get the structure theorem for it. For this purpose, we first introduce a class of 1-Lipschitz functions, each member of which is called an {\it almost distance function}. Typical examples of an almost distance function are the distance function…

2018-03-12abs ↗pdf ↗

We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit distance for Reeb graphs and prove that it is stable and universal, meaning that it pr…

2018-01-05abs ↗pdf ↗

On a complete, connected, locally compact, non-compact geodesic space (X,d)(X,d), we assign each compact set a distance-like function. With the help of these functions, we obtain a pseudo-metric on the space of (non-empty) compact subsets of XX which is less than the Hausdorff distance. The quotient metric space is close…

2019-11-20abs ↗pdf ↗

Proves limit curve theorem for incomplete metric spaces, applies to null distance in Lorentzian manifolds.

problem Control of Lorentzian lengths of limit curves in incomplete metric spaces.
method Proves limit curve theorem for incomplete metric spaces and applies to null distance.
result Strong control on Lorentzian lengths of limit curves in Sormani and Vegas' null distance.

Study spider mechanism configuration spaces using squared distance function.

problem Understand configuration spaces of spider mechanisms.
method Use Morse theory of squared distance function from body to fixed point.
result List and describe critical manifolds of squared distance function as products of polygon spaces.

New method estimates SW distance using CDFs for scalable data parallelism.

problem Estimating SW distance efficiently for large datasets.
method Estimators based on CDFs of projected measures, avoiding sorting.
result Efficient estimation for large datasets and federated learning.

The Lorentzian length, which is one of the most significant functions in Lorentzian geometry, is a complex-valued function. Its square gives a real-valued non-degenerate quadratic function. In this paper, we define naturally extended mappings of Lorentzian distance-squared functions, wherein each component is a Lorentz…

2013-06-19abs ↗pdf ↗

Study proves finiteness for distance functions on curved surfaces with controlled curvature.

problem Understanding distance functions on curved surfaces with Hölder continuous curvature.
method Proves a finiteness principle using Whitney extension theory for geodesics and points on Riemannian surfaces with Hölder continuous curvature.
result Establishes a finiteness principle for isometric embedding of metric spaces into Riemannian surfaces with controlled curvature.

The Heston model is a popular stock price model with stochastic volatility that has found numerous applications in practice. In the present paper, we study the Riemannian distance function associated with the Heston model and obtain explicit formulas for this function using geometrical and analytical methods. Geometric…

2013-02-10abs ↗pdf ↗

Study describes singularities of distance squared functions on singular surfaces.

problem Characterizing singularities of distance squared functions on singular surfaces.
method Using smooth map-germs SkS_k, BkB_k, CkC_k, and F4F_4 singularities, the study describes singularities via blowing-ups.
result Characterization of singularities of wave-fronts and caustics of singular surfaces.

The paper establishes Sobolev inequalities between Riemannian metrics and their distance functions.

problem Establishing a theory of Sobolev inequalities for Riemannian metrics and distance functions.
method Analyzing the sub-critical case $p < rac{m}{2}$, proving a Sobolev inequality linking $L^{ rac{p}{2}}$ bounds on metrics to LqL^q bounds on distance functions.
result A Sobolev inequality exists between Riemannian metrics and their distance functions, leading to a convergence theorem.

The paper connects geometric and topological concepts to bound distances between metric spaces.

problem Bounding distances between metric spaces using Gromov-Hausdorff distance.
method Using Borsuk-Ulam theorems and Vietoris-Rips complexes, the paper obstructs the existence of certain continuous maps between complexes to bound discontinuities of functions.
result The paper provides new bounds on Gromov-Hausdorff distances between spheres of different dimensions.

We show that finiteness of the Lorentzian distance is equivalent to the existence of generalised time functions with gradient uniformly bounded away from light cones. To derive this result we introduce new techniques to construct and manipulate achronal sets. As a consequence of these techniques we obtain a functional …

2014-12-17abs ↗pdf ↗

Defines Lorentzian distance on contactomorphisms, proving continuity and finite conditions.

problem Continuous distance function on contactomorphisms with finite intervals.
method Defining and analyzing Lorentzian distance functions, proving continuity and finite intervals.
result Distance function is continuous and finite if and only if contactomorphisms are orderable.

The distance function ϱ(p,q)\varrho(p,q) (or d(p,q)d(p,q)) of a distance space (general metric space) is not differentiable in general. We investigate such distance spaces over Rn\mathbb R^n, whose distance functions are differentiable like in case of Finsler spaces. These spaces have several good properties, yet they are no F…

2015-05-26abs ↗pdf ↗

The distance function to a generic submanifold behaves well under small perturbations.

problem The critical points of the distance function to a generic submanifold can be poorly behaved.
method Listed and proved regularity conditions on critical and μ-critical points of a submanifold, and showed they are generically satisfied and stable under small C2C^2 perturbations.
result The distance function to a submanifold satisfies Morse-like conditions when the regularity conditions are fulfilled.

To optimize a neural network one often thinks of optimizing its parameters, but it is ultimately a matter of optimizing the function that maps inputs to outputs. Since a change in the parameters might serve as a poor proxy for the change in the function, it is of some concern that primacy is given to parameters but tha…

2018-05-21abs ↗pdf ↗

We propose unsupervised representation learning and feature extraction from dendrograms. The commonly used Minimax distance measures correspond to building a dendrogram with single linkage criterion, with defining specific forms of a level function and a distance function over that. Therefore, we extend this method to …

2018-12-21abs ↗pdf ↗

New null distance bounds confirm Big Bang singularity in cosmological models.

problem Understanding the geometry of spacetime near Big Bang singularities.
method Developed a new null distance metric for temporal functions and applied it to cosmological models.
result Null distance is bounded by a constant multiple of Riemannian distance on level sets with constant gradient norm.

The paper converts metric bounds to distance function Hölder bounds and proves compactness theorems.

problem Proving geometric stability results with scalar curvature bounds.
method Transforming LpL^p bounds to Hölder bounds for distance functions.
result Compactness theorems and convergence guarantees for Riemannian manifolds.

The paper explores the shape of filling-systole subspace in surface moduli space and critical points of systole function.

problem Understanding the structure and critical points of the filling-systole subspace in surface moduli space.
method Analyzing Teichmüller and Weil-Petersson distances to determine the proximity of points to the subspace.
result Most points in Mg\mathcal{M}_g are within a specific Teichmüller distance from XgX_g and have a certain distance from the thick part of Mg\mathcal{M}_g.