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

95191286381 · Jun 202019922001200920172026
48 results for dense representation

New representations of hyperbolic 3-manifold groups into larger groups.

problem Finding representations of hyperbolic 3-manifold groups into larger matrix groups.
method Holonomy representations from projective deformations of hyperbolic structures.
result First examples of strongly dense representations into SL(4,R)SL(4,\mathbb{R}) and SU(3,1)SU(3,1).

We show that the bounded Borel class of any dense representation $ρ: G\to \PSL_n\bC$ is non-zero in degree three bounded cohomology and has maximal semi-norm, for any discrete group GG. When n=2n=2, the Borel class is equal to the 33-dimensional hyperbolic volume class. Using tools from the theory of Kleinian groups, …

2018-11-30abs ↗pdf ↗

DenseHMM improves HMMs by learning dense representations that enable gradient-based optimization.

problem Learning dense representations for hidden states and observables in HMMs.
method DenseHMM uses kernelized transition probabilities and two optimization schemes.
result DenseHMM achieves superior performance and expressiveness compared to standard HMMs.

Cataclysm deformations study Anosov representations and their convergence.

problem Understanding convergence of Anosov representations under deformation.
method Cataclysm deformation of Anosov representations using twisted transverse cocycles.
result Uniform convergence of cataclysm deformations on compact sets.

Cataclysm deformations study Anosov representations, leading to new formulas and non-open sets.

problem Understanding Anosov representations and their deformations.
method Cataclysm deformations based on twisted transverse cocycles.
result Uniform convergence of cataclysm deformations on compact sets.

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.

New domains of discontinuity found for Anosov representations.

problem Understanding Anosov representations acting on homogeneous spaces.
method Constructing open domains of discontinuity for Anosov representations acting on specific homogeneous spaces.
result Describes the largest possible open domains of discontinuity for Zariski dense Anosov representations.

The paper explores mapping class group quotients by Dehn twists and their representations.

problem Finite quotients and representations of mapping class groups by powers of Dehn twists.
method Construction of finite quotients using representations with Zariski dense images into semisimple Lie groups, and Long and Moody's method.
result The Fibonacci TQFT representation is a specialization of the Jones representation in genus 2.

We prove that a dense subgroup of Homeo+(I)\mathrm{Homeo}_{+}(I) is not elementary amenable. We also show that the topological group Homeo+(I)\mathrm{Homeo}_{+}(I) does not satisfy the Stability of the Generators Property, moreover, any finitely generated subgroup of Homeo+(I)\mathrm{Homeo}_{+}(I) admits a faithful discrete representation …

2013-12-05abs ↗pdf ↗

We show the set of faithful representations of a closed orientable hyperbolic surface group is dense in both irreducible components of the PSL(2,K) representation variety, where K is the field of real or complex numbers, answering a question of W. Goldman. We also prove the existence of faithful representations into PU…

2004-11-11abs ↗pdf ↗

We study the TQFT mapping class group representations for surfaces with boundary associated with the SU(2)SU(2) gauge group, or equivalently the quantum group $U_q(\Sl(2))$. We show that at a prime root of unity, these representations are all irreducible. We also examine braid group representations for transcendental valu…

2018-09-18abs ↗pdf ↗

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 ↗

This work lists and describes the main recent strategies for building fixed-length, dense and distributed representations for words, based on the distributional hypothesis. These representations are now commonly called word embeddings and, in addition to encoding surprisingly good syntactic and semantic information, ha…

2019-01-25abs ↗pdf ↗

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.

We address feature interpretation and reproducibility issues in dense nets, proposing a modified loss function.

problem Feature interpretation and reproducibility issues in dense nets.
method Proposed a modified loss function to circumvent basis collapse.
result Substantially concise nets with 100x fewer parameters and lower MSE loss.

New method learns robot actions from videos without explicit labels.

problem Training robots to perform tasks from few demonstrations.
method Uses images and text for task-agnostic and general representation, synthesizes hallucinated actions, and applies dense correspondences.
result Trains robot policies solely from RGB videos, achieving diverse tasks across different robots and environments.

We study the problem of large-scale network embedding, which aims to learn latent representations for network mining applications. Previous research shows that 1) popular network embedding benchmarks, such as DeepWalk, are in essence implicitly factorizing a matrix with a closed form, and 2)the explicit factorization o…

2019-06-26abs ↗pdf ↗

New properties established for SO(3) quantum representations, showing density and surjectivity.

problem Properties of SO(3) quantum representations of mapping class groups.
method Analyzing roots of unity and maximal ideals of Z[ζ_p] to establish properties.
result SO(3) quantum representations have dense image and are surjective modulo unramified maximal ideals.

We present two related methods for deriving connectivity-based brain atlases from individual connectomes. The proposed methods exploit a previously proposed dense connectivity representation, termed continuous connectivity, by first performing graph-based hierarchical clustering of individual brains, and subsequently a…

2018-08-10abs ↗pdf ↗

DNAS disentangles neural architecture search for better interpretability and performance.

problem Lack of interpretability in existing neural architecture search methods.
method DNAS disentangles the hidden representation of the controller into semantically meaningful concepts.
result DNAS achieves state-of-the-art performance and competitive architectures.

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.

We consider the question: can the isotropy representation of an irreducible pseudo-Riemannian symmetric space be realized as a conformal holonomy group? Using recent results of Cap, Gover and Hammerl, we study the representations of SO(2,1), PSU(2,1) and PSp(2,1) as isotropy groups of irreducible symmetric spaces of si…

2012-08-10abs ↗pdf ↗

Extends DAMs to Gaussian distributions for efficient pattern storage and retrieval.

problem Limited storage capacity and retrieval methods for non-vector pattern representations.
method Introduces a log-sum-exp energy function over Gaussian distributions, using optimal transport maps for retrieval dynamics.
result Proves exponential storage capacity and provides quantitative retrieval guarantees.

The study finds non-uniform lattices with thin Hitchin representations in specific Lie groups.

problem Finding thin Hitchin representations in non-uniform lattices of Lie groups.
method Arithmetic methods to construct thin Hitchin representations.
result Infinitely many orbits of thin Hitchin representations in non-uniform lattices.

In text mining, information retrieval, and machine learning, text documents are commonly represented through variants of sparse Bag of Words (sBoW) vectors (e.g. TF-IDF). Although simple and intuitive, sBoW style representations suffer from their inherent over-sparsity and fail to capture word-level synonymy and polyse…

2013-01-28abs ↗pdf ↗

The Burau representation is a fundamental bridge between the braid group and diverse other topics in mathematics. A 1974 question of Birman asks for a description of the image; in this paper we give a "strong approximation" to the answer. Since a 1984 paper of Squier it has been known that the Burau representation pres…

2019-03-27abs ↗pdf ↗

The study examines growth of quadratic forms under Anosov subgroups.

problem Growth of quadratic forms under Anosov subgroups.
method Analyzes exponential bounds and asymptotic counting functions for distances between geodesic copies of symmetric spaces.
result Shows asymptotic behavior of counting functions for certain choices of quadratic forms.