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

Trend · papers per month

57115172229 · Jun 202019922001200920172026
48 results for partial distance

Let M=H+SHM=H_{+}\cup_{S} H_{-} be a genus gg Heegaard splitting with Heegaard distance nκ+2n\geq κ+2: (1) Let c1c_{1}, c2c_{2} be two slopes in the same component of H\partial_{-}H_{-}, such that the natural Heegaard splitting Mi=H+S(Hci2handle)M^{i}=H_{+}\cup_{S} (H_{-}\cup_{c_{i}} 2-handle) has distance less than nn, then the distance…

2009-07-25abs ↗pdf ↗

Let ΩΩ be a domain in a smooth complete Finsler manifold, and let GG be the largest open subset of ΩΩ such that for every xx in GG there is a unique closest point from Ω\partial Ω to xx (measured in the Finsler metric). We prove that the distance function from Ω\partial Ω is in Clock,α(GΩ)C^{k,α}_{loc}(G\cup \partial Ω)

2005-10-26abs ↗pdf ↗

Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.

problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.

Study robust distribution estimation with Wasserstein distance, achieving optimal risk.

problem Robust distribution estimation under adversarial corruption.
method Combining partial OT and minimum distance estimation, proving structural properties and deriving a novel dual form.
result Achieves minimax-optimal robust estimation risk in many settings.

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…

2020-01-22abs ↗pdf ↗

Study shows distance to boundary is always attained on varifolds with bounded curvature.

problem Understanding varifolds with bounded mean curvature in Riemannian manifolds.
method Proves a barrier principle at infinity using sharp maximum principles.
result Distance to boundary is always attained on varifolds with bounded curvature.

Let MM be a compact hypersurface with boundary M=D1D2\partial M=\partial D_1 \cup \partial D_2, D1Π1\partial D_1 \subset Π_1, D2Π2\partial D_2 \subset Π_2, Π1Π_1 and Π2Π_2 two parallel hyperplanes in Rn+1\mathbb{R}^{n+1} (n2n \geq 2). Suppose that MM is contained in the slab determined by these hyperplanes and that the mean cu…

2016-01-12abs ↗pdf ↗

Paper proposes a method to recover point configurations from noisy distance data.

problem Recovering point configurations from noisy distance data.
method Robust Euclidean Distance Geometry via Dual Basis (RoDEoDB) algorithm.
result Exact recovery guarantees for point configuration and Gram matrix under mild conditions.

Sharp bounds derived for the first two Steklov eigenvalues of exterior domains.

problem Finding bounds for the first two eigenvalues of Steklov eigenvalue problems on exterior domains.
method Sharp lower and upper bounds derived using the support function and distance function to the origin of the boundary.
result Sharp bounds for the first two eigenvalues of Steklov eigenvalue problems on exterior domains.

New bounds for PDA using partial optimal transport improve domain alignment.

problem Scarcity of labeled target data with abundant source data.
method Derive theoretical bounds based on partial optimal transport.
result Theoretical bounds support partial Wasserstein distance for domain alignment.

APGD algorithm reconstructs point set from partial distance measurements.

problem Reconstructing point set configuration from partial Euclidean distance measurements.
method Asymmetric Projected Gradient Descent (APGD) for EDMC problem.
result Global convergence and exact recovery with O(μ2r3κ2nlogn)\mathcal{O}(μ^2 r^3 κ^2 n \log n) observations.

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…

2012-03-15abs ↗pdf ↗

Paper reconstructs compact Riemannian manifolds from travel time data.

problem Reconstructing compact Riemannian manifolds from partial travel time data.
method Embedding in function space, studying distance function regularity.
result Reconstruction of 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…

2010-09-24abs ↗pdf ↗

This paper examines how data affects risk measures in uncertain distributions.

problem How does distributional ambiguity affect risk measures?
method Formulated and derived simpler dual problems for infinite and finite dimensional robust moment problems.
result Developed theory and conducted experiments in inventory control and portfolio management.

Reconstructing manifolds from partial distance and heat kernel data.

problem Reconstructing a manifold from noisy distance measurements and heat kernel data.
method Approximate reconstruction of a manifold from partial distance and heat kernel data with noise.
result A stable reconstruction of the manifold can be achieved from noisy heat kernel data.

