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

4897145193 · May 202619922001200920172026
48 results for uniform embedding

In this paper we deduce a local deformation lemma for uniform embeddings in a metric covering space over a compact manifold from the deformation lemma for embeddings of a compact subspace in a manifold. This implies the local contractibility of the group of uniform homeomorphisms of such a metric covering space under t…

2012-03-19abs ↗pdf ↗

A local deformation property for uniform embeddings in metric manifolds (LD) is formulated and its behaviour is studied in a formal view point. It is shown that any metric manifold with a geometric group action, typical metric spaces (Euclidean space, hyperbolic space and cylinders) and for κ\leq 0 the κ-cone ends over…

2013-01-15abs ↗pdf ↗

We prove effective uniformization for nearly round 2-spheres and investigate their stability.

problem Proving effective uniformization for nearly round 2-spheres and their stability.
method Utilizing an identity related to the third-order differential of the conformal factor, and an isometric embedding of a round sphere into Euclidean space using an orthogonal basis of the first eigenspace of the Laplacian operator.
result We provide a simplified proof of effective uniformization and its stability.

New method detects communities in hypergraphs by embedding them into a vector space.

problem Detecting communities in hypergraphs with multi-way interactions.
method Augmenting non-uniform hypergraphs, embedding into a vector space, using an alternative updating scheme.
result Asymptotic consistencies in community detection and hypergraph estimation established.

New learning rates for embeddings in RKHSs, even when the target is not Hilbert-Schmidt.

problem Applying conditional mean embeddings to complex ML/RL settings with infinite-dimensional RKHSs.
method Developed novel learning rates using interpolation theory for RKHSs, derived explicit adaptive rates for sample estimator.
result Achieved uniform convergence rates in the output RKHS for certain parameter regimes.

