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

56112167223 · Jun 202019922001200920172026
48 results for formal embeddings

Generalized Tanaka prolongation ensures convergence of formal embeddings of complex manifolds.

problem Ensuring convergence of formal embeddings of complex manifolds under weaker conditions.
method Formulated and proved generalized Tanaka prolongation for geometric structures.
result Convergence of formal embeddings holds under weaker semi-positive normal bundle conditions.

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency structure on the half-edges around each vertex, and an embedding of a *-graph is…

2012-12-22abs ↗pdf ↗

The paper explores how semantic independence can be captured in text embeddings using partial orthogonality.

problem Capturing semantic independence in text embeddings.
method Developed a theory and methods based on partial orthogonality to demonstrate semantic independence.
result Partial orthogonality captures semantic independence in text embeddings.

In this work we study the properties of deep neural networks (DNN) with random weights. We formally prove that these networks perform a distance-preserving embedding of the data. Based on this we then draw conclusions on the size of the training data and the networks' structure. A longer version of this paper with more…

2014-12-18abs ↗pdf ↗

Spaces over BO are equivalent to thickened manifolds.

problem Understanding embeddings of manifolds in higher dimensions.
method Formal identification of manifolds with their thickened versions, using geometric constructions.
result The infinity-category of thickened smooth manifolds is equivalent to the infinity-category of finite spaces over BO.

The Fisher information metric is an important foundation of information geometry, wherein it allows us to approximate the local geometry of a probability distribution. Recurrent neural networks such as the Sequence-to-Sequence (Seq2Seq) networks that have lately been used to yield state-of-the-art performance on speech…

2017-10-25abs ↗pdf ↗

Embedding large and high dimensional data into low dimensional vector spaces is a necessary task to computationally cope with contemporary data sets. Superseding latent semantic analysis recent approaches like word2vec or node2vec are well established tools in this realm. In the present paper we add to this line of res…

2019-11-26abs ↗pdf ↗

Inspired by a work of Kapranov, we define the notion of Dolbeault complex of the formal neighborhood of a closed embedding of complex manifolds. This construction allows us to study coherent sheaves over the formal neighborhood via complex analytic approach, as in the case of usual complex manifolds and their Dolbeault…

2012-06-22abs ↗pdf ↗

We investigate modular embeddings for semi-arithmetic Fuchsian groups. First we prove some purely algebro-geometric or even topological criteria for a regular map from a smooth complex curve to a quaternionic Shimura variety to be covered by a modular embedding. Then we set up an adelic formalism for modular embeddings…

2015-09-02abs ↗pdf ↗

When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different edge-weight representations, under a generic low rank model. We measure the quality of dif…

2019-10-12abs ↗pdf ↗

Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties. Existing graph embedding techniques, however, do not scale well to large graphs. We therefore propose a framework for parallel computat…

2019-09-06abs ↗pdf ↗
Inca Foamsmath.GT

We study a certain class of embedded two-foams that arise from gluing discs into ribbon torus knots along nonintersecting torus meridians. We exhibit several equivalent diagrammatic formalisms for these objects and identify several of their invariants, including a unique prime decomposition.

2015-09-03abs ↗pdf ↗

New insights show embedding lengths correlate with semantic properties.

problem Contrastive embedding norms ignore embedding magnitudes but correlate with semantic properties.
method Formal theoretical framework and analysis of optimization dynamics.
result Embedding lengths encode semantic information as a byproduct of training.

Conditional kernel mean embeddings form an attractive nonparametric framework for representing conditional means of functions, describing the observation processes for many complex models. However, the recovery of the original underlying function of interest whose conditional mean was observed is a challenging inferenc…

2019-06-01abs ↗pdf ↗

The abstract manifold cannot have uniformly quasiregular self-maps.

problem Characterizing uniformly quasiregularly elliptic manifolds.
method Introducing conformally formal manifolds and proving their properties.
result The abstract manifold is not uniformly quasiregularly elliptic.

This work proposes a geometric approach to equivariant message passing on Riemannian manifolds.

problem Efficiently processing data on Riemannian manifolds with equivariance.
method Geometric insight into equivariant message passing on Riemannian manifolds, using an equivariant embedding and diffusion process.
result A new class of equivariant GNNs on Riemannian manifolds.

Manifold embedding algorithms map high-dimensional data down to coordinates in a much lower-dimensional space. One of the aims of dimension reduction is to find intrinsic coordinates that describe the data manifold. The coordinates returned by the embedding algorithm are abstract, and finding their physical or domain-r…

2018-11-29abs ↗pdf ↗

