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

59119178237 · Jun 202019922001200920172026
48 results for Tsallis entropic regularization

We find the wealth distribution for an economic agent in the financial market, in analogy with standard derivation of generaliz Boltzman (Tsallis) factor in statistical mechanics. In this respect, Tsallis entropic index separates two different regimes, the large and small size market. The Pareto like wealth distributio…

2004-04-28abs ↗pdf ↗

Estimate relaxation times in nonextensive systems using gradient flow for Tsallis entropy maximization.

problem Estimating relaxation times in financial market dynamics.
method Developing a method using EGF for maximizing Tsallis entropy.
result Longer relaxation times for nonextensive systems compared to Shannon entropy.

We establish an analogy between the motion of spring whose mass increases linearly with time and volatile stock markets dynamics within an economic model based on simple temporal demand and supply functions [J. Phys. A: Math. Gen. 33, 3637 (2000)]. The total system energy E_t is shown to be proportional to a decreasing…

2009-05-27abs ↗pdf ↗

Develops a Best-of-Both-Worlds algorithm for linear contextual bandits with Tsallis entropy.

problem Linear contextual bandits with i.i.d. contexts.
method Follow-The-Regularized-Leader (FTRL) with Tsallis entropy.
result Achieves $O\left(\log(T)^{\frac{1+β}{2+β}}T^{\frac{1}{2+β}} ight)$ regret under margin condition.

This paper explores how entropic regularization improves Wasserstein estimators' performance.

problem Improving the approximation and estimation properties of Wasserstein estimators.
method Entropic regularization of optimal transport costs to smooth Wasserstein estimators.
result Entropic regularization can achieve comparable statistical performance to un-regularized estimators at lower computational cost.

This paper introduces a new potential function using Tsallis entropy for neural network optimization.

problem The challenge of obtaining exponential convergence in neural network optimization.
method Utilizes a linearized potential function based on Csiszár type of Tsallis entropy.
result Derives an exponential convergence result in neural network optimization.

This work generalizes calibeating for a broader range of proper losses using Bregman divergence.

problem Calibration for a wide range of proper losses beyond Brier and log loss.
method Regret minimization based on Bregman divergence for a family of proper losses.
result U-calibration results for a family of Tsallis losses with logarithmic regret and dimension independence.

Study entropic regularization of Gaussian measures and processes on Hilbert space.

problem Regularizing 2-Wasserstein distance for infinite-dimensional Gaussian measures and processes.
method Minimum Mutual Information property, closed form formulas, Fréchet differentiability, Sinkhorn barycenter equation.
result Entropic 2-Wasserstein distance and Sinkhorn divergence are Fréchet differentiable in Hilbert space.

Improved neural framework for scaling entropic MOT with significant computational gains.

problem High computational overhead in multimarginal optimal transport.
method Neural Entropic MOT (NEMOT) using mini-batch training to reduce complexity.
result Significant speedups and feasibility improvements for multimarginal data.

A new method for barycenter of probability measures using entropic optimal transport.

problem Finding a weighted average of probability distributions.
method Doubly regularized Wasserstein barycenters with entropic optimal transport.
result The new formulation is debiased and has a smooth density, leading to efficient estimation and optimization.

We present the qGaussian generalization of the Merton framework, which takes into account slow fluctuations of the volatility of the firms market value of financial assets. The minimal version of the model depends on the Tsallis entropic parameter q and the generalized distance to default. The empirical foundation and …

2014-10-24abs ↗pdf ↗

Study on utility maximization with Tsallis entropy in reinforcement learning.

problem Exploring utility maximization with Tsallis entropy in reinforcement learning.
method Introducing Tsallis entropy regularizer to induce exploration, investigating specific examples, characterizing well-posedness, designing reinforcement learning algorithm.
result Characterized well-posedness and provided semi-closed-form solutions for specific examples, found distinct optimal strategies.

Study of Gaussian distributions using entropic Gromov-Wasserstein and inner product Gromov-Wasserstein.

problem Optimal transportation between Gaussian distributions with different dimensions.
method Entropic Gromov-Wasserstein and inner product Gromov-Wasserstein, with closed-form expressions and von Neumann's trace inequality.
result Closed-form expressions for the entropic IGW and its unbalanced variant between Gaussian distributions.

Batch normalization with regularization turns deterministic autoencoders into generative models.

problem Creating generative models from deterministic autoencoders.
method Using batch normalization as a source of non-determinism and adding entropic regularization.
result Deterministic autoencoders can be transformed into generative models with similar performance to variational autoencoders.

The paper analyzes stability and convergence rates of entropic and Sinkhorn potentials.

problem Stability and convergence rates of entropic and Sinkhorn potentials.
method Semiconcavity properties of entropic potentials and Schrödinger bridges.
result Exponential convergence rates for gradient and Hessian of Sinkhorn iterates.

