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

Trend · papers per month

2356 · Jun 202619922001200920172026
48 results for relative-entropy

Extends specific relative entropy to multidimensional continuous martingales.

problem Mutual singularity of martingale laws in continuous time.
method Extension of specific relative entropy from one to multiple dimensions, including closed-form expressions for simple examples.
result Establishes that the lower bound on specific relative entropy from Gantert carries over to higher dimensions and is tight.

New statistical test for change-point detection using relative entropy.

problem Offline change-point detection using divergence metrics.
method Study of empirical relative entropy distributions, derivation of approximations, introduction of new Berry-Esseen bounds.
result Theoretical and practical validation of relative entropy for change-point detection.

Inference for normal and Monte Carlo distributions using minimum relative entropy.

problem Inference from partial information on expectations and covariances.
method Minimum relative entropy sub-manifolds, analytical formulas, Monte Carlo simulations.
result Improved numerical implementation for inference from partial information.

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.

New regularization method reduces support of empirical risk minimization solutions.

problem Regularization in empirical risk minimization with relative entropy.
method Introduces Type-II regularization, characterizes solutions, analyzes properties of relative entropy.
result Type-II regularization collapses solution support into reference measure's support.

We investigate the mm-relative entropy, which stems from the Bregman divergence, on weighted Riemannian and Finsler manifolds. We prove that the displacement KK-convexity of the mm-relative entropy is equivalent to the combination of the nonnegativity of the weighted Ricci curvature and the KK-convexity of the weig…

2010-05-08abs ↗pdf ↗

We define a relative entropy for two expanding solutions to mean curvature flow of hypersurfaces, asymptotic to the same cone at infinity. Adapting work of White and using recent results of Bernstein and Bernstein-Wang, we show that expanders with vanishing relative entropy are unique in a generic sense. This also impl…

2018-12-20abs ↗pdf ↗

We introduce a class of generalized relative entropies (inspired by the Bregman divergence in information theory) on the Wasserstein space over a weighted Riemannian or Finsler manifold. We prove that the convexity of all the entropies in this class is equivalent to the combination of the nonnegative weighted Ricci cur…

2011-12-23abs ↗pdf ↗

Study quantifies information flow in neural networks using relative entropy and RG analogy.

problem Quantifying information flow in deep neural networks.
method Explicit computation of relative entropy in Ising models and feedforward neural networks.
result Monotonic increase of relative entropy to an asymptotic value, confirming connection to c-theorem.

This paper optimizes trading strategies to minimize risk and maximize profit while accounting for market uncertainty.

problem Optimizing trading strategies to minimize risk and maximize profit while accounting for market uncertainty.
method Relative entropy-regularized robust optimal control problem, modeled as a stochastic differential game.
result Analytical expressions for optimal strategy and trajectory are derived under specific assumptions.

A new method, REC, compresses images by encoding their latent representations efficiently.

problem Efficiently compressing single images with latent representations.
method Relative Entropy Coding (REC) that directly encodes latent representations with codelength close to relative entropy.
result REC is more efficient for single image compression compared to previous methods and is competitive for lossy compression.

In this paper we focus on the uniqueness question for (expanding) solutions of the Harmonic map flow coming out of smooth 0-homogeneous maps with values into a closed Riemannian manifold. We introduce a relative entropy for two purposes. On the one hand, we prove the existence of two expanding solutions associated to a…

2018-06-30abs ↗pdf ↗

This paper strengthens the central limit theorem for order statistics using relative entropy.

problem Establishing a stronger mode of convergence for central limit behavior of order statistics.
method Using relative entropy to ensure a stronger mode of convergence for central limit behavior of order statistics.
result An order O(1/n)O(1/\sqrt{n}) rate of convergence is established under mild conditions.

Abstract: Necessary and sufficient conditions for gradient flows of relative entropy in Lindblad equations.

problem Conditions for gradient flows in finite-dimensional Lindblad equations.
method Analyzes conditions for a finite-dimensional Lindblad equation to have a gradient flow structure for the von Neumann relative entropy.
result A finite-dimensional Lindblad equation admits a gradient flow structure for the von Neumann relative entropy if and only if the BKM-detailed balance condition holds.

Paper develops a robust HVA measure for dynamic hedging under liquidity stress.

problem Valuation of dynamic hedging under liquidity stress.
method Defines robust HVA as worst-case expected loss over a relative-entropy neighborhood of loss distributions for no-trade bands.
result Wider no-trade bands lower rebalancing costs but increase hedge-error risk.

This work tightens generalization error bounds using Wasserstein distance.

problem Improving expected generalization error bounds in machine learning.
method Introduces bounds based on Wasserstein distance for various settings.
result New, tighter bounds based on relative entropy and other information measures.

REGS samples from unnormalized distributions using gradient flow and neural networks.

problem Sampling from unnormalized distributions with high accuracy and efficiency.
method REGS is a particle method that iteratively transforms samples from a reference distribution to match an unnormalized target distribution using Wasserstein gradient flow and neural networks.
result REGS outperforms state-of-the-art methods in sampling from challenging multimodal distributions and real datasets.

