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

Trend · papers per month

18.8%37.5%56.3%75.0% · Jul 199319922001200920182026
48 results for dense embedding

We discuss dense embeddings of surface groups and fully residually free groups in topological groups. We show that a compact topological group contains a nonabelian dense free group of finite rank if and only if it contains a dense surface group. Also, we obtain a characterization of those Lie groups which admit a dens…

2006-02-27abs ↗pdf ↗

Sharp criteria found for dense eigenvalues in Riemannian manifolds.

problem Finding conditions for dense eigenvalues in Riemannian manifolds.
method Sharp criteria on radial curvature for existence of asymptotically flat or hyperbolic manifolds.
result Construction of manifolds with dense embedded point spectrum and sharp curvature bounds.

ViCE uses superpixels to enhance self-supervised learning for better dense visual embeddings.

problem Lack of high-resolution feature maps from self-supervised models.
method Superpixels for dense representation learning, contrasting over regions.
result Improves unsupervised semantic segmentation on benchmarks like Cityscapes and COCO.

The square-peg problem is solved using configuration spaces and multijet transversality.

problem Proving that every simple closed curve in the plane has an odd number of inscribed squares.
method Using the multijet transversality theorem and configuration spaces, we find a dense set of smooth embeddings for which the configuration space of points is transverse to any submanifold.
result A dense family of smoothly embedded circles in the plane and in Rn\mathbb{R}^n have an odd number of inscribed square-like quadrilaterals.

The paper constructs complete holomorphic immersions in complex spaces.

problem Finding complete holomorphic immersions in complex spaces.
method Constructing complete injective holomorphic immersions in C2\mathbb{C}^2 and generalizing to closed submanifolds.
result Complete holomorphic immersions in C2\mathbb{C}^2 and related spaces are constructed.

The purpose of this paper is to present, for all n3n\ge 3, very simple examples of continuous maps f:Mn1Mnf:M^{n-1} \to M^{n} from closed (n1)(n-1)-manifolds Mn1M^{n-1} into closed nn-manifold MnM^n such that even though the singular set S(f)S(f) of ff is countable and dense, the map ff can nevertheless be approximated by an …

2008-03-29abs ↗pdf ↗

NetSMF efficiently embeds large networks by sparse matrix factorization.

problem Learning latent representations for large-scale networks efficiently.
method NetSMF leverages spectral sparsification to efficiently sparsify and factorize a dense matrix.
result NetSMF achieves high efficiency and effectiveness on large-scale networks.

New method uses product embeddings to predict bundle success.

problem Designing effective product bundles in large retail settings.
method Leverage historical purchases and clickstream data to generate product embeddings, then use heuristics for complementarity and substitutability.
result Embeddings-based heuristics predict bundle success, robust across categories and retailers.

We prove that every proper nn-dimensional length metric space admits an "approximate isometric embedding" into Lorentzian space R3n+6,1\mathbb{R}^{3n+6,1}. By an "approximate isometric embedding" we mean an embedding which preserves the energy functional on a prescribed set of geodesics connecting a dense set of points.

2016-01-28abs ↗pdf ↗

SOLAR improves search efficiency and accuracy with sparse, orthogonal embeddings.

problem Bottleneck of indexing large dense vectors and NNS for query efficiency and accuracy.
method Proposes SOLAR embeddings: sparse, orthogonal, learned, and random vectors across multiple GPUs.
result Successfully trains 500K dimensional SOLAR embeddings for 1.6M books and multi-label classification.

In this paper, we prove (1): for any closed contact three-manifold with a CC^\infty-generic contact form, the union of periodic Reeb orbits is dense, (2): for any closed surface with a CC^\infty-generic Riemannian metric, the union of closed geodesics is dense. The key observation is CC^\infty-closing lemma for 3D R…

2015-08-30abs ↗pdf ↗

A new deep metric learning method pulls embeddings towards dense clusters to improve classification accuracy.

problem Improving classification accuracy in deep metric learning models.
method Density Aware Metric Learning (DAML) which pulls embeddings towards the densest regions of clusters for each class.
result DAML achieves faster convergence and higher generalizability compared to existing methods.

The Nash-Kuiper Theorem states that the collection of C1C^1-isometric embeddings from a Riemannian manifold MnM^n into EN\mathbb{E}^N is C0C^0-dense within the collection of all smooth 1-Lipschitz embeddings provided that n<Nn < N. This result is now known to be a consequence of Gromov's more general hh-principle. Ther…

2015-07-31abs ↗pdf ↗

The paper studies PCA of probability measures with varying sample sizes and finds optimal convergence rates.

problem PCA of multiple probability measures with varying sample sizes.
method Double asymptotic regime analysis with convergence rates n1/2+mαn^{-1/2} + m^{-α} for empirical covariance and PCA risk.
result Optimal convergence rates for empirical covariance and PCA risk in the dense regime are proven.

A new method uses sinusoidal functions to represent timestamps as dense vectors for improving irregularly sampled time series learning.

