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,695 papers · 148 categories

Trend · papers per month

4795142189 · Jun 202019922001200920172026
48 results for equality distance

New method relaxes TV distance for two-sample testing without distributional assumptions.

problem Challenges in certifying equality or providing tight bounds on TV distance for two distributions.
method Examined blurred total variation distance, a relaxation of TV distance.
result Provided theoretical guarantees for upper and lower bounds on blurred TV distance.

Research shows that certain metric spaces cannot contain rigid structures and provides evidence for loose embeddings into Euclidean spaces.

problem The inability of certain metric spaces to contain rigid structures like regular simplices or equidistant sequences.
method Proof of non-embeddability of certain metric spaces into finite-dimensional Euclidean spaces and a local-to-global principle for loose embeddability.
result Compact Riemannian manifolds cannot contain arbitrarily large regular simplices or long equidistant sequences, suggesting loose embeddings into Euclidean spaces.

Define the 1-handle stabilization distance between two surfaces properly embedded in a fixed 4-dimensional manifold to be the minimal number of 1-handle stabilizations necessary for the surfaces to become ambiently isotopic. For every nonnegative integer mm we find a pair of 2-knots in the 4-sphere whose stabilization…

2019-08-19abs ↗pdf ↗

Study proves inequality for hypersurfaces and shows almost extremals are close to Wulff shape.

problem Proving anisotropic extrinsic radius pinching inequality for hypersurfaces.
method Analyzes anisotropic mean curvatures and studies equality cases.
result Almost extremal hypersurfaces are close to Wulff shape.

We calculate the bridge distance for mm-bridge knots/links in the 33-sphere with sufficiently complicated 2m2m-plat projections. In particular we show that if the underlying braid of the plat has n1n - 1 rows of twists and all its exponents have absolute value greater than or equal to three then the distance of the b…

2013-12-26abs ↗pdf ↗

A knot K in 1-bridge position with respect to a genus-g Heegaard surface in a 3-manifold can be moved by isotopy through knots in 1-bridge position until it lies in a union of n parallel genus-g surfaces tubed together by n-1 straight tubes, with K intersecting each tube in two arcs connecting the ends. We prove that t…

2009-01-11abs ↗pdf ↗

This work examines the sensitivity of energy distance to mean differences compared to covariance differences.

problem The sensitivity of energy distance to mean differences compared to covariance differences when distributions are close.
method Analyzes the energy distance in the case where distributions are close, focusing on sensitivity to mean and covariance differences.
result Energy distance is more sensitive to mean differences than covariance differences when distributions are close.

We propose a new setting for testing properties of distributions while receiving samples from several distributions, but few samples per distribution. Given samples from ss distributions, p1,p2,,psp_1, p_2, \ldots, p_s, we design testers for the following problems: (1) Uniformity Testing: Testing whether all the pip_i's are …

2019-11-17abs ↗pdf ↗

The paper introduces a new Wasserstein distance for approximating posteriors in inverse problems.

problem Approximating posterior measures in inverse problems using conditional Wasserstein distances.
method Introduces a conditional Wasserstein distance with restricted couplings and derives its dual.
result Shows that conditional Wasserstein GANs can yield favorable properties for posterior sampling.

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

problem Optimizing Bayesian filtering with deterministic particles to avoid degeneration.
method Progressive flow of particles through a sequence of sub-steps, each using an optimal transport map to replace non-equally weighted particles with equally weighted ones.
result The method avoids particle degeneration and simplifies the filtering process by not requiring inversions or monotonicity constraints.

In this paper, we define a reduced distance function based at a point at the singular time T<T<\infty of a Ricci flow. We also show the monotonicity of the corresponding reduced volume based at time T, with equality iff the Ricci flow is a gradient shrinking soliton. Our curvature bound assumption is more general than …

2007-11-05abs ↗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 ↗

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 ↗

The main subject of this expository paper is a connection between Gromov's filling volumes and a boundary rigidity problem of determining a Riemannian metric in a compact domain by its boundary distance function. A fruitful approach is to represent Riemannian metrics by minimal surfaces in a Banach space and to prove r…

2010-04-14abs ↗pdf ↗