In his 2011 work, Maas has shown that the law of any time-reversible continuous-time Markov chain with finite state space evolves like a gradient flow of the relative entropy with respect to its stationary distribution. In this work we show the converse to the above by showing that if the relative law of a Markov chain…

2014-05-11abs ↗pdf ↗

New method uses asymmetric Tsallis relative entropy for better risk assessment in financial portfolios.

problem Improving risk assessment for financial portfolios using asymmetric data.
method Generalized Tsallis relative entropy (ATRE) for asymmetric distributions of returns.
result ATRE shows better risk-return profiles, especially during market crashes.

The study optimizes distribution estimation from samples with relative entropy error, adapting to sparse distributions.

problem Estimating discrete distributions with high-probability accuracy in relative entropy.
method Analysis of Laplace estimator and confidence-dependent smoothing techniques, including data-dependent smoothing.
result Optimal high-probability risk bounds for various estimators, including a new data-dependent smoothing method.

Study shows uniform-time chaos propagation in mean field Langevin dynamics.

problem Understanding the convergence of marginal distributions in mean field dynamics.
method Assumed functional convexity of energy, used LpL^p-convergence and Wasserstein metrics.
result Uniform-in-time propagation of chaos proved in both L2L^2-Wasserstein and relative entropy.

Study finds optimal martingale coupling between two distributions with minimal entropy.

problem Finding the optimal martingale coupling between two distributions with minimal relative entropy.
method Solving a dual problem to find the log-density of the optimal coupling, which represents the marginal and martingale constraints.
result The log-density of the optimal coupling is given by a triplet of real functions representing the marginal and martingale constraints.

A pricing principle is introduced for non-attainable claims in incomplete markets.

problem Pricing non-attainable contingent claims in incomplete markets.
method Distorted Radon-Nikodym derivative and Tsallis relative entropy over a family of equivalent martingale measures.
result The pricing principle is closely related to backward stochastic differential equations and is arbitrage-free and time-consistent.

This work bounds the generalization error of private algorithms for discrete data.

problem Bounding the generalization error of private algorithms for discrete data.
method Information-theoretic approach using relative entropy and the method of types.
result Explicit upper bounds on the generalization error of stable private algorithms for discrete data.

The goal of this paper is to explore the basic Approximate Bayesian Computation (ABC) algorithm via the lens of information theory. ABC is a widely used algorithm in cases where the likelihood of the data is hard to work with or intractable, but one can simulate from it. We use relative entropy ideas to analyze the beh…

2018-12-05abs ↗pdf ↗

Improved sampling from complex distributions with reduced bias.

problem Reducing bias in high-dimensional sampling algorithms.
method Hierarchical entropy analysis to weaken assumptions and expand scope.
result Bias reduction in low-dimensional marginals scales with lower dimension, not full dimension.

The paper studies harmonic map heat flow to flat tori, proving ergodic behavior and convergence to hyperbolic measure.

problem Analyzing the behavior of harmonic map heat flow to moduli space of flat tori.
method Investigates stability and ergodic behavior of harmonic map heat flow using hyperbolic structure and relative entropy.
result The flow converges weak--^{*} to the normalized hyperbolic measure on the moduli space.

Develops a robust hedging valuation adjustment measure for dynamic hedging under liquidity-demand stress.

problem Dynamic hedging under liquidity-demand stress
method Define robust HVA as the worst-case expected loss over a relative-entropy neighborhood of the loss distribution generated by simulated rebalancing and maturity-unwind trades.
result Distinguishes fixed-radius convention from fixed benchmark-stress convention and shows wider no-trade bands lower rebalancing costs but raise hedge-error risk.

Paper finds a new principle for optimizing consumption and wealth using Tsallis entropy.

problem Optimal consumption-investment problem with recursive utility.
method Established connection to quadratic BSDE, derived stochastic maximum principle.
result Proved existence of optimal strategy and analyzed coupled system.

The paper studies scaling limits of hedging prices in financial models.

problem Scaling limits of exponential utility indifference prices in financial models.
method Formulated dual problem as stochastic control, solved HJB equation for upper bound, used duality result for lower bound.
result Represented scaling limit in terms of specific relative entropy and constructed asymptotic optimal hedging strategies.

Study proves uniqueness of corrugated negatively curved immersions in differential geometry.

problem Negatively curved immersions in differential geometry.
method Relative entropy method applied to Gauss-Codazzi system.
result Uniqueness of smooth isometric immersions within corrugated class.

A measure called relative cluster entropy distinguishes between correlated and uncorrelated sequences.

problem Distinguishing between sequences with different correlation degrees.
method Minimum relative entropy principle applied to cluster partitions of power-law correlated sequences.
result Optimal Hurst exponents are selected for market price series, indicating non-markovianity.

Study shows how optimal transport behaves in higher dimensions.

problem Characterizing optimal transport in higher dimensions with Euclidean distance.
method Investigates the small regularization limit of entropic optimal transport.
result The limiting transport plan is supported on transport rays and uniquely minimizes a relative entropy functional.

A one-to-one correspondence is drawn between law invariant risk measures and divergences, which we define as functionals of pairs of probability measures on arbitrary standard Borel spaces satisfying a few natural properties. Divergences include many classical information divergence measures, such as relative entropy a…

2015-10-23abs ↗pdf ↗