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

4896143191 · Jun 202019922001200920172026
48 results for Euclidean embedding

Paper explores coarse embeddings between symmetric spaces and Euclidean buildings, answering open questions.

problem Understanding coarse embeddings between symmetric spaces and Euclidean buildings.
method Generalization of quasi-isometric embeddings, focusing on coarse embeddings without Euclidean factors.
result Rank is monotonous under coarse embeddings when the domain does not contain a Euclidean factor.

This paper tightens the generalization error bound for graph embedding in non-Euclidean spaces.

problem High generalization error in non-Euclidean graph embedding, preventing practical applications.
method Novel upper bound of graph embedding's generalization error using local Rademacher complexity.
result The new bound is tighter and faster, allowing better performance in non-Euclidean spaces.

Improves hierarchical clustering in Euclidean space using autoencoders.

problem Lack of unsupervised methods for learning hierarchical structure in Euclidean space.
method Variational autoencoder with Gaussian mixture prior, rescaling latent space, and Ward's linkage.
result Improved dendrogram purity and Moseley-Wang cost function results.

Topological manifolds can be embedded flatly in high-dimensional Euclidean space and are locally retracts.

problem Embedding and retraction of topological manifolds in Euclidean spaces.
method Locally flat embedding and retraction of manifolds in high-dimensional Euclidean space.
result Every topological n-manifold can be embedded locally flatly in R2n+1R^{2n+1} and is a retract of some neighborhood in R2n+1R^{2n+1}.

Euclidean embeddings of data are fundamentally limited in their ability to capture latent semantic structures, which need not conform to Euclidean spatial assumptions. Here we consider an alternative, which embeds data as discrete probability distributions in a Wasserstein space, endowed with an optimal transport metri…

2019-05-08abs ↗pdf ↗

New research shows hyperbolic embeddings are useful for global consistency tasks in graphs.

problem The usefulness of hyperbolic representations in graph learning tasks.
method Computed hyperbolic embeddings for node classification and link prediction tasks, addressing optimization issues at zero curvature.
result Hyperbolic embeddings are more effective for tasks requiring global consistency, while Euclidean models are superior for other tasks.

The paper provides bounds for embedding manifolds into Euclidean spaces with group actions.

problem Finding explicit bounds for embedding manifolds into Euclidean spaces with group actions.
method The paper provides upper and lower bounds for the dimension of the Euclidean space required for equivariant embeddings of manifolds into Euclidean spaces for finite group actions.
result Explicit bounds for the dimension of the Euclidean space required for equivariant embeddings of manifolds into Euclidean spaces for finite group actions.

Paper proposes a matrix optimization model for reliable Euclidean embedding from noisy data.

problem Challenges in Euclidean embedding from noisy observations containing outliers.
method Matrix optimization based embedding model to detect and remove outliers.
result The model provides high accuracy estimators and successfully identifies outliers.

Study rational homotopy types of embedding spaces of manifolds.

problem Understanding the rational homotopy types of embedding spaces of manifolds.
method Express rational homotopy types through combinatorially defined L-infinity algebras of diagrams.
result Expressed the rational homotopy type of connected components of embedding spaces.

We prove that each sub-Riemannian manifold can be embedded in some Euclidean space preserving the length of all the curves in the manifold. The result is an extension of Nash C1C^1 Embedding Theorem. For more general metric spaces the same result is false, e.g., for Finsler non-Riemannian manifolds. However, we also sh…

2010-05-10abs ↗pdf ↗

Due to Janet-Cartan's theorem, any analytic Riemannian manifolds can be locally isometrically embedded into a sufficiently high dimensional Euclidean space. However, for an individual Riemannian manifold (M,g), it is in general hard to determine the least dimensional Euclidean space into which (M,g) can be locally isom…

2017-08-29abs ↗pdf ↗

We classify all rotational surfaces in Euclidean space whose principal curvatures κ1κ_1 and κ2κ_2 satisfy the linear relation κ1=aκ2+bκ_1=aκ_2+b, where aa and bb are two constants. We give a variational characterization of these surfaces in terms of its generating curve. As a consequence of our classification, we find clos…

2018-08-22abs ↗pdf ↗

We consider the problem of embedding a relation, represented as a directed graph, into Euclidean space. For three types of embeddings motivated by the recent literature on knowledge graphs, we obtain characterizations of which relations they are able to capture, as well as bounds on the minimal dimensionality and preci…

2019-03-13abs ↗pdf ↗

We show that a pseudo-holomorphic embedding of an almost-complex 2n2n-manifold into almost-complex (2n+2)(2n + 2)-Euclidean space exists if and only if there is a CR regular embedding of the 2n2n-manifold into complex (n+1)(n + 1)-space. We remark that the fundamental group does not place any restriction on the existence of e…

2018-04-21abs ↗pdf ↗