Exact 1-Wasserstein distance between location-scale distributions derived, with privacy effects studied.

problem Calculating the 1-Wasserstein distance between location-scale distributions and its impact on differential privacy.
method Exact expressions and special functions for 1-Wasserstein distance, new upper bounds, and asymptotic analysis.
result New linear upper bound and detailed asymptotic bounds for Gaussian case, effect of differential privacy studied.

In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth curves almost uniformly with respect to affine length, convex equal-area polygo…

2011-03-14abs ↗pdf ↗

Maps preserving Carathéodory distance between symmetric domains are rigid.

problem Rigidity of maps preserving Carathéodory distance between bounded symmetric domains.
method Large-scale geometry of Carathéodory distance, horocompactification, Gromov product.
result Maps preserving Carathéodory distance are rigid and either holomorphic or antiholomorphic.

A new method using energy distance for ensemble and scenario reduction.

problem Solving complex dynamic and stochastic programs, especially in energy systems.
method Proposes a new method based on energy distance for ensemble and scenario reduction.
result Reduced scenario sets exhibit better statistical properties for energy distance than Wasserstein distance.

Let MM be a compact Riemannian manifold with boundary. We show that MM is Gromov-Hausdorff close to a convex Euclidean region DD of the same dimension if the boundary distance function of MM is C1C^1-close to that of DD. More generally, we prove the same result under the assumptions that the boundary distance func…

2010-05-06abs ↗pdf ↗

We investigate the use of Minimax distances to extract in a nonparametric way the features that capture the unknown underlying patterns and structures in the data. We develop a general-purpose and computationally efficient framework to employ Minimax distances with many machine learning methods that perform on numerica…

2019-04-27abs ↗pdf ↗

Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selecti…

2018-11-13abs ↗pdf ↗

Let GG and GG' be simple Lie groups of equal real rank and real rank at least 22. Let Γ<GΓ<G and Λ<GΛ< G' be non-uniform lattices. We prove a theorem that often implies that any quasi-isometric embedding of ΓΓ into ΛΛ is at bounded distance from a homomorphism. For example, any quasi-isometric embedding of $SL(n,\ma…

2015-12-22abs ↗pdf ↗

New measures generalize existing ones, linking information and risk.

problem Linking information measures and risk in statistical decision problems.
method Introducing new families of divergence measures and deriving an information processing equality.
result Extension of variational φφ-divergence representation to multiple distributions.

Unified understanding of neural representation similarity measures.

problem Fragmented research landscape of neural network similarity measures.
method Observation and exploration of connections between shape distances and normalized Bures similarity.
result Cosine of the Riemannian shape distance equals normalized Bures similarity.

To a closed Riemannian manifold, we associate a set of (special values of) a family of Dirichlet series, indexed by functions on the manifold. We study the meaning of equality of two such families of spectral Dirichlet series under pullback along a map. This allows us to give a spectral characterization of when a smoot…

2010-07-06abs ↗pdf ↗

Adding an unknot to any link equals its bridge number and meridional rank.

problem Proving the Meridional Rank Conjecture for any link.
method Embedding an unknot in a link's complement to achieve the conjecture and proving it for new families of links.
result Bridge numbers and meridional ranks are equal for any link and its unknot.

Under the definition of Ricci curvature bounded below for Alexandrov spaces introduced by Zhang-Zhu, we generalize a result by Colding that an n dimentional manifold with Ricci curvature greater or equal to n minus 1 and volume close to that of the unit n sphere is close (in the Gromov-Hausdorff distance) to the sphere…

2015-03-03abs ↗pdf ↗

OLLA framework efficiently samples from constrained distributions with nonconvex constraints.

problem Sampling from constrained distributions with nonconvex constraints is challenging.
method Overdamped Langevin with Landing (OLLA) framework that handles both equality and inequality constraints.
result OLLA converges exponentially fast to the constrained target density in W2W_2 distance.

We study the pricing and hedging of derivative securities with uncertainty about the volatility of the underlying asset. Rather than taking all models from a prespecified class equally seriously, we penalise less plausible ones based on their "distance" to a reference local volatility model. In the limit for small unce…

2016-05-20abs ↗pdf ↗