Graph neural network learns graph distances effectively.
problem Maintaining graph distance metric properties.
method GRAPH-BERT based semi-supervised distance metric learning.
result GB-DISTANCE outperforms existing methods.
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,695 papers · 148 categories
Trend · papers per month
48 results for “Distance Metrics”
CADM proposes a cluster-specific distance metric for categorical data clustering.
problem Inadequate distance metrics for categorical data, especially varying within clusters.
method Cluster-customized adaptive distance metric for categorical data.
result Achieved competitive performance in categorical data clustering.
Extends manifold learning to non-Euclidean metrics.
problem Applying manifold learning to data in non-Euclidean spaces.
method Generalizes manifold learning to metric spaces and studies conditions for convergence.
result Conditions for the convergence of graph Laplacian in metric spaces.
Distance metric learning is an important component for many tasks, such as statistical classification and content-based image retrieval. Existing approaches for learning distance metrics from pairwise constraints typically suffer from two major problems. First, most algorithms only offer point estimation of the distanc…
New metric learning approach for tree data reduces computation cost.
problem Efficiently computing distances between ordered labeled trees.
method Introduced pq-grams and a differentiable weighted pq-gram distance, combined with LMNN for optimization.
result Significantly reduces computation time for tree classification problems.
A new robust time series distance metric for k-NN classification.
problem Robustness against arbitrary data contamination in time series classification.
method Proposes a novel distance metric with worst-case complexity.
result Demonstrates competitive classification accuracy in k-NN time series classification.
Bounds on geodesic distances on Stiefel manifold derived from new metrics.
problem Improving geodesic computation algorithms and understanding Stiefel manifold.
method New geometric insights and Lipschitz constants for geodesic distances.
result Explicit bounds on geodesic distances and conditions for attaining bounds.
The -metric or Fubini-Study metric on the non-linear Grassmannian of all submanifolds of type in a Riemannian manifold induces geodesic distance 0. We discuss another metric which involves the mean curvature and shows that its geodesic distance is a good topological metric. The vanishing phenomenon for…
One of the most beautiful notions of metric geometry is the Gromov-Hausdorff distance which measures the difference between two metric spaces. To define the distance, let us isometrically embed these spaces into various metric spaces and measure the Hausdorff distance between their images. The best matching corresponds…
A new supervised tree-Wasserstein distance improves document classification.
problem Measuring document similarity efficiently and accurately.
method Rewriting Wasserstein distance on tree metric, using contrastive loss for optimization.
result The Supervised Tree-Wasserstein (STW) distance improves document classification accuracy.
Study uses equivariant topology to measure distances between G metric spaces.
problem Measuring distances between G metric spaces.
method Equivariant topology methods to derive lower bounds.
result Sharp bounds on Gromov Hausdorff distance between spheres.
Modified cosine distance improves similarity performance in data with variance and correlation.
problem Limitations of traditional cosine similarity in random variable spaces with variance and correlation.
method Proposed a variance-adjusted cosine distance metric to overcome limitations of traditional cosine similarity.
result Modified cosine distance shows 100% test accuracy in KNN model on the Wisconsin Breast Cancer Dataset.
Compactness theorem for timed-metric spaces established.
problem Compactness of timed-metric spaces and causality.
method Timed-Gromov--Hausdorff distance and intrinsic timed-Hausdorff distance.
result Induces same notion of convergence as intrinsic timed-Hausdorff distance.
Sharp estimates for Finsler metrics in convex domains.
problem Estimating distances in Finsler metrics near convex points.
method Sharp estimates for intrinsic distances of Finsler metrics.
result Characterization of -quasi hyperbolic metric in convex geometry.
Limit curve theorems for incomplete metric spaces and the null distance on Lorentzian manifoldsmath.DG
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.
Boundary distances determine conformal metrics
problem Determining conformal metrics from boundary distances
method Comparing renormalized boundary distances
result Metrics are equal if distances match
A new method learns meaningful distances between samples using optimal transport.
problem Learning meaningful distances between samples in datasets without labeled data.
method Computes OT distances between samples and features using singular vectors of a function mapping ground metrics to OT distances.
result Wasserstein Singular Vectors provide a scalable solution for unsupervised ground metric learning.
A new method clusters categorical data by learning their optimal order and distance.
problem Clustering categorical data lacks a well-defined metric space.
method Order distance metric learning for categorical data.
result Superior clustering accuracy on categorical and mixed datasets.
Study on Frechet distance properties for paths and graphs.
problem Understanding topological properties of Frechet distance spaces.
method Proving path-connectedness of Frechet distance spaces and metric balls.
result Spaces of paths and graphs under Frechet distance are path-connected.
A new metric mav offers a practical alternative to costly Riemannian distance.
problem Efficiently compute Riemannian distance on SE(3) invariant metrics.
method Propose mav distance, defined as Riemannian length of a curve.
result Mav distance offers a trainable invariant for geometric deep learning.
Self-supervised metric learning boosts downstream tasks in multi-view data.
problem Improving distance-based downstream tasks without labeled data.
method Developed a statistical framework to study self-supervised metric learning in multi-view data.
result Self-supervised metric learning improves target distances for various downstream tasks.
A novel criterion selects optimal distance metrics for cell profile analysis.
problem Determining the most accurate distance metric for high-dimensional cell profiles.
method Generalized proposition and corollaries to evaluate and select distance metrics.
result Wasserstein and cosine similarity metrics are optimal for general cases.
Deep metric learning employs deep neural networks to embed instances into a metric space such that distances between instances of the same class are small and distances between instances from different classes are large. In most existing deep metric learning techniques, the embedding of an instance is given by a featur…
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…
Proves compactness for timed-metric spaces using new distance and maps.
problem Weak convergence of space-times using timed-Hausdorff distance.
method Uses Gromov's original compactness theorem and introduces addresses.
result Establishes compactness theorem for intrinsic timed-Hausdorff convergence.
Inversive distance circle packing metric was introduced by P Bowers and K Stephenson \cite{BS} as a generalization of Thurston's circle packing metric \cite{T1}. They conjectured that the inversive distance circle packings are rigid. For nonnegative inversive distance, Guo \cite{Guo} proved the infinitesimal rigidity a…
Study sequences of static spacetimes using null distance convergence.
problem How to define convergence for sequences of spacetimes.
method Define null distance metric space structure compatible with Lorentzian structure.
result Prove VADB theorem for sequences of static spacetimes with null distance.
Neural networks can learn distance metrics affecting model performance.
problem Understanding how neural networks learn and represent data.
method Experiments with six MNIST architectures, constrained to learn either distance or intensity representations.
result Distance-based learning affects model performance, validating the geometric framework.
New neural nets respect triangle inequality, improving graph and reinforcement learning performance.
problem Neural nets lack inductive bias for certain subadditive distances.
method Introduced novel architectures that universally approximate norm-induced metrics.
result Neural nets with triangle inequality inductive bias outperform existing approaches.
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 bounds on distance functions.
result A Sobolev inequality exists between Riemannian metrics and their distance functions, leading to a convergence theorem.
Geodesic rays and chordal distances link algebraic and geometric properties of positive metrics.
problem Understanding the geometry of the space of positive metrics at infinity.
method Using Monge-Ampère equations and test configurations, algebraic descriptions of geodesic rays and chordal distances are derived.
result The Mabuchi chordal distance between geodesic rays associated with ample test configurations equals the spectral distance between their filtrations.
Physics: Similar long-distance properties can mask vastly different short-distance metrics.
problem Classifying homogeneous metrics on group manifolds by long-distance properties.
method Apply universality concept to geometry, focusing on metrics on Lie groups.
result Many metrics on low-dimensional Lie groups have similar long-distance properties despite differing short-distance properties.
A -metric on an -dimensional closed Riemannian manifold naturally induces a distance function, provided is sufficiently close to . If a sequence of metrics converges in to a limit metric , then the corresponding distance functions subconverge to a limit distance function …
Completes the space of vector-valued one-forms on manifolds.
problem Metric incompleteness of the space of full-ranked one-forms.
method Distance equality and quotient structures.
result Concrete description of the metric completion of the space of full-ranked one-forms.
Python package for SPD matrix distances, reproducible and extensible.
problem Computing distances between SPD matrices for various applications.
method Unified, extensible framework supporting multiple SPD metrics.
result Reproducible and accessible SPD matrix comparison tool.
Permutation invariant network learns Wasserstein metrics.
problem Understanding the space of probability measures and comparing distributions.
method Permutation invariant network mapping samples to a low-dimensional space.
result Network can generalize to compute distances between unseen densities and learn moments.
A new method embeds distributions in a common space for optimal transport comparison.
problem Comparing distributions in different metric spaces.
method Sub-embedding robust Wasserstein (SERW) distance.
result SERW mimics GW distance properties and provides a cost relation.
The paper studies convergence of cosmological spacetimes using null distance.
problem Convergence of cosmological spacetimes with compact slices.
method Using null distance and Gromov-Hausdorff convergence, the paper establishes convergence results for spacetimes with mild extension properties.
result Uniform convergence of null distances and Gromov-Hausdorff convergence for monotone sequences of spacetimes.
On a complete, connected, locally compact, non-compact geodesic space , 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 which is less than the Hausdorff distance. The quotient metric space is close…
In this paper, we present a novel two-stage metric learning algorithm. We first map each learning instance to a probability distribution by computing its similarities to a set of fixed anchor points. Then, we define the distance in the input data space as the Fisher information distance on the associated statistical ma…
In the present paper we calculate the Gromov-Hausdorff distance between an arbitrary simplex (a metric space all whose non-zero distances are the same) and a finite metric space whose non-zero distances take two distinct values (so-called -distance spaces). As a corollary, a complete solution to generalized Borsuk p…
We propose a new method for local distance metric learning based on sample similarity as side information. These local metrics, which utilize conical combinations of metric weight matrices, are learned from the pooled spatial characteristics of the data, as well as the similarity profiles between the pairs of samples, …
We propose a new class of metrics on sets, vectors, and functions that can be used in various stages of data mining, including exploratory data analysis, learning, and result interpretation. These new distance functions unify and generalize some of the popular metrics, such as the Jaccard and bag distances on sets, Man…
Proposes a new metric learning method for image recognition.
problem Improving image recognition performance using learned distance representations.
method Introduces a Generalized Hybrid Metric Loss (GHM-Loss) to learn hybrid proximity features combining geometric and probabilistic spaces.
result Demonstrates superior performance compared to existing methods on public datasets.
Many modern data-intensive computational problems either require, or benefit from distance or similarity data that adhere to a metric. The algorithms run faster or have better performance guarantees. Unfortunately, in real applications, the data are messy and values are noisy. The distances between the data points are …
Tree Edit Distance Learning via Adaptive Symbol Embeddings: Supplementary Materials and Resultscs.LG
Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as m…
Vanishing geodesic distance for the Riemannian metric with geodesic equation the KdV-equationmath.AP
The Virasoro-Bott group endowed with the right-invariant -metric (which is a weak Riemannian metric) has the KdV-equation as geodesic equation. We prove that this metric space has vanishing geodesic distance.
Proves Hölder-type inequality for Lagrangians' distance.
problem Understanding the symplectic geometry of Lagrangians.
method Developed methods from previous works to establish the inequality.
result Established a Hölder-type inequality for the Hausdorff distance between Lagrangians.