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.
Transforms distance-based outlier scores into interpretable probabilistic estimates.
A new invariant captures geometric features of circle embeddings.
The complex wave representation (CWR) converts unsigned 2D distance transforms into their corresponding wave functions. Here, the distance transform S(X) appears as the phase of the wave function φ(X)---specifically, φ(X)=exp(iS(X)/τwhere τis a free parameter. In this work, we prove a novel result using the higher-orde…
Distance-based tests, also called "energy statistics", are leading methods for two-sample and independence tests from the statistics community. Kernel-based tests, developed from "kernel mean embeddings", are leading methods for two-sample and independence tests from the machine learning community. A fixed-point transf…
Algorithm learns affine transformations robustly from corrupted samples.
GT is a new method for denoising and enhancing datasets using Gaussian density estimates.
The Wasserstein distance and its variations, e.g., the sliced-Wasserstein (SW) distance, have recently drawn attention from the machine learning community. The SW distance, specifically, was shown to have similar properties to the Wasserstein distance, while being much simpler to compute, and is therefore used in vario…
The paper examines how nonlinear transformations affect ridge sets in manifold learning.
The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on the arc lengths, angles and curvature of the transformations are proposed, and v…
The study examines lower and upper bounds of Wasserstein distances for affine transformations of random vectors.
Algorithm aligns 3D density maps using Wasserstein distance.
We introduce the Wasserstein Transform (WT), a general unsupervised framework for updating distance structures on given data sets with the purpose of enhancing features and denoising. Our framework represents each data point by a probability measure reflecting the neighborhood structure of the point, and then updates t…
Recent work in distance metric learning has focused on learning transformations of data that best align with provided sets of pairwise similarity and dissimilarity constraints. The learned transformations lead to improved retrieval, classification, and clustering algorithms due to the better adapted distance or similar…
We consider various notions of strains; quantitative measures for the deviation of a linear transformation from an isometry. The main approach, which is motivated by physical applications and follows the work of Patrizio Neff and co-workers , is to select a Riemannian metric on , and use its induced geodes…
Paper introduces S3W distance for spherical probability distributions.
Improved unsupervised anomaly detection using Random Forest.
Prior work inspired by compression algorithms has described how the Burrows Wheeler Transform can be used to create a distance measure for bioinformatics problems. We describe issues with this approach that were not widely known, and introduce our new Burrows Wheeler Markov Distance (BWMD) as an alternative. The BWMD a…
The paper provides convergence guarantees for ODE-based generative models using transformers.
A new metric HSW derived from hierarchical Radon Transform addresses computational bottlenecks in sliced Wasserstein.
We consider classifiers for high-dimensional data under the strongly spiked eigenvalue (SSE) model. We first show that high-dimensional data often have the SSE model. We consider a distance-based classifier using eigenstructures for the SSE model. We apply the noise reduction methodology to estimation of the eigenvalue…
Recent studies show that widely used deep neural networks (DNNs) are vulnerable to carefully crafted adversarial examples. Many advanced algorithms have been proposed to generate adversarial examples by leveraging the distance for penalizing perturbations. Researchers have explored different defense met…
In the research area of time series classification, the ensemble shapelet transform algorithm is one of state-of-the-art algorithms for classification. However, its high time complexity is an issue to hinder its application since its base classifier shapelet transform includes a high time complexity of a distance calcu…
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 …
ATD measures language distance using neural models, recovering linguistic groupings.
The Gordian distance between two knots measures how many crossing changes are needed to transform one knot into the other. It is known that there are always infinitely many non-equivalent knots `between' a pair of knots of Gordian distance two. In this paper we prove an extreme generalisation of this fact: there are kn…
Noting the importance of the latent variables in inference and learning, we propose a novel framework for autoencoders based on the homeomorphic transformation of latent variables, which could reduce the distance between vectors in the transformed space, while preserving the topological properties of the original space…
Transformers approximate mean-field dynamics of indistinguishable particles.
New Gromov-Wasserstein metric controls rigidity and incorporates prior knowledge.
LOT embeds distributions for linear separability and classification.
In this paper, we propose a nonlinear distance metric learning scheme based on the fusion of component linear metrics. Instead of merging displacements at each data point, our model calculates the velocities induced by the component transformations, via a geodesic interpolation on a Lie transfor- mation group. Such vel…
Study on convergence of transformed metric spaces as dimensions grow.
New algorithm for uncertain time series classification.
Predicting RNA base distances using a large language model.
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of objects can be represented in the same space, or at least distances between them can…
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …
A new method for computing shape barycenters from point clouds using Procrustes-Wasserstein distance.
Positive definite kernels are an important tool in machine learning that enable efficient solutions to otherwise difficult or intractable problems by implicitly linearizing the problem geometry. In this paper we develop a set-theoretic interpretation of the Earth Mover's Distance (EMD) and propose Earth Mover's Interse…
s-OTDD compares datasets efficiently without training, robust to class variations.
The paper shows how to recover true node positions from a graph or similarity matrix.
Elliptical Attention improves transformer performance by focusing on contextually relevant features.
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…
We study a transformation of metric measure spaces introduced by Gigli and Mantegazza consisting in replacing the original distance with the length distance induced by the transport distance between heat kernel measures. We study the smoothing effect of this procedure in two important examples. Firstly, we show that in…
Recent work in distance metric learning has focused on learning transformations of data that best align with specified pairwise similarity and dissimilarity constraints, often supplied by a human observer. The learned transformations lead to improved retrieval, classification, and clustering algorithms due to the bette…
In high dimension, low sample size (HDLSS)settings, the simple average distance classifier based on the Euclidean distance performs poorly if differences between the locations get masked by the scale differences. To rectify this issue, modifications to the average distance classifier was proposed by Chan and Hall (2009…
This paper addresses Gaussian Process regression over probability measures, revealing a non-stationarity issue between Euclidean and Wasserstein kernels.
Transformer model pretrains on synthetic graphs for AD detection.
In this article, we consider a generalized Radon transform that comes up in ultrasound reflection tomography. In our model, the ultrasound emitter and receiver move at a constant distance apart along a circle. We analyze the microlocal properties of the transform that arises from this model. As a consequence, we sh…
A method detects vehicles far from tunnel CCTV using AI.