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.

169,051 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Apr 199519922001200920172026
48 results for angle distance

Proposes a new PCA method that balances Euclidean and angle distances.

problem PCA's loss minimization often uses Euclidean distance, but angle distance is more critical in some fields.
method Introduces a method with constraints to unify Euclidean and angle distances, solving the nonconvex optimization problem with an alternating linearized minimization approach.
result Demonstrates the effectiveness and advantages of the new method over state-of-the-art clustering methods on synthetic and real-world datasets.

New method estimates intrinsic dimensionality using angles, not distances.

problem Estimating local intrinsic dimensionality accurately.
method Introduces a new estimator using the distribution of angles between neighbor points.
result New estimator behaves similarly but complementarily to existing measures of intrinsic dimensionality.

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 ↗

We develop an analogy between right-angled Artin groups and mapping class groups through the geometry of their actions on the extension graph and the curve graph respectively. The central result in this paper is the fact that each right-angled Artin group acts acylindrically on its extension graph. From this result we …

2013-05-19abs ↗pdf ↗

We obtain the following version of Lidskii theorem. Let L, M, N be p-dimensional subspaces in R^n. Let ψ_j be the angles between L and M, let φ_j be the angles between M and N, and let θ_j be the angles between L and N. Consider the orbit of the vector ψwith respect to permutations of coordinates and inversions of axis…

2000-05-06abs ↗pdf ↗

Mercat preserves angles to create accurate low-dimensional embeddings.

problem Reconstructing global relationships in low-dimensional embeddings.
method Reconstructing angles between data points to preserve both local and global structures.
result Mercat yields good reconstruction across various experiments and metrics.

New method identifies latent relationships in deep models without additional constraints.

problem Latent representations in deep latent variable models are not statistically identifiable.
method Identifies relationships between latent variables (distances, angles, volumes) under mild model conditions.
result Empirically demonstrates more reliable latent distances without additional labeled data.

Deep learning predicts protein structures accurately.

problem Predicting the 3D structure of proteins from amino acid sequences.
method Embeddings and deep learning models for backbone atom distance matrices and torsion angles.
result Competitive results in CASP13 and CASP12, surpassing previous winners.

We give a new notion of angle in general metric spaces; more precisely, given a triple a points p,x,qp,x,q in a metric space (X,d)(X,d), we introduce the notion of angle cone pxq{\angle_{pxq}} as being an interval pxq:=[pxq,pxq+]{\angle_{pxq}}:=[\angle^-_{pxq},\angle^+_{pxq}], where the quantities pxq±\angle^\pm_{pxq} are defined in terms o…

2013-02-03abs ↗pdf ↗

Subspace models play an important role in a wide range of signal processing tasks, and this paper explores how the pairwise geometry of subspaces influences the probability of misclassification. When the mismatch between the signal and the model is vanishingly small, the probability of misclassification is determined b…

2015-07-15abs ↗pdf ↗

In this letter, we consider two sets of observations defined as subspace signals embedded in noise and we wish to analyze the distance between these two subspaces. The latter entails evaluating the angles between the subspaces, an issue reminiscent of the well-known Procrustes problem. A Bayesian approach is investigat…

2013-10-01abs ↗pdf ↗

This study analyzes satellite communication latency using a stochastic geometry model.

problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.

The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points. Dynamical properties for the space of geodesics are also proved.

2013-06-07abs ↗pdf ↗

Given a triangulated surface MM, we use Ge-Xu's αα-flow \cite{Ge-Xu1} to deform any initial inversive distance circle packing metric to a metric with constant αα-curvature. More precisely, we prove that the inversive distance circle packing with constant αα-curvature is unique if αχ(M)0αχ(M)\leq 0, which generalize And…

2017-09-28abs ↗pdf ↗

Proposes a new method for posterior sampling using MMD with negative distance kernel.

problem Posterior sampling and conditional generative modeling.
method Approximates joint distribution using discrete Wasserstein gradient flows of MMD with negative distance kernel.
result Establishes an error bound for posterior distributions and proves the method is a Wasserstein gradient flow.

Adversarial attacks can fool self-driving cars, changing steering predictions.

problem Security of deep neural networks in self-driving cars.
method Demonstrated adversarial attacks on steering angle prediction model.
result Small image modifications can mislead self-driving car predictions.

We obtain an analog of the compression of angles theorem in symmetric spaces for Bruhat--Tits buildings of the type AA. More precisely, consider a pp-adic linear space VV and the set Lat(V)Lat(V) of all lattices in VV. The complex distance in Lat(V)Lat(V) is a complete system of invariants of a pair of points of Lat(V)Lat(V) u…

2004-10-09abs ↗pdf ↗