problem Challenges in supervised learning with irregularly sampled time series due to irregular time intervals.
method Proposes a novel method to represent timestamps as dense vectors using sinusoidal functions, called Time Embeddings.
result Improves LSTM-based and classical machine learning models, especially with very irregular data.

Study on stable Hamiltonian topology finds non-density of certain structures.

problem Non-density of stable hypersurfaces and Hamiltonian structures.
method Proving non-density results for stable hypersurfaces and Hamiltonian structures in various dimensions.
result Non-density of stable hypersurfaces and Hamiltonian structures in specific isotopy and homotopy classes.

We prove analogues for Cartan geometries of Gromov's major theorems on automorphisms of rigid geometric structures. The starting point is a Frobenius theorem, which says that infinitesimal automorphisms of sufficiently high order integrate to local automorphisms. Consequences include a stratification theorem describing…

2008-12-03abs ↗pdf ↗

The study constructs a dense orbit in the universal commensurability augmented Teichmüller space.

problem Understanding the dense orbit in the universal commensurability augmented Teichmüller space.
method Using isometric embeddings and directed limits of augmented Teichmüller and moduli spaces.
result The action of the universal commensurability modular group on the universal commensurability augmented Teichmüller space produces a dense orbit.

We prove a transversality "lifting property" for compactified configuration spaces as an application of the multijet transversality theorem: the submanifold of configurations of points on an arbitrary submanifold of Euclidean space may be made transverse to any submanifold of the configuration space of points in Euclid…

2014-02-25abs ↗pdf ↗

New examples of embeddings defy Anosov representation limits.

problem Examples of robust quasi-isometric embeddings not approximated by Anosov representations.
method Exhibited non-locally rigid, Zariski dense embeddings in SLm(K)\mathsf{SL}_m(\mathbb{K}).
result Higher rank Anosov representation theorems fail for m30m\geq 30.

Local deformations of solutions to open PDEs can be extended globally if derivatives are constant along a subset.

problem Extending local deformations to global deformations for solutions to open PDEs.
method Showing that local deformations can be extended globally if derivatives are constant along a closed subset.
result General approximation result by sections with very restrictive local properties on dense open subsets.

This work proposes a method to learn sparse representations that are more efficient for large-scale data retrieval.

problem Efficient retrieval of high-dimensional representations from large databases is computationally challenging.
method The approach minimizes the number of floating-point operations (FLOPs) by learning sparse embeddings with uniform non-zero entries.
result The proposed method achieves a similar or better speed-vs-accuracy tradeoff compared to existing baselines.

Let GG be a simply connected, solvable Lie group and ΓΓ a lattice in GG. The deformation space D(Γ,G)\mathcal{D}(Γ,G) is the orbit space associated to the action of $\Aut(G)$ on the space X(Γ,G)\mathcal{X}(Γ,G) of all lattice embeddings of ΓΓ into GG. Our main result generalises the classical rigidity theorems of Mal'tsev…

2011-11-23abs ↗pdf ↗

Very recently Ben Andrews and Haizhong Li showed that every embedded cmc torus in the three dimensional sphere is axially symmetric. There is a two-parametric family of axially symmetric cmc surfaces; more precisely, for every real number H and every C > 2 (H+\sqrt{1+H^2}) there is an axially symmetry surface Σ_{H,C} w…

2012-09-17abs ↗pdf ↗

In the curve complex for a surface, a handlebody set is the set of loops that bound properly embedded disks in a given handlebody bounded by the surface. A boundary set is the set of non-separating loops in the curve complex that bound two-sided, properly embedded surfaces. For a Heegaard splitting, the distance betwee…

2007-07-04abs ↗pdf ↗

This note optimizes distributions using kernel mean embeddings with a new parameterization.

problem Optimizing distributions using kernel mean embeddings is challenging due to the difficulty of characterizing probability distribution vectors.
method Proposes a new parameterization of positive functions using kernel sums-of-squares to fit distributions in the MMD geometry.
result Distributions with kernel sum-of-squares densities are dense in the MMD geometry, allowing optimization in the finite-sample setting.

A new method reduces embedding size for efficient recommendation systems.

problem Memory bottleneck in embedding tables for diverse categorical features.
method Complementary partitions to produce unique embeddings without explicit definition.
result Our approach reduces embedding size and maintains similar accuracy.

Minimal products of spherical immersions are studied with geometric and dynamical properties.

problem Minimal products of spherical immersions and their geometric properties.
method Profile flow, Liouville integrability, phase map analysis, Routh completion, primitive order analysis.
result Minimal products have a scalar Sturm form plus two nonnegative squares in their Hessian.

The study finds infinitely many semi-arithmetic Riemann surfaces with dense systoles and distinct invariant trace fields.

problem Existence and properties of semi-arithmetic Riemann surfaces.
method Combining number theory and hyperbolic geometry to prove existence and properties of semi-arithmetic Riemann surfaces.
result Existence of infinitely many semi-arithmetic Riemann surfaces with dense systoles and distinct invariant trace fields.