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

3587171,0751,433 · Jun 202019922001200920172026
48 results for entropy modeling

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.

Entropy-minimal measure calculated for a stochastic volatility model.

problem Calculating the entropy-minimal equivalent martingale measure in a stochastic volatility model.
method Revised related theory, calculated entropy-minimal measure.
result Entropy-minimal measure for the exponential Ornstein-Uhlenbeck model.

The study evaluates different probability models for uncertainty visualization using entropy calculations.

problem Choosing the right probability model affects memory use, run time, and accuracy in uncertainty visualization.
method Entropy calculation on ensemble data to compare various probability models (uniform, Gaussian, histogram, quantile).
result Models matching the ensemble data distribution have the lowest entropy, indicating better accuracy.

ELBO converges to a sum of entropies for many generative models.

problem Understanding the convergence of variational lower bounds in unsupervised learning.
method Analyzing the ELBO for a broad class of generative models, showing it equals a sum of entropies.
result The ELBO is equal to a sum of entropies at stationary points for many generative models.

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.

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 ↗

AER dynamically adjusts entropy regularization for better LLM reinforcement learning.

problem Policy entropy collapse in RLVR training limits exploration and reasoning performance.
method Adaptive Entropy Regularization (AER) with difficulty-aware coefficient allocation, initial-anchored target entropy, and dynamic global coefficient adjustment.
result AER consistently outperforms baselines on mathematical reasoning benchmarks, improving both accuracy and exploration.

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.

The intrinsic entropy model accurately estimates stock market volatility.

problem Accurately estimating historical volatility of stock market indices.
method Incorporates traded volumes alongside OHLC prices in daily data.
result Intrinsic entropy model delivers reliable estimates with lower coefficient of variation.

REMEDI improves neural entropy estimation across various tasks.

problem Challenges in estimating information theoretic quantities in high-dimensional data.
method Combines minimization of cross-entropy with estimation of deviation from data density.
result Improves accuracy in entropy estimation on synthetic and natural data.

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.

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.

We consider the problem of identifying the causal direction between two discrete random variables using observational data. Unlike previous work, we keep the most general functional model but make an assumption on the unobserved exogenous variable: Inspired by Occam's razor, we assume that the exogenous variable is sim…

2016-11-12abs ↗pdf ↗

Maximum entropy modeling is a flexible and popular framework for formulating statistical models given partial knowledge. In this paper, rather than the traditional method of optimizing over the continuous density directly, we learn a smooth and invertible transformation that maps a simple distribution to the desired ma…

2017-01-12abs ↗pdf ↗

ALIEN improves uncertainty estimation of language models by refining entropy-based methods.

problem Overconfidence in uncertainty estimation for language models, especially for difficult inputs.
method ALIEN refines entropy-based uncertainty by aligning it with prediction reliability, using a lightweight uncertainty head.
result ALIEN consistently outperforms strong baselines in detecting incorrect predictions and achieving the lowest calibration error.

The paper applies math and physics to language models, introducing entropy and geometric concepts.

problem Understanding and improving language models to approximate intelligent language.
method Formal definitions, functional analysis, topology, thermodynamics, and set theory.
result Entropy function reveals key obstacles for LLMs and offers insights into language models.

We translate the problem of calculating the entropy of a set of binary configurations/signals into a sequence of supervised classification tasks. Subsequently, one can use virtually any machine learning classification algorithm for computing entropy. This procedure can be used to compute entropy, and consequently the f…

2019-09-24abs ↗pdf ↗

The study calculates Weyl entropy in spacetime regions and shows its monotonic behavior.

problem Calculating and understanding Weyl entropy in spacetime regions.
method Introducing a candidate density for Weyl entropy in perfect fluid regions and analyzing its behavior in compact spacetime regions.
result Weyl entropy is shown to be monotonic in time and maximal in vacuum static metrics.

We show vanishing results about the infimum of the topological entropy of the geodesic flow of homogeneous smooth four manifolds. We prove that any closed oriented geometric four manifold has zero minimal entropy if and only if it has zero simplicial volume. We also show that if a four manifold M admits a geometric dec…

2006-01-31abs ↗pdf ↗

New approach to portfolio optimization shows entropy regularization is ineffective.

problem Entropy regularization in mean-variance portfolio optimization under drift uncertainty.
method Combining Bayesian filtering and stochastic policy optimization.
result Entropy regularization does not accelerate learning about unknown drift.