In hyperbolic space, the angle of intersection and distance classify pairs of totally geodesic hyperplanes. A similar algebraic invariant classifies pairs of hyperplanes in the Einstein universe. In dimension 3, symplectic splittings of a 4-dimensional real symplectic vector space model Einstein hyperplanes and the inv…

2017-02-27abs ↗pdf ↗

In the last decades the estimation of the intrinsic dimensionality of a dataset has gained considerable importance. Despite the great deal of research work devoted to this task, most of the proposed solutions prove to be unreliable when the intrinsic dimensionality of the input dataset is high and the manifold where th…

2012-06-18abs ↗pdf ↗

Study loxodromes and geodesics on rotational surfaces in pseudo-isotropic space.

problem No study on loxodromes in pseudo-isotropic space I_p^3.
method Define pseudo-isotropic angles, derive equations for space-like and time-like loxodromes and geodesics on rotational surfaces.
result Equations for space-like and time-like loxodromes and geodesics on rotational surfaces in pseudo-isotropic space.

The study examines discrete states in hyperbolic spaces using specific transformations.

problem Characterizing discrete states in hyperbolic spaces via specific transformations.
method Analyzing two-parameter families of subgroups in hyperbolic planes and spaces with up to four generators.
result Discreteness of accessible states in hyperbolic spaces is determined for specific transformations.

The ropelength of a space curve is usually defined as the quotient of its length by its thickness: the radius of the largest embedded tube around the knot. This idea was extended to space polygons by Eric Rawdon, who gave a definition of ropelength in terms of doubly-critical self-distances (local minima of the distanc…

2004-09-21abs ↗pdf ↗

Properties of a parametric curve in R^3 are often determined by analysis of its piecewise linear (PL) approximation. For Bezier curves, there are standard algorithms, known as subdivision, that recursively create PL curves that converge to the curve in distance . The exterior angles of PL curves under subdivision are s…

2012-10-09abs ↗pdf ↗

The paper extends the Discrete Schwarz-Pick Lemma to circle packings with obtuse intersections and disjoint packings.

problem Proving the Discrete Schwarz-Pick Lemma for circle packings with various inversive distances.
method Using a variational principle for circle packings with inversive distances, the paper extends the lemma to a broader range of packings.
result The Discrete Schwarz-Pick Lemma holds for circle packings with inversive distances in (1,1](-1,1], provided an additional condition on triangle weights.

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 ↗

The paper shows how sublinear biLipschitz equivalences affect Morse boundaries of metric spaces.

problem Understanding how sublinear biLipschitz equivalences affect Morse boundaries of metric spaces.
method Defining sublinear biLipschitz equivalence and Morse boundaries, proving invariance under SBEs, using sublinear rays.
result κ-Morse boundaries of proper geodesic metric spaces are invariant under suitable sublinear biLipschitz equivalences.

In two papers titled "On the so-called non-Euclidean geometry", I and II, Felix Klein proposed a construction of the spaces of constant curvature -1, 0 and and 1 (that is, hyperbolic, Euclidean and spherical geometry) within the realm of projective geometry. Klein's work was inspired by ideas of Cayley who derived the …

2014-06-27abs ↗pdf ↗

We provide a new angle and obtain new results on a class of metrics on length-normalized curves in dd dimensions, represented by their unit tangents expressed as a function of arc-length, which are functions from the unit interval to the (d1)(d-1)-dimensional unit sphere. These metrics are derived from the combined acti…

2018-04-26abs ↗pdf ↗

Solves multi-class imbalanced data problem with geometry-based sampling and synthetic data.

problem Handling imbalanced multi-class data in classification problems.
method Two novel methods: undersampling and oversampling.
result Efficacy demonstrated through comparison with state-of-the-art methods.

Study constant angle surfaces in 4D Minkowski space, proving their properties.

problem Characterize surfaces in 4D Minkowski space with constant angle between tangent planes.
method Define complex angle, prove curvature properties, use PDE methods, analyze special cases.
result Constant angle surfaces have vanishing Gauss and normal curvatures; not complete for ψeq0 [π/2]ψ eq 0\ [π/2].

The space of shapes of a polyhedron with given total angles less than 2πat each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take place a finite distance from a nonsingular point. The metric completion is a comple…

1998-01-19abs ↗pdf ↗

We provide a proof and analyze the asymptotic behavior of a formula for the linking number of line segments.

problem The invariant formula for the linking number of line segments and its asymptotic behavior.
method Detailed proof and asymptotic analysis of the formula.
result We provide a proof and analyze the asymptotic behavior of the formula for the linking number of line segments.

Study angle structures on pseudo 3-manifolds, proving existence for some cases.

problem Determining if hyperbolic 3-manifolds can have angle structures.
method Examined triangulated pseudo 3-manifolds with area-curvature angle structures, establishing sufficient and necessary conditions.
result Compact hyperbolic 3-manifolds with totally geodesic boundary can have angle structures.