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

78156234312 · Jun 202019922001200920172026
48 results for Entropy Rate

Rate GENERIC extends thermodynamics principles to non-equilibrium systems.

problem Understanding non-equilibrium thermodynamics and its relation to equilibrium thermodynamics.
method Developed a geometrical framework for rate GENERIC, extending Onsager's variational principle.
result Rate GENERIC structure provides a new perspective on thermodynamics in non-equilibrium systems.

New methods for inferring, predicting, and estimating continuous-time, discrete-event processes.

problem Inferring, predicting, and estimating entropy rate of continuous-time, discrete-event processes.
method Bayesian structural inference extended with neural networks.
result Methods are competitive for prediction and entropy-rate estimation with state-of-the-art.

Sharp bounds on neural network approximation rates and widths.

problem Estimating approximation rates, metric entropy, and n-widths of shallow neural networks.
method Introducing smoothly parameterized dictionaries and providing upper and lower bounds.
result Sharp bounds on approximation rates, metric entropy, and n-widths for neural networks with various activation functions.

The aim of this paper is to state and prove polynomial analogues of the classical Manning inequality relating the topological entropy of a geodesic flow with the growth rate of the volume of balls in the universal covering. To this aim we use two numerical conjugacy invariants, the {\em strong polynomial entropy $h_{po…

2011-05-12abs ↗pdf ↗

Softmax policy gradient methods converge at O(1/t)O(1/t) rate with constants depending on problem and initialization.

problem Understanding convergence rates of softmax policy gradient methods in tabular settings.
method Analysis of softmax policy gradient and entropy regularized policy gradient methods, using Łojasiewicz inequality and lower bounds.
result Entropy regularization improves convergence rate from O(1/t)O(1/t) to O(ect)O(e^{-c \cdot t}).

This thesis applies entropy as a model independent measure to address three research questions concerning financial time series. In the first study we apply transfer entropy to drawdowns and drawups in foreign exchange rates, to study their correlation and cross correlation. When applied to daily and hourly EUR/USD and…

2018-07-25abs ↗pdf ↗

We establish optimal rates for online regression for arbitrary classes of regression functions in terms of the sequential entropy introduced in (Rakhlin, Sridharan, Tewari, 2010). The optimal rates are shown to exhibit a phase transition analogous to the i.i.d./statistical learning case, studied in (Rakhlin, Sridharan,…

2014-02-11abs ↗pdf ↗

Estimating the entropy based on data is one of the prototypical problems in distribution property testing and estimation. For estimating the Shannon entropy of a distribution on SS elements with independent samples, [Paninski2004] showed that the sample complexity is sublinear in SS, and [Valiant--Valiant2011] showed…

2018-02-22abs ↗pdf ↗

The paper analyzes the convergence rates of Q-learning with entropy regularization and linear function approximation.

problem Analyzing the convergence rates of Q-learning with entropy regularization and linear function approximation.
method The paper derives rates of convergence using the high-dimensional central limit theorem, linearization of the soft Bellman recursion, and Gaussian approximation for the leading martingale term.
result The algorithm's last iterate satisfies high-order moment bounds, with a Gaussian approximation bound of order n1/4n^{-1/4}.

In this paper, we propose a general framework to learn a robust large-margin binary classifier when corrupt measurements, called anomalies, caused by sensor failure might be present in the training set. The goal is to minimize the generalization error of the classifier on non-corrupted measurements while controlling th…

2016-10-21abs ↗pdf ↗

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 characterizes probability and entropy of exponentially growing sample spaces.

problem Characterizing probability and entropy of exponentially growing sample spaces.
method Analytical and applied to real-world data (US$ broad money supply).
result Information entropy is related to the rate of sample space expansion.

In this article we prove two formulas for the topological entropy of an F-optical Hamiltonian flow induced by a C^{\infty} Hamiltonian, where F is a Lagrangian distribution. In these formulas, we calculate the topological entropy as the exponential growth rate of the average of the determinant of the differential of th…

2000-10-05abs ↗pdf ↗

Improved first-order algorithm for entropy regularized OT with faster convergence.

problem Solving entropy regularized optimal transport efficiently.
method Accelerated primal-dual stochastic mirror descent algorithm with variance reduction.
result Improved rate from O~(n2.5/ε)\widetilde{O}({n^{2.5}}/ε) to O~(n2/ε)\widetilde{O}({n^2}/ε).

Sharp lower bounds on shallow neural networks' approximation rates are derived.

problem The efficiency of shallow neural networks in approximating functions.
method Lower bounding the L2L^2-metric entropy and Kolmogorov nn-widths of the convex hull of neural network basis functions.
result Sharp lower bounds on the approximation rates for shallow neural networks are provided.

Gibbs sampler contracts entropy under strong log-concavity, improving mixing time.

problem Improving the mixing time of Gibbs sampler under strong log-concavity.
method Analyzing Gibbs sampler contraction under strong log-concavity, providing sharp contraction rate.
result Gibbs sampler contracts entropy linearly with condition number and independent of dimension under strong log-concavity.

In this paper, we propose a general framework to learn a robust large-margin binary classifier when corrupt measurements, called anomalies, caused by sensor failure might be present in the training set. The goal is to minimize the generalization error of the classifier on non-corrupted measurements while controlling th…

2015-07-16abs ↗pdf ↗

Investigates the relationship between US money supply and asset indices over 2001-2019.

problem Determining the relationship between US money supply and asset indices growth.
method Information entropy methodology applied to US asset indices (Property, Russell 2000, S&P 500, NASDAQ) over 2001-2019.
result Growth in US broad money supply is the main determinant of US asset indices growth, especially the NASDAQ and Russell 2000.

Entropy-regularized NPG converges linearly with linear function approximation.

problem Analyzing convergence of entropy-regularized NPG with function approximation.
method Established finite-time convergence analyses with entropy regularization and linear function approximation.
result Entropy-regularized NPG achieves linear convergence up to a function approximation error.

Let MM be a compact Riemannian manifold without boundary and V:MRV:M\to \mathbb R a smooth function. Denote by PtP_t and dμ=eVdx{\rm d}μ=e^V\,{\rm d} x the semigroup and symmetric measure of the second order differential operator L=Δ+VL=Δ+\nabla V\cdot\nabla. For some suitable convex function Φ:IRΦ:{\mathcal I}\to\mathbb R define…

2015-01-08abs ↗pdf ↗

The paper proves a quantitative rigidity result for spaces with specific curvature bounds.

problem Understanding the rigidity of spaces with almost maximal volume entropy.
method Analyzing Riemannian manifolds and RCD\operatorname{RCD}-spaces with specific curvature conditions.
result Spaces with almost maximal volume entropy are closely related to hyperbolic space forms.

Mathematical study of excess growth rate connects info theory with finance.

problem Understanding the excess growth rate in portfolio theory.
method Axiomatic characterization theorems of excess growth rate in terms of relative entropy, Jensen's inequality gap, and logarithmic divergence.
result Established rich connections between information theory and finance.

Gradient descent converges with arbitrary stepsize for separable data under Fenchel-Young losses.

problem Understanding the conditions under which gradient descent converges with arbitrary stepsize.
method Using Fenchel-Young losses and leveraging the classical perceptron argument to derive convergence rates.
result GD converges with arbitrary stepsize for a majority of Fenchel-Young losses, with better rates for specific loss functions.

Paper proposes deep neural networks for nonparametric regression from dependent data.

problem Nonparametric regression from strongly mixing observations.
method Minimum error entropy principle applied to deep neural networks.
result Deep neural networks achieve minimax optimal convergence rates for Gaussian errors.

New method uses entropy dissipation to prove isoperimetric inequalities.

problem Proving isoperimetric inequalities in geometric settings.
method Information-theoretic approach based on entropy dissipation under heat flow.
result New proof of Euclidean isoperimetric inequality with sharp constant.

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.

There are many industrial situations where rods are used to stir a fluid, or where rods repeatedly stretch a material such as bread dough or taffy. The goal in these applications is to stretch either material lines (in a fluid) or the material itself (for dough or taffy) as rapidly as possible. The growth rate of mater…

2010-04-05abs ↗pdf ↗

Paper develops a new probabilistic method for American options using entropy regularization.

problem Finding optimal stopping times for American options with entropy regularization.
method Entropy-regularized penalization scheme based on Doob-Meyer-Mertens decomposition and reflected backward stochastic differential equations.
result Explicit convergence rates and policy improvement algorithm for American options.

Holomorphic automorphisms on hyperkähler manifolds with high entropy are Kummer examples.

problem Characterizing holomorphic automorphisms with high entropy on hyperkähler manifolds.
method Using Jensen's inequality and properties of stable and unstable distributions, the authors show uniform contraction and expansion, leading to the conclusion that the manifold is birational to a torus quotient.
result Holomorphic automorphisms with high entropy on hyperkähler manifolds are Kummer examples.

Building accurate language models that capture meaningful long-term dependencies is a core challenge in natural language processing. Towards this end, we present a calibration-based approach to measure long-term discrepancies between a generative sequence model and the true distribution, and use these discrepancies to …

2019-06-11abs ↗pdf ↗

Improved exploration methods for reinforcement learning with reduced sample complexity.

problem Challenges in reinforcement learning exploration in unknown environments.
method Proposed game-theoretic and trajectory entropy algorithms with improved sample complexity.
result Established statistical advantage of entropy-regularized MDPs for exploration and reduced sample complexity.

New method accelerates convergence for entropy-regularized reinforcement learning problems.

problem Slow convergence of standard first-order methods for entropy-regularized Markov decision processes.
method Introduce a quadratically convexified primal-dual formulation and a new interpolating metric to accelerate convergence.
result Global convergence and exponential convergence rate for the new method.

Study exact minimax rates for density estimation over convex classes, extending previous work.

problem Deriving minimax rates for density estimation over convex density classes.
method Building on Le Cam's work, determine exact minimax rates using local metric entropy.
result Exact minimax rates derived for any convex density class, including nonparametric and parametric cases.