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

Trend · papers per month

326496128 · May 202619922001200920172026
48 results for algebraic entropy

Characterizes pseudo-Anosov mapping classes using cluster algebra techniques.

problem Characterize pseudo-Anosov mapping classes purely in terms of shear coordinates.
method Uses cluster algebraic generalization and tropical cluster transformations.
result Algebraic entropies of cluster transformations match topological entropy.

We prove a uniform version of the Tits alternative. As a consequence, we obtain uniform lower bounds for the Cheeger constant of Cayley grahs of finitely generated non virtually solvable linear groups in arbitrary characteristic. Also we show that the algebraic entropy of discrete subgroups of a given Lie group is unif…

2005-07-21abs ↗pdf ↗

The paper constructs diffeomorphisms on a G2G_2-manifold achieving entropy bounds.

problem Achieving Yomdin's homological lower bound for topological entropy on G2G_2-manifolds.
method Constructs diffeomorphisms mimicking Farb-Looijenga's for K3 surfaces and acts freely on Teichmüller space.
result The homotopy moduli space of G2G_2 structures on the manifold has an infinite fundamental group.

Compact RCD spaces derived from singular Kahler metrics on 3D projective varieties.

problem Understanding geometric structures of singular Kahler spaces.
method Proving RCD spaces homeomorphic to 3D projective varieties with bounded Nash entropy and Ricci curvature.
result Compact RCD spaces are equivalent to underlying projective varieties.

The conformal module of conjugacy classes of braids implicitly appeared in a paper of Lin and Gorin in connection with their interest in the 13. Hilbert Problem. This invariant is the supremum of conformal modules (in the sense of Ahlfors) of certain annuli related to the conjugacy class. This note states that the conf…

2012-08-07abs ↗pdf ↗

Efficient approximations reduce computation of matrix-based Renyi's entropy.

problem High computational complexity of matrix-based Renyi's entropy.
method Taylor, Chebyshev, and Lanczos approximations to reduce complexity.
result Reduced complexity to significantly less than O(n2)O(n^2) with negligible accuracy loss.

Study minimal volume entropy for free-by-cyclic groups and 2D right-angled Artin groups.

problem Characterize minimal volume entropy for aspherical simplicial complexes with these groups as fundamental groups.
method Algebraic and geometric characterization, using fiber π1π_1-growth collapse and non-collapsing assumptions.
result Provide bounds and criteria for minimal volume entropy in aspherical simplicial complexes.

The study connects Hilbert entropy to non-differentiability points of limit sets in flag spaces.

problem Understanding non-differentiability points in limit sets of convex projective structures.
method Introduces hyperplane conicality for θθ-Anosov representations and uses it to prove properties of boundary maps.
result Hilbert entropy is linked to the Hausdorff dimension of non-differentiability points in flag spaces.

We consider magnetic flows on 2-step nilmanifolds M=Γ\GM = Γ\backslash G, where the Riemannian metric gg and the magnetic field σσ are left-invariant. Our first result is that when σσ represents a rational cohomology class and its restriction to g=TeG\mathfrak{g} = T_eG vanishes on the derived algebra, then the associated…

2015-12-08abs ↗pdf ↗

New measure of maximal entropy found for a class of geometrically finite groups.

problem Finding a measure of maximal entropy for relatively Anosov groups.
method Constructing reparameterizations and using exponential expansion along unstable foliations.
result The Bowen-Margulis-Sullivan measure is finite and unique for relatively Anosov groups.

The ability of many powerful machine learning algorithms to deal with large data sets without compromise is often hampered by computationally expensive linear algebra tasks, of which calculating the log determinant is a canonical example. In this paper we demonstrate the optimality of Maximum Entropy methods in approxi…

2017-09-08abs ↗pdf ↗

Proves finite measure implies product structure for certain discrete subgroups.

problem Classifying discrete subgroups with finite Bowen-Margulis-Sullivan measure.
method Product structure of leafwise measures and high entropy method.
result Proves virtually a product structure for certain subgroups.

A pseudo-Anosov surface automorphism φφ has associated to it an algebraic unit λφλ_φ called the dilatation of φφ. It is known that in many cases λφλ_φ appears as the spectral radius of a Perron-Frobenius matrix preserving a symplectic form LL. We investigate what algebraic units could potentially appear as dilatatio…

2011-04-13abs ↗pdf ↗