Bayesian Markowitz portfolio problem shows entropy regularization is ineffective.

problem Entropy regularization in Bayesian Markowitz portfolio optimization.
method Combines continuous-time Bayesian filtering with stochastic policy optimization.
result Entropy regularization does not accelerate learning of unknown drift.

Paper characterizes embeddability of function spaces into LpL_p-type RKBS via metric entropy.

problem Characterizing embeddability of function spaces into LpL_p-type RKBS.
method Establishes a connection between metric entropy growth and embeddability.
result A bound on metric entropy growth allows embedding into LpL_p-type RKBS.

Paper proposes a Renyi entropy-based method for tuning hierarchical topic models.

problem Tuning hierarchical topic models, especially determining the number of topics at each level, is challenging.
method The paper introduces a Renyi entropy-based metric for quality assessment and a practical tuning concept.
result The proposed method can estimate the number of topics for two hierarchical levels in hARTM model.

Fine-tuning improves information conveyance in language models by reorganizing uncertainty into more informative sequences.

problem Uncertainty reduction in large language models through fine-tuning is not fully understood, especially regarding output length.
method Proposed Canopy Entropy (CE\mathrm{CE}^\star) to measure uncertainty in both output length and sequence, capturing total Shannon entropy.
result Fine-tuned models exhibit stronger positive correlation between entropy rate and semantic diversity, indicating more informative and semantically meaningful generations.

In this paper, we prove the concavity of the Shannon entropy power for the heat equation associated with the Laplacian or the Witten Laplacian on complete Riemannian manifolds with suitable curvature-dimension condition and on compact super Ricci flows. Under suitable curvature-dimension condition, we prove that the ri…

2020-01-02abs ↗pdf ↗

The paper characterizes curvature-dimension conditions and related inequalities on Riemannian manifolds.

problem Curvature-dimension conditions and related inequalities on Riemannian manifolds.
method Information-theoretic approach to study curvature-dimension condition, rigidity theorems, and entropy differential inequalities.
result Equivalence of curvature-dimension condition and entropy differential inequalities on Riemannian manifolds.

Bayesian models use hyperparameters to indirectly assign priors, and this work shows how these priors can be derived from maximum entropy principles.

problem Understanding the assumptions and dependencies in Bayesian hierarchical models.
method Demonstrates how canonical distributions and maximum entropy principles can be used to derive marginal priors in hierarchical models.
result Marginal priors in hierarchical models derived from maximum entropy principles have different constraints compared to the original priors.

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.

In this paper we study the consistency of an empirical minimum error entropy (MEE) algorithm in a regression setting. We introduce two types of consistency. The error entropy consistency, which requires the error entropy of the learned function to approximate the minimum error entropy, is shown to be always true if the…

2014-12-17abs ↗pdf ↗

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.

Proposes integrating global and local entropy for more reliable LLMs.

problem Uncertainty in large language models (LLMs) leads to unreliable predictions.
method Measures global uncertainty from hidden-state matrices and local uncertainty from tokens, combining them via a multiplicative gate.
result Global-Local Uncertainty (GLU) outperforms unsupervised baselines across multiple models and benchmarks.

ProSelfLC improves robustness of deep neural networks by automatically deciding trust in predictions.

problem Training robust deep neural networks requires addressing issues like label noise and low entropy predictions.
method ProSelfLC progressively increases trust in predicted labels over time, considering entropy and learning time.
result ProSelfLC demonstrates improved robustness in both clean and noisy settings through empirical validation.

New method prevents entropy collapse in Transformer training, leading to more stable and robust models.

problem Training instability in Transformers, especially in attention layers.
method Spectral normalization with a learned scalar to prevent entropy collapse.
result Prevents entropy collapse, leading to more stable training.

The paper studies entropy calibration in language models and finds that miscalibration improves slowly with scale.

problem The problem is whether language model entropy calibration improves with scale and if it's possible to calibrate without reducing log loss.
method The authors study a simplified theoretical setting to characterize miscalibration scaling behavior and measure it empirically in language models ranging from 0.5B to 70B parameters.
result The observed scaling behavior of miscalibration is similar to theoretical predictions, indicating slow improvement with scale. The authors also prove theoretically that it is possible to reduce entropy while preserving log loss if access to a black box predicting future entropy is available.