A fast binary embedding method preserves Euclidean distances in high-dimensional data.

problem Preserving Euclidean distances in high-dimensional datasets.
method Stable noise-shaping quantization of AxA x with AA a sparse Gaussian random matrix, followed by a linear transformation.
result Euclidean distances are approximated by the 1\ell_1 norm on binary sequences, leading to accurate binary codes.

Topolow embeds dissimilarity data into Euclidean space robustly against non-metricity and sparsity.

problem Embedding dissimilarity data into Euclidean space when dissimilarities are non-metric or sparse.
method Topolow uses a physics-inspired, gradient-free optimization framework to maximize likelihood under a Laplace error model.
result Topolow outperforms standard MDS methods in reconstructing sparse and non-Euclidean data.

Proves local isometric embedding of low-differentiability metrics in 3D space.

problem Isometric embedding of metrics of low differentiability in Euclidean 3-space.
method Simplified notation, geodesic and level parameters, solutions of initial value problems for first order non-linear PDEs, classical linear algebraic systems.
result Local isometric embedding exists for metrics of C1 differentiability.

New obstruction found for embedding Riemannian manifolds into Euclidean spaces.

problem Embedding Riemannian manifolds into Euclidean spaces with specific conditions.
method Motivated by incompressible Euler equations, a dynamical-topological obstruction is derived.
result Nontrivial first real homology and trivial center of fundamental group imply embedding violation.

Hyperbolic embeddings have recently gained attention in machine learning due to their ability to represent hierarchical data more accurately and succinctly than their Euclidean analogues. However, multi-relational knowledge graphs often exhibit multiple simultaneous hierarchies, which current hyperbolic models do not c…

2019-05-23abs ↗pdf ↗

We discuss constant mean curvature bubbletons in Euclidean 3-space via dressing with simple factors, and prove that single bubbletons are not embedded.

2010-10-29abs ↗pdf ↗

We study isometric embeddings of C2C^2 Riemannian manifolds in the Euclidean space and we establish that the Hölder space C1,12C^{1,\frac{1}{2}} is critical in a suitable sense: in particular we prove that for α>12α> \frac{1}{2} the Levi-Civita connection of any isometric immersion is induced by the Euclidean connection, wh…

2018-09-11abs ↗pdf ↗

Curvature regularization prevents distortion in graph embeddings.

problem Graph topology patterns distort in Euclidean space, making detection difficult.
method Proposes curvature regularization to enforce flatness in embedding manifolds.
result Significant improvements in five embedding methods on open graph datasets.

The paper analyzes side effects of learning from low-dimensional data embedded in a Euclidean space.

problem Learning from data distributed in a linear subspace of high-dimensional space.
method Derives estimates on the variation of the learning function and studies regularization effects.
result Potential regularization effects associated with network depth and noise in codimension of data manifold.

We prove that an m-dimensional unit ball D^m in the Euclidean space {\mathbb R}^m cannot be isometrically embedded into a higher-dimensional Euclidean ball B_r^d \subset {\mathbb R}^d of radius r < 1/2 unless one of two conditions is met -- (1)The embedding manifold has dimension d >= 2m. (2) The embedding is not smoot…

2000-07-03abs ↗pdf ↗

The study compares Euclidean and cosine distances in medical drug prescription prediction.

problem Comparing Euclidean and cosine distances in medical drug prescription prediction.
method Established geometric properties and compared distances in real-world medical data.
result Different distances lead to different optimizing nonlinear kernel embedding frameworks.

The notion of ideal embeddings was introduced in [B.-Y. Chen, {Strings of Riemannian invariants, inequalities, ideal immersions and their applications.} The Third Pacific Rim Geometry Conference (Seoul, 1996), 7-60, Int. Press, Cambridge, MA, 1998]. Roughly speaking, an ideal embedding (or a best of living) is an isome…

2017-06-20abs ↗pdf ↗

Graph convolutional neural networks (GCNs) embed nodes in a graph into Euclidean space, which has been shown to incur a large distortion when embedding real-world graphs with scale-free or hierarchical structure. Hyperbolic geometry offers an exciting alternative, as it enables embeddings with much smaller distortion. …

2019-10-28abs ↗pdf ↗

Piecewise flat approximations for curvature in Euclidean and non-Euclidean spaces.

problem Approximating local extrinsic curvature on discrete manifolds.
method Constructing discrete curvature forms on piecewise flat manifolds, using weighted sums of hinge angles.
result Converges to smooth curvature values as mesh refinement occurs, favorably comparing with other discrete approaches.

Recent work has demonstrated that embeddings of tree-like graphs in hyperbolic space surpass their Euclidean counterparts in performance by a large margin. Inspired by these results and scale-free structure in the word co-occurrence graph, we present an algorithm for learning word embeddings in hyperbolic space from fr…

2018-08-30abs ↗pdf ↗