Word embeddings are commonly obtained as optimizers of a criterion function ff of a text corpus, but assessed on word-task performance using a different evaluation function gg of the test data. We contend that a possible source of disparity in performance on tasks is the incompatibility between classes of transformat…

2019-11-06abs ↗pdf ↗

Our work proves robustness of embedding schemes to discrete changes in text.

problem Discrete changes in text, like replacing a word, affect model robustness.
method Formal proofs and quantitative bounds for embedding schemes (concatenation, TF-IDF, Paragraph Vector).
result Embedding schemes are robust to discrete changes in text with Hölder or Lipschitz properties.

We address the following natural extension problem for group actions: Given a group GG, a subgroup HGH\le G, and an action of HH on a metric space, when is it possible to extend it to an action of the whole group GG on a (possibly different) metric space? When does such an extension preserve interesting properties o…

2017-03-08abs ↗pdf ↗

Develops a new framework for temporal anchoring in deep embedding spaces.

problem Temporal anchoring in deep embedding spaces, especially drift and convergence issues.
method Operator-theoretic framework with drift maps and event-indexed blocks, proving convergence theorems and equivalence theorems.
result Proves convergence theorems and equivalence theorems for the proposed framework.

This paper makes a formal study of asymptotically hyperbolic Einstein metrics given, as conformal infinity, a conformal manifold with boundary. The space on which such an Einstein metric exists thus has a finite boundary in addition to the usual infinite boundary and a corner where the two meet. On the finite boundary …

2017-08-08abs ↗pdf ↗

The abstract discusses convergent realizations of Lie subalgebras in control theory.

problem Characterizing Lie subalgebras that can be realized as convergent vector fields.
method Generalizations and reformulations of algebraic properties for output realization.
result Recovery and clarification of previous results on control-affine systems and realization of Chen-Fliess series.

New algorithm tackles dynamic query routing to multiple embedding models.

problem Dynamic query routing to multiple embedding models under adversarial conditions.
method Formalized as adversarial contextual linear bandit with low-rank experts, proposed HPG algorithm.
result HPG algorithm achieves linearized policy regret of ildeO(sMT) ilde{\mathcal O}(s\sqrt{M T}).

Using standard analysis only, we present an extension R{^\bullet\R} of the real field containing nilpotent infinitesimals. On the one hand we want to present a very simple setting to formalize infinitesimal methods in Differential Geometry, Analysis and Physics. On the other hand we want to show that these infinitesim…

2003-08-13abs ↗pdf ↗

We solve the vector embedding problem by minimizing total distortion under constraints.

problem Assigning representative vectors to items with similarity and dissimilarity constraints.
method Projected quasi-Newton method for MDE problems, scalable to large data sets.
result Our method provides principled ways to validate embeddings and scales to millions of items.

We develop a geometric approach to quantum mechanics based on the concept of the Tulczyjew triple. Our approach is genuinely infinite-dimensional and including a Lagrangian formalism in which self-adjoint (Schroedinger) operators are obtained as Lagrangian submanifolds associated with the Lagrangian. As a byproduct we …

2017-11-17abs ↗pdf ↗

Formalizes concepts as latent variables in hierarchical models for high-dimensional data.

problem Lack of formalization and theoretical insights for learning discrete concepts from high-dimensional data.
method Formalizes concepts as latent causal variables in a hierarchical model, formulates conditions for concept identification.
result Conditions for identifying latent hierarchical models in unsupervised data, handling complex structures and high-dimensional data.

Quantum kernels can be efficiently embedded into classical feature spaces.

problem Can all quantum kernels be efficiently embedded into classical feature spaces?
method Invoking computational universality and using techniques like random Fourier features, the authors show that certain classes of quantum kernels can be efficiently embedded.
result For shift-invariant and composition kernels, embedding quantum kernels are universal and efficient.

Researchers solve a question about embedding knots into Legendrian structures.

problem Whether every fixed knot type and Legendrian representative have surjective homomorphisms.
method Study of Legendrian embeddings and smooth embeddings in (S3,ξstd)(\mathbb{S}^3,ξ_{\operatorname{std}}) from a homotopical viewpoint.
result Positive answer for infinitely many knot types in three main families, showing rigidity at higher homotopy levels.

Study the spaces of Legendrian knots and links with maximal Thurston-Bennequin invariant.

problem Homotopy types of spaces of Legendrian knots and links with maximal Thurston-Bennequin invariant.
method Recursive formula and contractibility proofs for specific cases.
result Homotopy equivalence and contractibility results for spaces of Legendrian embeddings.