On the predual of a von Neumann algebra, we define a differentiable manifold structure and affine connections by embeddings into non-commutative L_p-spaces. Using the geometry of uniformly convex Banach spaces and duality of the L_p and L_q spaces for 1/p+1/q=1, we show that we can introduce the α-divergence, for αin (…

2003-11-05abs ↗pdf ↗

Let XX be an nn-dimensional simply connected manifold of pinched sectional curvature a2K1-a^2 \leq K \leq -1. There exist a positive constant C(n,a)C(n,a) such that for any finitely generated discrete group ΓΓ acting on XX, then either ΓΓ is virtually nilpotent or the algebraic entropy Ent(Γ)C(n,a)Ent (Γ) \geq C(n,a).

2008-10-17abs ↗pdf ↗

Infinite volume requires no atoms at the bottom of the spectrum for certain groups.

problem Determining conditions for infinite volume in certain algebraic groups.
method Analyzing the spectral properties of Laplace operators on symmetric spaces.
result The bottom of the L2L^2-spectrum being an atom is necessary and sufficient for finite volume.

The Milnor Problem (modified) in the theory of group growth asks whether any finite presented group of vanishing algebraic entropy has at most polynomial growth. We show that a positive answer to the Milnor Problem (modified) is equivalent to the Nilpotency Conjecture in Riemannian geometry: given n,d>0n, d>0, there exist…

2018-06-07abs ↗pdf ↗

Rényi divergence is related to Rényi entropy much like Kullback-Leibler divergence is related to Shannon's entropy, and comes up in many settings. It was introduced by Rényi as a measure of information that satisfies almost the same axioms as Kullback-Leibler divergence, and depends on a parameter that is called its or…

2012-06-12abs ↗pdf ↗

Let T be the nilpotent group of 4 x 4 real upper triangular matrices. In this note we show that the Euler equations of certain left-invariant riemannian metrics on T have a horseshoe. We also show, with the aid of a numerical computation of a Melnikov-type integral, that the Euler equations of the sub-riemannian Carnot…

2007-09-28abs ↗pdf ↗

We introduce a new distance metric for non-linear embeddings of Tempered Exponential Measures.

problem Non-linear embeddings of Tempered Exponential Measures (TEMs).
method Parameterization of finite discrete TEMs via Legendre functions, introducing tempered Hilbert co-simplex distance.
result Established a generalization of the Hilbert log cross-ratio simplex distance to a tempered Hilbert co-simplex distance.

Formula for harmonic current dimension on foliated surfaces, extending Brunella's inequality.

problem Calculating the dimension of harmonic currents on foliated complex surfaces.
method Proving a formula involving Furstenberg entropy and Lyapunov exponent.
result Hausdorff dimension of harmonic current is bounded and can be calculated precisely.

Enhances RL by controlling policy stochasticity through trajectory entropy constraints.

problem Non-stationary Q-value estimation and short-sighted entropy tuning in maximum entropy RL.
method Proposes TECRL framework with separate Q-functions for reward and entropy, enforcing a trajectory entropy constraint.
result DSAC-E algorithm achieves higher returns and better stability on OpenAI Gym benchmarks.

The paper calculates bounds for risk metrics and entropies under partial information constraints.

problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.

The paper analyzes worst-case distortion risk metrics and weighted entropy under partial information.

problem Analyzing worst-case distortion risk metrics and weighted entropy with limited information.
method General distributions, partial information (mean and variance), various entropies and risk measures.
result Provides worst-case results for distortion risk metrics and weighted entropy.

HCLM framework uses entropy regularization for open learning systems.

problem Real-world AI challenges and limitations of deep learning.
method Dynamical and information-theoretic framework with entropy regularization.
result Geometric entropy surrogates, especially log-determinant covariance entropy, induce stronger and more stable information forces.

The main result of this article is that if a 33-manifold MM supports an Anosov flow, then the number of conjugacy classes in the fundamental group of MM grows exponentially fast with the length of the shortest orbit representative, hereby answering a question raised by Plante and Thurston in 1972. In fact we show th…

2015-05-29abs ↗pdf ↗

JES optimizes expensive functions by considering joint entropy over input and output spaces.

problem Optimizing expensive functions with limited evaluations.
method Joint Entropy Search (JES) considers joint entropy over input and output spaces.
result JES outperforms other information-theoretic methods in Bayesian optimization.

We give a notion of entropy for general gemetric structures, which generalizes well-known notions of topological entropy of vector fields and geometric entropy of foliations, and which can also be applied to singular objects, e.g. singular foliations, singular distributions, and Poisson structures. We show some basic p…

2011-09-24abs ↗pdf ↗

We prove curvature-free versions of the celebrated Margulis Lemma. We are interested by both the algebraic aspects and the geometric ones, with however an emphasis on the second and we aim at giving quantitative (computable) estimates of some important invariants. Our goal is to get rid of the pointwise curvature assum…

2017-12-22abs ↗pdf ↗

DAC enhances exploration in reinforcement learning with entropy regularization.

problem Improving exploration efficiency in reinforcement learning.
method Sample-aware entropy regularization using replay buffer action distributions.
result DAC significantly outperforms existing algorithms in reinforcement learning tasks.