Let GG and GG' be simple Lie groups of equal real rank and real rank at least 22. Let Γ<GΓ<G and Λ<GΛ< G' be non-uniform lattices. We prove a theorem that often implies that any quasi-isometric embedding of ΓΓ into ΛΛ is at bounded distance from a homomorphism. For example, any quasi-isometric embedding of $SL(n,\ma…

2015-12-22abs ↗pdf ↗

Continuous representations have been widely adopted in recommender systems where a large number of entities are represented using embedding vectors. As the cardinality of the entities increases, the embedding components can easily contain millions of parameters and become the bottleneck in both storage and inference du…

2019-11-05abs ↗pdf ↗

Whenever a finitely generated group GG acts properly discontinuously by isometries on a metric space XX, there is an induced uniform embedding (a Lipschitz and uniformly proper map) ρ:GXρ: G \rightarrow X given by mapping GG to an orbit. We study when there is a difference between a finitely generated group GG acting…

2019-03-08abs ↗pdf ↗

This paper refines homotopy theory for cubical sets and uniform spaces.

problem Classical homotopy theory limitations in cubical sets and uniform spaces.
method Develops a uniform-theoretic refinement for cubical sets and uniform spaces, lifting to a full and faithful embedding.
result Lifts classical homotopy categories to new uniform homotopy categories, generalizing cohomology theories.

The study examines how much data is needed for generative and vision-language models to make reliable predictions.

problem Ensuring reliable predictions with low data for models used in medical decision support.
method Analyzes uniform convergence bounds for VLM-induced classifiers under low-dimensional semantic representations.
result Finite-sample uniform convergence bounds for accuracy and calibration functionals of VLM-induced classifiers.

There is a word metric dd on countably generated free group ΓΓ such that (Γ,d)(Γ,d) does not admit a coarse uniform embedding into a Hilbert space.

1999-07-29abs ↗pdf ↗

If one tries to embed a metric space uniformly in Hilbert space, how close to quasi-isometric could the embedding be? We answer this question for finite dimensional CAT(0) cube complexes and for hyperbolic groups. In particular, we show that the Hilbert space compression of any hyperbolic group is 1.

2005-09-05abs ↗pdf ↗

Paper introduces S-SSE for stable sparse subspace embedding.

problem Inefficient sparse random projection matrices with uneven non-zero distribution.
method Uses uniform sampling without replacement to create a stable sparse subspace embedded matrix (S-SSE).
result S-SSE maintains Euclidean distance better after dimension reduction.

This paper proves Hölder continuity for complex Monge-Ampère equations on Kähler varieties.

problem Establishing Hölder estimates on singular Kähler varieties.
method Geometric regularization based on partial C0C^0 estimate.
result Uniform Hölder continuity for complex Monge-Ampère equations on Kähler varieties.

Estimates spectral projections restricted to uniformly embedded submanifolds.

problem Estimating spectral projections on submanifolds of manifolds with nonpositive curvature.
method Estimates the L2(M)oLq(Σ)L^2(M) o L^q(Σ) norm of spectral projection operators.
result Sharp spectral projection estimates for small spectral windows.

Researchers found 5 local fields to uniquely describe 3D director fields, related through 6 differential relations.

problem Understanding the compatibility conditions for 3D director fields.
method Employed the method of moving frames.
result A director field is fully determined by five local fields related through six differential relations.

We show that the type function of a space with finite asymptotic dimension estimates its Hilbert (or any lpl^p) compression. The method allows to obtain the lower bound of the compression of the lamplighter group ZZZ\wr Z, which has infinite asymptotic dimension.

2006-07-16abs ↗pdf ↗

AUASE embeds dynamic networks with stability guarantees for node comparison.

problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.

The study shows that close hypersurfaces have uniformly bounded inequalities.

problem Bounding inequalities for close hypersurfaces.
method Analyzing families of smooth hypersurfaces close to a fixed one.
result Uniformly bounded constants in Sobolev, Gagliardo-Nirenberg, and geometric Calderón-Zygmund inequalities.

The paper proposes a uniformity regularization scheme to improve deep neural network transferability.

problem Improving deep neural network transferability and adaptation to new tasks.
method Introduces a uniformity regularization scheme to encourage high uniformity in embedding space.
result Uniformity regularization consistently offers benefits over baseline methods and achieves state-of-the-art performance in Deep Metric Learning and Meta-Learning.

SymNoise improves language model fine-tuning by 6.7% over NEFTune, using symmetric noise.

problem Improving performance of language models through noise-based fine-tuning.
method Introducing SymNoise, a new fine-tuning method using symmetric noise in embeddings.
result SymNoise increases model performance by 69.04% on AlpacaEval compared to NEFTune's 64.69%.

The current article stems from our study on the asymptotic behavior of holomorphic isometric embeddings of the Poincaré disk into bounded symmetric domains. As a first result we prove that any holomorphic curve exiting the boundary of a bounded symmetric domain ΩΩ must necessarily be asymptotically totally geodesic. A…

2018-07-19abs ↗pdf ↗

We show that, up to some natural normalizations, the moduli space of singly periodic complete embedded maximal surfaces in the Lorentz-Minkowski space $ł^3=(\r^3,dx_1^2+dx_2^2-dx_3^2),$ with fundamental piece having a finite number (n+1)(n+1) of singularities, is a real analytic manifold of dimension 3n+4.3n+4. The underlyin…

2004-12-09abs ↗pdf ↗

Let ρρ be a maximal representation of a uniform lattice ΓSU(n,1)Γ\subset{\rm SU}(n,1), n2n\geq 2, in a classical Lie group of Hermitian type HH. We prove that necessarily H=SU(p,q)H={\rm SU}(p,q) with pqnp\geq qn and there exists a holomorphic or antiholomorphic ρρ-equivariant map from complex hyperbolic space to the symmetric sp…

2015-06-24abs ↗pdf ↗

Characterizes infinite ideal polyhedra in hyperbolic 3-space and proves their existence and rigidity.

problem Characterize infinite ideal polyhedra in hyperbolic 3-space.
method Study ideal circle patterns (ICPs) and develop a uniform Ring Lemma via pointed Gromov-Hausdorff convergence.
result Establish existence and rigidity of embedded ICPs and infinite ideal polyhedra (IIP).

Compressing word embeddings is important for deploying NLP models in memory-constrained settings. However, understanding what makes compressed embeddings perform well on downstream tasks is challenging---existing measures of compression quality often fail to distinguish between embeddings that perform well and those th…

2019-09-03abs ↗pdf ↗

This paper improves spectral embedding for multipartite networks, revealing latent subspaces and providing consistent node representations.

problem Improving spectral embedding for multipartite networks to better represent node types.
method Developed a follow-on step to spectral embedding that recovers node representations in their intrinsic rather than ambient dimension, proving consistency under a specific model.
result Node representations in multipartite networks lie near type-specific subspaces, and the proposed method recovers these representations consistently.

In this paper, we find a holomorphic Darboux chart around any immersed noncompact holomorphic Legendrian curve in a complex contact manifold (X,ξ)(X,ξ). By using such a chart, we show that every holomorphic Legendrian immersion RXR\to X from an open Riemann surface can be approximated on relatively compact subsets by holo…

2017-02-02abs ↗pdf ↗

Improved SRHT for linear SVM classification with higher accuracy.

problem Inefficient random projection methods for high-dimensional data.
method Importance sampling and deterministic top-rr sampling for effective low-dimensional embedding.
result Higher classification accuracy on real-life datasets.

The paper provides generalization bounds for metric learning using neural network embeddings.

problem Generalization guarantees for metric learning with neural network embeddings.
method Uniform generalization bounds for two regimes: sparse and bounded amplification.
result Dimension-free generalization bounds can be achieved even without sparsity in solutions.

A new method estimates multi-dimensional value distributions using Hilbert space embeddings.

problem Estimating value distributions in complex, multi-dimensional reinforcement learning settings.
method Hilbert space mappings and kernel mean embeddings to estimate the kernel mean embedding of multi-dimensional value distributions.
result Uniform convergence guarantees and robust off-policy evaluation demonstrated in simulations.