arXiv research

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…

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…

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…

Study describes singularities of distance squared functions on singular surfaces.

Study spider mechanism configuration spaces using squared distance function.

The paper studies convexity of products of squared Euclidean distances.

Efficiently reconstructs jump-diffusion processes from data using neural networks.

In the context of Synthetic Differential Geometry, we describe the square volume of a ``second-infinitesimal simplex'', in terms of square-distance between its vertices. The square-volume function thus described is symmetric in the vertices. The square-volume gives rise to a characterization of the volume form in the t…

We define generalized distance-squared mappings, and we concentrate on the plane to plane case. We classify generalized distance-squared mappings of the plane into the plane in a recognizable way.

In the context of kernel methods, the similarity between data points is encoded by the kernel function which is often defined thanks to the Euclidean distance, a common example being the squared exponential kernel. Recently, other distances relying on optimal transport theory - such as the Wasserstein distance between …

Any generalized distance-squared mapping of equidimensional case has singularities, and their singularity types are wrapped into mystery in higher dimensional cases. Any generalized distance-squared mapping of equidimensional case is not injective. Nevertheless, in this paper, it is shown that the non-singular property…

Study compares chi-squared divergence and KL-divergence posteriors for PAC-Bayesian bounds.

This is a survey article on distance-squared mappings and related topics.

This paper presents a general notion of Mahalanobis distance for functional data that extends the classical multivariate concept to situations where the observed data are points belonging to curves generated by a stochastic process. More precisely, a new semi-distance for functional observations that generalize the usu…

This paper provides performance guarantees for neural estimation of statistical distances.

Proves minimum number of normals to curves in 3D space.

The square root velocity framework is a method in shape analysis to define a distance between curves and functional data. Identifying two curves if they differ by a reparametrisation leads to the quotient space of unparametrised curves. In this paper we study analytical and topological aspects of this construction for …

The paper studies parallel surfaces of cuspidal cross caps and their degeneracy.

This study examines the relationship between PLS and OLS regression using eigenvalue distributions.

We propose a minimum distance estimation method for robust regression in sparse high-dimensional settings. The traditional likelihood-based estimators lack resilience against outliers, a critical issue when dealing with high-dimensional noisy data. Our method, Minimum Distance Lasso (MD-Lasso), combines minimum distanc…

We generalize the theory of gradient flows of semi-convex functions on CAT(0)-spaces, developed by Mayer and Ambrosio--Gigli--Savaré, to CAT(1)-spaces. The key tool is the so-called "commutativity" representing a Riemannian nature of the space, and all results hold true also for metric spaces satisfying the commutativi…

Paper connects surface shape analysis and unbalanced optimal transport.

We show that the scalar curvature of a steady gradient Ricci soliton satisfying that the ratio between the square norm of the Ricci tensor and the square of the scalar curvature is bounded by one half, is boundend from below by the hyperbolic secant of one half the distance function from a fixed point.

Proposes a variational NNCC formulation for infinite dimensions.

Distance, normals, and double normals for real plane curves with singularities

Generalized distance-squared mappings are quadratic mappings of $\mathbb{R}^m$ into $\mathbb{R}^\ell$ of special type. In the case that matrices $A$ constructed by coefficients of generalized distance-squared mappings of $\mathbb{R}^2$ into $\mathbb{R}^\ell$ ($\ell \geq3$) are full rank, the generalized distance-square…

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…

We propose a new algorithm that uses an auxiliary neural network to express the potential of the optimal transport map between two data distributions. In the sequel, we use the aforementioned map to train generative networks. Unlike WGANs, where the Euclidean distance is ${\it implicitly}$ used, this new method allows …

Distance correlation has gained much recent attention in the data science community: the sample statistic is straightforward to compute and asymptotically equals zero if and only if independence, making it an ideal choice to discover any type of dependency structure given sufficient sample size. One major bottleneck is…

The paper establishes a uniform Lipschitz bound on the square root of the systole function in Teichmüller space.

We give criteria for which a principal curvature becomes a bounded $C^\infty$-function at non-degenerate singular points of wave fronts by using geometric invariants. As applications, we study singularities of parallel surfaces and extended distance squared functions of wave fronts. Moreover, we relate these singularit…

Region-based classification of PolSAR data can be effectively performed by seeking for the assignment that minimizes a distance between prototypes and segments. Silva et al (2013) used stochastic distances between complex multivariate Wishart models which, differently from other measures, are computationally tractable.…

In light of the power problems of statistical tests and undisciplined use of alpha-based statistics to compare models, this paper proposes a unified set of distance-based performance metrics, derived as the square root of the sum of squared alphas and squared standard errors. The Bayesian investor views model performan…

We study body-and-hinge and panel-and-hinge chains in R^d, with two marked points: one on the first body, the other on the last. For a general chain, the squared distance between the marked points gives a Morse-Bott function on a torus configuration space. Maximal configurations, when the distance between the two marke…

We classify generalized distance-squared mappings of $\mathbb{R}^{n+1}$ into $\mathbb{R}^{2n+1}$ ($n\ge 1$) having generic central points. Moreover, we show that there does not exist a universal bad set $Σ\subset (\mathbb{R}^{n+1})^{2n+1}$ in the case of this dimension-pair.

New algorithms learn graph structures privately, matching best results.

Centered plug-in estimators reduce bias in Wasserstein distance estimation.

Paper proposes a new method for density estimation using squared Hellinger distance.

The Square Root Normal Field (SRNF), introduced by Jermyn et al. in [3], provides a way of representing immersed surfaces in $\mathbb R^3$, and equipping the set of these immersions with a "distance function" (to be precise, a pseudometric) that is easy to compute. Importantly, this distance function is invariant under…

The paper explores fair predictors in supervised learning using IPMs and Kolmogorov distance.

New algorithm estimates transport maps with nearly optimal error.

Positive definite matrices abound in a dazzling variety of applications. This ubiquity can be in part attributed to their rich geometric structure: positive definite matrices form a self-dual convex cone whose strict interior is a Riemannian manifold. The manifold view is endowed with a "natural" distance function whil…

We study a class of elastic energy functionals for maps between planar domains (among them the so-called squared distance functional) whose critical points (elastic maps) allow a far more complete theory than one would expect from general elasticity theory. For some of these functionals elastic maps even admit a "Weier…

Study uses Wasserstein distance to identify causal orders and unmix sources.

Image ranking is to rank images based on some known ranked images. In this paper, we propose an improved linear ordinal distance metric learning approach based on the linear distance metric learning model. By decomposing the distance metric $A$ as $L^TL$, the problem can be cast as looking for a linear map between two …

SRNF framework extends surface distance to Lipschitz surfaces.

PAC-Bayesian set up involves a stochastic classifier characterized by a posterior distribution on a classifier set, offers a high probability bound on its averaged true risk and is robust to the training sample used. For a given posterior, this bound captures the trade off between averaged empirical risk and KL-diverge…

A method uses Shapley values and Mahalanobis distances to explain multivariate outliers.