Under a complete Ricci flow, we construct a coupling of two Brownian motion such that their L0\mathcal{L}_0-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…

2014-08-01abs ↗pdf ↗

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…

2018-05-11abs ↗pdf ↗

Let MM be a surface sum of 3-manifolds M1M_1 and M2M_2 along a bounded connected surface FF and i\partial_i be the component of Mi\partial M_i containing FF. If MiM_i has a high distance Heegaard splitting, then any minimal Heegaard splitting of MM is the amalgamation of those of M1,M2M^1, M^2 and MM^*, where $M^i=M…

2008-06-18abs ↗pdf ↗

For a Riemannian manifold Mn+1M^{n+1} and a compact domain ΩMn+1Ω\subset M^{n+1} bounded by a hypersurface Ω\partial Ω with normal curvature bounded below, estimates are obtained in terms of the distance from OO to Ω\partial Ω for the angle between the geodesic line joining a fixed interior point OO in ΩΩ to a point on…

2012-12-28abs ↗pdf ↗

Clarifies when solutions to stochastic PDEs stay near given subsets.

problem Understanding the proximity of solutions to stochastic PDEs to given subsets.
method Analyzes distance between closed sets and solutions to stochastic PDEs.
result Clarifies conditions for solutions to 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…

2016-04-28abs ↗pdf ↗

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…

2013-02-10abs ↗pdf ↗

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 \partial-reducible. A manifold in the second family has boundary consi…

1997-08-07abs ↗pdf ↗

Let MM be a compact nn-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary M\partial M. Assume that the mean curvature HH of the boundary M\partial M satisfies H(n1)k>0H \geq (n-1) k >0 for some positive constant kk. In this paper, we prove that the distance function dd to the bou…

2012-04-08abs ↗pdf ↗

The goal of subspace learning is to find a kk-dimensional subspace of Rd\mathbb{R}^d, 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 rdr \le d att…

2014-02-19abs ↗pdf ↗

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…

2018-10-19abs ↗pdf ↗

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…

2013-06-05abs ↗pdf ↗

We prove that, if ΩRnΩ\subset \mathbb{R}^n is an open bounded starshaped domain of class C2C^2, the constancy over Ω\partial Ω of the function φ(y)=0λ(y)j=1n1[1tκj(y)]dt\varphi(y) = \int_0^{λ(y)} \prod_{j=1}^{n-1}[1-t κ_j(y)]\, dt implies that ΩΩ is a ball. Here kj(y)k_j(y) and λ(y)λ(y) denote respectively the principal curvatures and the cut v…

2012-07-26abs ↗pdf ↗

Theoretical analysis of MCR for improving imputation quality in partially observed data.

problem Improving model generalization in partially observed settings.
method Theoretical analysis of Measure Consistency Regularization (MCR) for neural network distance.
result MCR's generalization advantage is not always guaranteed and can be monitored through a duality gap.

Let M1M_1 and M2M_2 be orientable irreducible 3--manifolds with connected boundary and suppose M1M2\partial M_1\cong\partial M_2. Let MM be a closed 3--manifold obtained by gluing M1M_1 to M2M_2 along the boundary. We show that if the gluing homeomorphism is sufficiently complicated, then MM is not homeomorphic to $S^3…

2008-07-17abs ↗pdf ↗

We consider least energy solutions to the nonlinear equation Δgu=f(r,u)-Δ_g u=f(r,u) posed on a class of Riemannian models (M,g)(M,g) of dimension n2n\ge 2 which include the classical hyperbolic space Hn\mathbb H^n as well as manifolds with unbounded sectional geometry. Partial symmetry and existence of least energy solutions is …

2014-09-09abs ↗pdf ↗

Let MM be a simple 3-manifold such that one component of M\partial M, say FF, has genus at least two. For a slope αα on FF, we denote by M(α)M(α) the manifold obtained by attaching a 2-handle to MM along a regular neighborhood of αα on FF. If M(α)M(α) is reducible, then αα is called a reducing slope. In this paper…

2006-09-29abs ↗pdf ↗