Let be a genus Heegaard splitting with Heegaard distance : (1) Let , be two slopes in the same component of , such that the natural Heegaard splitting has distance less than , then the distance…
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.
Trend · papers per month
A new robust metric compares distributions more accurately than existing methods.
Robustly aligns datasets with partial GW distance to handle contamination.
Let be a domain in a smooth complete Finsler manifold, and let be the largest open subset of such that for every in there is a unique closest point from to (measured in the Finsler metric). We prove that the distance function from is in …
Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.
Distance between evolving hypersurfaces is a PDE solution.
Method uses NMF for clustering with partial distance measurements.
Study robust distribution estimation with Wasserstein distance, achieving optimal risk.
Flag manifolds are generalizations of projective spaces and other Grassmannians: they parametrize flags, which are nested sequences of subspaces in a given vector space. These are important objects in algebraic and differential geometry, but are also increasingly being used in data science, where many types of data are…
Many mobile robots rely on 2D laser scanners for localization, mapping, and navigation. However, those sensors are unable to correctly provide distance to obstacles such as glass panels and tables whose actual occupancy is invisible at the height the sensor is measuring. In this work, instead of estimating the distance…
Study shows distance to boundary is always attained on varifolds with bounded curvature.
Let be a compact hypersurface with boundary , , , and two parallel hyperplanes in (). Suppose that is contained in the slab determined by these hyperplanes and that the mean cu…
Paper proposes a method to recover point configurations from noisy distance data.
Sharp bounds derived for the first two Steklov eigenvalues of exterior domains.
Asymptotic geodesics in convex polygons are convex for large distances.
New bounds for PDA using partial optimal transport improve domain alignment.
APGD algorithm reconstructs point set from partial distance measurements.
We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even). Distance-based methods are popular in machine learning. In large-scale applications, sto…
Robust GW distance improves graph data alignment.
Paper reconstructs compact Riemannian manifolds from travel time data.
Here we study geodesics connecting two given points on odd-dimensional spheres respecting the Hopf fibration. This geodesic boundary value problem is completely solved in the case of 3-dimensional sphere and some partial results are obtained in the general case. The Carnot-Carathéodory distance is calculated. We also p…
This paper examines how data affects risk measures in uncertain distributions.
A new method for efficient optimal partial transport in 1D.
Reconstructing manifolds from partial distance and heat kernel data.
Strongly convex bodies can be approximated by smooth ones.
Under a complete Ricci flow, we construct a coupling of two Brownian motion such that their -distance is a supermartingale. This recovers a result of Lott [J. Lott, Optimal transport and Perelman's reduced volume, Calc. Var. Partial Differential Equations 36 (2009), no. 1, 49--84.] on the monotonicity of…
In this article we study the induced geodesic distance of fractional order Sobolev metrics on the groups of (volume preserving) diffeomorphisms and symplectomorphisms. The interest in these geometries is fueled by the observation that they allow for a geometric interpretation for prominent partial differential equation…
PRISM-FCP improves federated prediction robustness against Byzantine attacks.
Let be a surface sum of 3-manifolds and along a bounded connected surface and be the component of containing . If has a high distance Heegaard splitting, then any minimal Heegaard splitting of is the amalgamation of those of and , where $M^i=M…
For a Riemannian manifold and a compact domain bounded by a hypersurface with normal curvature bounded below, estimates are obtained in terms of the distance from to for the angle between the geodesic line joining a fixed interior point in to a point on…
Clarifies when solutions to stochastic PDEs stay near given subsets.
In this paper, we generalize Chow-Luo's combinatorial Ricci flow to inversive distance circle packing setting. Although the solution to the generalized flow may develop singularities in finite time, we can always extend the solution so as it exists for all time and converges exponentially fast. Thus the generalized flo…
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 give three infinite families of examples of nonhyperbolic Dehn fillings on hyperbolic manifolds. A manifold in the first family admits two Dehn fillings of distance two apart, one of which is toroidal and annular, and the other is reducible and -reducible. A manifold in the second family has boundary consi…
New distances for causal graphs improve evaluation of learned structures.
The study proves a rigidity theorem for convex domains in hyperbolic spaces.
Let be a compact -dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary . Assume that the mean curvature of the boundary satisfies for some positive constant . In this paper, we prove that the distance function to the bou…
The goal of subspace learning is to find a -dimensional subspace of , such that the expected squared distance between instance vectors and the subspace is as small as possible. In this paper we study subspace learning in a partial information setting, in which the learner can only observe att…
Derives PDEs from data using manifold learning and neural networks.
Optimal algorithms learn Gaussian trees and polytrees from data.
Model-based clustering is widely-used in a variety of application areas. However, fundamental concerns remain about robustness. In particular, results can be sensitive to the choice of kernel representing the within-cluster data density. Leveraging on properties of pairwise differences between data points, we propose a…
Causal inference relies on the structure of a graph, often a directed acyclic graph (DAG). Different graphs may result in different causal inference statements and different intervention distributions. To quantify such differences, we propose a (pre-) distance between DAGs, the structural intervention distance (SID). T…
We prove that, if is an open bounded starshaped domain of class , the constancy over of the function implies that is a ball. Here and denote respectively the principal curvatures and the cut v…
Theoretical analysis of MCR for improving imputation quality in partially observed data.
Let and be orientable irreducible 3--manifolds with connected boundary and suppose . Let be a closed 3--manifold obtained by gluing to along the boundary. We show that if the gluing homeomorphism is sufficiently complicated, then is not homeomorphic to $S^3…
We consider least energy solutions to the nonlinear equation posed on a class of Riemannian models of dimension which include the classical hyperbolic space as well as manifolds with unbounded sectional geometry. Partial symmetry and existence of least energy solutions is …
Let be a simple 3-manifold such that one component of , say , has genus at least two. For a slope on , we denote by the manifold obtained by attaching a 2-handle to along a regular neighborhood of on . If is reducible, then is called a reducing slope. In this paper…
Introduces MSW distances to improve SW metrics.