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

Trend · papers per month

1.9%3.8%5.8%7.7% · Oct 199419922001200920182026
48 results for diastatic entropy

Let f:YXf: Y \rightarrow X be a continuous map between a compact real analytic Kähler manifold (Y,g)(Y,g) and a compact complex {hyperbolic manifold} (X,g0)(X,g_0). In this paper we give a lower bound of the diastatic entropy of (Y,g)(Y,g) in terms of the diastatic entropy of (X,g0)(X,g_0) and the degree of ff. When the lower bound i…

2015-05-08abs ↗pdf ↗

We give un upper bound Ent(Ω, g)<λ of the diastatic entropy Ent(Ω, g) of a complex bounded domain (Ω, g) in terms of the balanced condition (in Donaldson terminology) of the Kaehler metric λg. When (Ω, g) is a homogeneous bounded domain we show that the converse holds true, namely if Ent(Ω, g)<1 then g is balanced. Mor…

2013-03-13abs ↗pdf ↗

Let (M,g)(M, g) be a real analytic Kaehler manifold. We say that a smooth map Ep:WME_p:W\to M from a neighborhood WW of the origin of TpMT_pM into MM is a {\em diastatic exponential} at pp if it satisfies $$(d \E_p)_0=\id_{T_pM},$$ $$D_p(\E_p (v))=g_p(v, v), \forall v\in W,$$ where DpD_p is Calabi's diastasis function at $…

2009-04-07abs ↗pdf ↗

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.

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.

Unified framework for maximum entropy RL using Tsallis entropy.

problem Generalizing maximum entropy reinforcement learning with various entropies.
method Tsallis MDPs with Tsallis entropy maximization, controlling entropic index.
result Different entropic indices lead to different optimal policies and exploration tendencies.

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 ↗

PFES uses entropy of Pareto-frontier for multi-objective Bayesian optimization.

problem Bayesian optimization for multi-objective problems, especially trade-off among objectives.
method Pareto-frontier entropy search (PFES) incorporating trade-off relation.
result PFES effectively incorporates dependency among objectives conditioned on Pareto-frontier.

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.

Study on non-archimedean μ-entropy for toric varieties, proving existence and uniqueness.

problem Exploring non-archimedean μ-entropy for toric varieties and its thermodynamical structure.
method Established a Rellich type compactness result for convex functions on simple polytope, proving existence and uniqueness of optimizer.
result Existence and uniqueness of optimizer for toric non-archimedean μ^λ-entropy for λ ≤ 0.

We study the problem of discovering the simplest latent variable that can make two observed discrete variables conditionally independent. The minimum entropy required for such a latent is known as common entropy in information theory. We extend this notion to Renyi common entropy by minimizing the Renyi entropy of the …

2018-07-26abs ↗pdf ↗

Low-entropy surfaces can be flowed into spheres and cylinders.

problem Proving mean curvature flow for low-entropy hypersurfaces.
method Low-entropy density drop argument and recent work on hypersurfaces.
result Closed hypersurfaces with entropy ≤ 2 can be flowed into spherical and cylindrical shapes.

Quantum machine learning uses quantum cross entropy to minimize loss, but measurement loss affects this process.

problem Quantum machine learning's loss minimization through cross entropy is affected by measurement outcomes.
method Defined quantum cross entropy, proved its lower bounds, and investigated its relation to quantum fidelity and likelihood.
result Quantum cross entropy is lower-bounded by negative log-likelihood when derived from quantum data, but measurement outcomes can cause loss.

The paper extends entropy formulas to super Ricci flows on metric measure spaces.

problem Entropy formulas for super Ricci flows on metric measure spaces.
method Extending Perelman's WW-entropy and Shannon entropy power to super Ricci flows.
result Equivalence between volume non-local collapsing property and lower boundedness of WW-entropy on RCD(0,N)(0, N) spaces.

Structured entropy improves classification performance on structured targets.

problem Cross-entropy loss fails to account for target variable structure.
method Proposes structured entropy, a generalization of entropy using random partitions.
result Structured cross-entropy loss yields better results on classification problems with known structure.

The article presents a new entropy model for assessing stock market interest.

problem Assessing investor interest and market sentiment in exchange-traded securities.
method Intrinsic entropy model using actual trading data, without exogenous factors.
result Empirical evidence supports the model's ability to predict trading activity.

This paper proves a curvature entropy inequality for non-symmetric convex bodies.

problem Proving a curvature entropy inequality for non-symmetric convex bodies.
method Demonstrated the log-Minkowski inequality of curvature entropy for general convex bodies in 2D.
result Equivalence of cone-volume measure uniqueness, log-Minkowski volume inequality, and curvature entropy inequality for general convex bodies in 2D.

Proves uniqueness of measure of maximal entropy for geodesic flows on surfaces.

problem Proving uniqueness of measure of maximal entropy for geodesic flows on surfaces.
method Analyzes geodesic flows on closed orientable C^∞ surfaces, proving uniqueness of measure of maximal entropy and at most one SRB measure.
result Proves uniqueness of measure of maximal entropy for geodesic flows on surfaces, covering previous results and new examples.

State entropy regularization improves robustness in reinforcement learning, especially under structured perturbations.

problem Structured and spatially correlated perturbations in reinforcement learning.
method State entropy regularization, compared to policy entropy.
result State entropy regularization provides better robustness to structured and spatially correlated perturbations.

The notion of utility maximising entropy (u-entropy) of a probability density, which was introduced and studied by Slomczynski and Zastawniak (Ann. Prob 32 (2004) 2261-2285, arXiv:math.PR/0410115 v1), is extended in two directions. First, the relative u-entropy of two probability measures in arbitrary probability space…

2007-09-09abs ↗pdf ↗

The paper analyzes Perelman's entropies on manifolds with conical singularities.

problem Analyzing manifolds with conical singularities using Perelman's entropies.
method Employing singular Ricci de Turck flow and Perelman's entropies to study manifolds with conical singularities.
result Entropy is monotone along the singular Ricci de Turck flow and helps in proving properties of Ricci solitons.