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

16314762 · May 202619922001200920172026
48 results for Entropy

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.

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 ↗

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.

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.

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 ↗

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 studies an entropy-based multi-objective Bayesian optimization (MBO). The entropy search is successful approach to Bayesian optimization. However, for MBO, existing entropy-based methods ignore trade-off among objectives or introduce unreliable approximations. We propose a novel entropy-based MBO called Pare…

2019-06-01abs ↗pdf ↗

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.

In this paper, we develop the notion of entropy for uniform hypergraphs via tensor theory. We employ the probability distribution of the generalized singular values, calculated from the higher-order singular value decomposition of the Laplacian tensors, to fit into the Shannon entropy formula. We show that this tensor …

2019-12-20abs ↗pdf ↗

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 ↗

We extend the notion of the geometric entropy of foliation to foliated manifolds equipped with leafwise Finsler structure. We study the relation between the geometric entropy and the topological entropy of the holonomy pseudogroup. The case of foliated manifold with leafwise Randers structure. In this case the estimate…

2014-10-03abs ↗pdf ↗

Entropy asymmetry affects regularization in ERM, leading to biased solutions.

problem Analyzing the impact of relative entropy asymmetry in ERM regularization.
method Examined Type-I and Type-II ERM-RER, comparing their solutions and properties.
result Type-II ERM-RER regularization introduces a strong bias against training data.

We investigate entropy as a financial risk measure. Entropy explains the equity premium of securities and portfolios in a simpler way and, at the same time, with higher explanatory power than the beta parameter of the capital asset pricing model. For asset pricing we define the continuous entropy as an alternative meas…

2015-01-06abs ↗pdf ↗

Entrocraft addresses RL performance saturation in LLMs by customizing entropy curves.

problem Performance saturation in RL algorithms for LLMs.
method Entrocraft uses rejection sampling to bias advantage distributions for customized entropy schedules.
result Entrocraft significantly improves generalization, output diversity, and long-term training in 4B models.

Paper tests for time-varying entropy in stock prices, finding periods of inefficiency.

problem Testing for time-varying entropy in stock price dynamics.
method Unbiased approximation of Shannon entropy variance, optimal rolling window selection, hypothesis testing.
result Existence of periods of market inefficiency for meme stocks.

Paper proposes a policy-search algorithm to learn entropy-maximizing exploration policies in reward-free environments.

problem Reward-free learning in high-dimensional, continuous-control domains.
method Maximum Entropy POLicy optimization (MEPOL) algorithm that maximizes a non-parametric state entropy estimate.
result MEPOL learns a maximum-entropy exploration policy that facilitates learning various reward-based tasks.