We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method compares favorably with the more commonly used Sinkhorn--Knopp algorithm for small reg…

2017-10-18abs ↗pdf ↗

We derive an algorithm that achieves the optimal (within constants) pseudo-regret in both adversarial and stochastic multi-armed bandits without prior knowledge of the regime and time horizon. The algorithm is based on online mirror descent (OMD) with Tsallis entropy regularization with power α=1/2α=1/2 and reduced-varian…

2018-07-19abs ↗pdf ↗

DRAG decreases regularization to accelerate semi-discrete OT convergence.

problem Mitigating bias in semi-discrete OT problems with entropic regularization.
method DRAG: Decreasing Regularization Averaged Gradient, a stochastic gradient descent algorithm.
result DRAG achieves unbiased O(1/t)\mathcal{O}(1/t) sample and iteration complexity for OT cost and potential estimation, and O(1/t)\mathcal{O}(1/\sqrt{t}) rate for OT map.

Improves policy optimization with polylog(T) regret bounds for stochastic losses.

problem Improves theoretical guarantees for policy optimization in stochastic settings.
method Leverages Tsallis and Shannon entropy regularizers for polylog(T) regret, and log-barrier regularizer for adversarial settings.
result Achieves a first-order polylog(T) regret bound for policy optimization in stochastic settings.

New method corrects bias in estimating entropic risk for better decision-making.

problem Underestimation of entropic risk when data are limited.
method Parametric bootstrap procedure to overestimate entropic risk.
result Corrected method provides better risk estimates, leading to improved decision-making.

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.

New algorithm improves OT map estimation for semi-discrete settings.

problem Improving estimation of OT maps in semi-discrete settings.
method Stochastic Gradient Descent with adaptive entropic regularization and averaging acceleration.
result Achieves nearly minimax rate of O(t1)\mathcal{O}(t^{-1}) for OT map estimation.

New algorithm for computing Wasserstein barycenters with guarantees.

problem Computing Wasserstein barycenters with varying regularization strengths.
method Damped Sinkhorn iterations followed by exact maximization/minimization steps.
result First non-asymptotic convergence guarantees for approximating Wasserstein barycenters.

Modified Bakry-Émery criterion inequality for Tsallis entropy monotonicity.

problem Establishing improved logarithmic Sobolev inequalities and monotonicity of Tsallis entropy.
method Proving a one-parameter family of weighted Bakry-Émery Γ2Γ_2 criterion inequalities and a modified inequality.
result Yields a family of sharp Sobolev inequalities and monotonicity of Tsallis entropy.

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 construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal decision trees. ID3, C4.5 and CART are classical decision tree algorithms and the split criteria they…

2015-11-25abs ↗pdf ↗

Accelerates optimal transport computation by 10x with spectral insights.

problem Exponential slow-down of convergence in Entropic Optimal Transport as regularization weakens.
method Spectral insights and spectral warm-start strategy to mitigate convergence issues.
result Faster convergence compared to the reference method Sinkhorn algorithm.

Regularized policies are robust to adversarial rewards.

problem Understanding the effects of regularization on policy exploration and robustness.
method Using Fenchel duality to derive the dual problem of the regularized RL objective, showing the optimal policy is robust to adversarial rewards.
result Regularized policies are optimal for a reinforcement learning problem under adversarial reward conditions.

New stability bounds for Sinkhorn's algorithm in entropic optimal transport.

problem Stability and convergence of Sinkhorn's algorithm for entropic optimal transport.
method Semiconcavity approach to analyze stability and convergence.
result Exponential convergence of Sinkhorn's algorithm under semiconcavity conditions.

This paper shows how to estimate distances in latent space of random graphs using entropic OT.

problem Estimating distances between groups of nodes in latent space of random graphs.
method Entropic Optimal Transport (OT) with stability results for perturbations of the cost matrix.
result Consistent estimation of entropic OT distances between groups of nodes in latent space.

Entropic regularization is quickly emerging as a new standard in optimal transport (OT). It enables to cast the OT computation as a differentiable and unconstrained convex optimization problem, which can be efficiently solved using the Sinkhorn algorithm. However, entropy keeps the transportation plan strictly positive…

2017-10-17abs ↗pdf ↗

This paper develops sparse alternatives to continuous distributions, including new types of Gaussians and attention mechanisms.

problem Creating flexible continuous distributions with varying support for machine learning applications.
method Defining ΩΩ-regularized prediction maps and Fenchel-Young losses for arbitrary domains, and deriving new types of Gaussians and attention mechanisms.
result Sparse alternatives to continuous distributions, including deformed exponential families and ββ-Gaussians, are introduced.