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

2595187761,035 · Jun 202019922001200920172026
48 results for function space 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.

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.

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 ↗

Paper classifies critical points in half-space with new distance function.

problem Classifying critical points in half-space with capillary CMC hypersurfaces.
method New shifted distance function for capillary problem in half-space.
result Proves Alexandrov-type theorem for singular capillary CMC hypersurfaces.

The paper proves isoparametric functions on Finsler space forms under specific conditions.

problem Understanding isoparametric functions in Finsler space forms.
method Proving transnormal functions as isoparametric functions and constructing global and local isoparametric functions using the distance function.
result Generalization of Theorem B to Finsler space forms.

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.

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 ↗

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 ↗

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.

This paper explores infinite-dimensional Teichmüller spaces and their properties.

problem Teichmüller spaces of infinite-type surfaces are complex and depend on base structures.
method Study various distance functions and Teichmüller spaces associated with infinite-type surfaces.
result Finitely supported Teichmüller space is dense in asymptotically isometric Teichmüller space.

Unlike the case of surfaces of topologically finite type, there are several different Teichmüller spaces that are associated to a surface of topological infinite type. These Teichmüller spaces first depend (set-theoretically) on whether we work in the hyperbolic category or in the conformal category. They also depend, …

2008-08-06abs ↗pdf ↗

We propose a geometric method for quantifying the difference between parametrized curves in Euclidean space by introducing a distance function on the space of parametrized curves up to rigid transformations (rotations and translations). Given two curves, the distance between them is defined as the infimum of an energy …

2014-01-20abs ↗pdf ↗

The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between topological spaces endowed with continuous real-valued functions. Roughly speaking, the natural pseudo-distance is defined as the infimum of the change of the functions' values, when moving from one space to …

2009-06-25abs ↗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.

In this paper, we focus on the separability of classes with the cross-entropy loss function for classification problems by theoretically analyzing the intra-class distance and inter-class distance (i.e. the distance between any two points belonging to the same class and different classes, respectively) in the feature s…

2019-09-16abs ↗pdf ↗

The paper analyzes distances and volumes in lens spaces using recursion and formulas.

problem The problem of moments for distances between points on lens spaces.
method Derivation of recursion relations, formulas for moments and moment generating function, explicit formula for ball volumes.
result Explicit formulas for the volume of balls of all radii in lens spaces.

The paper proves inequalities linking Wasserstein distances and eigenfunctions in RCD(K,∞) spaces.

problem Estimating Wasserstein distances and their bounds in RCD(K,∞) spaces.
method Similar techniques used to prove inequalities involving pp-Wasserstein distances and Laplace eigenfunctions.
result Proves a conjectured lower bound on pp-Wasserstein distance between positive and negative parts of Laplace eigenfunctions.

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 ↗

Synthetic proof shows globally hyperbolic Lorentzian spaces with specific curvature are warped products.

problem Synthetic proof of rigidity for globally hyperbolic Lorentzian spaces.
method Synthetic geometry and warped product analysis.
result Spaces with specific curvature and distance realizer are warped products.

Diffusion models achieve nearly optimal distribution estimation in various spaces.

problem Theoretical limitations of diffusion modeling for distribution estimation.
method Analysis of approximation and generalization abilities of diffusion models in Besov spaces.
result Diffusion models achieve nearly minimax optimal estimation rates in total variation and Wasserstein distances.

This thesis uses Kantorovich-Rubinstein distance for classifying points based on their measures.

problem Classifying points based on their measures in a metric space.
method Using Kantorovich-Rubinstein distance as a metric in the space of measures to capture geometry and topology.
result A large Kantorovich-Rubinstein distance indicates the existence of a 1-Lipschitz classifier that well classifies the points.

Paper calculates distances between strata in Teichmüller space, proving a constant separation.

problem Measuring distances in the Weil-Petersson metric on Teichmüller space.
method Analyzes distances between strata, proving a constant separation and providing bounds.
result Proves the optimal value for minimal separation between strata is a constant δ1,1δ_{1,1}.

We produce examples of codimension one foliations of the Euclidean and hyperbolic planes with bounded geometry which are topologically products, but for which leaves are non-recursively distorted. That is, the function which compares intrinsic distances in leaves with extrinsic distances in the ambient space grows fast…

2000-02-23abs ↗pdf ↗

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.

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 ↗

The Johnson-Lindenstrauss Lemma allows for the projection of nn points in pp-dimensional Euclidean space onto a kk-dimensional Euclidean space, with k24lnn3ε22ε3k \ge \frac{24\ln \emph{n}}{3ε^2-2ε^3}, so that the pairwise distances are preserved within a factor of 1±ε1\pmε. Here, working directly with the distributions of the …

2010-05-10abs ↗pdf ↗

Null distance encodes causal structure in spacetimes.

problem Encoding causal structure in Lorentzian manifolds.
method Using null distance defined by Sormani and Vega, and proving causal structure is encoded by null distance.
result Lorentzian isometry between spacetimes with bijective map preserving null distance and cosmological time function.

The paper proves uniform Temple charts and applies them to null distance metrics.

problem Proving the existence of uniform Temple charts and their applications to null distance metrics.
method Constructing uniform Temple charts and estimating gradients of optical functions; applying these charts to study spacetime metrics.
result Proves (N,d^τ)(N, \hat{d}_τ) is a rectifiable metric space and applies a Lorentzian isometry theorem.

Landmark-based node embeddings approximate shortest path distances in random graphs.

problem Capturing global graph distances in node representations.
method Landmark-based node embeddings using shortest path distances from a subset of reference nodes (landmarks).
result Random graphs require lower dimensions in landmark-based embeddings compared to worst-case graphs.

Proposes a new scoring function for linear classifiers to improve object positioning in feature space.

problem Lack of information about relative positions of recognized objects in feature space.
method Calculates a scoring function based on object distance from decision boundary and class centroid.
result Demonstrates effectiveness of the proposed method compared to other ensemble algorithms on multiple datasets.