ERFit identifies dynamic equations from data with minimal supervision.
problem Data-driven sparse system identification in science and engineering.
method Entropic Regression method.
result ERFit package simplifies sparse system identification for various applications.
ERDMD discovers sparse, nonuniformly timed DMD models from chaotic attractors.
problem Discovering high-fidelity, nonuniformly timed DMD models from chaotic data.
method Entropic regression for nonlinear information flow detection, combined with multi-step DMD.
result ERDMD produces highly efficient and robust models with minimal complexity.
Introduces entropic tribrackets and their applications in link distinguishing.
problem Distinguishing links with the same counting invariant.
method Definition and study of entropic tribrackets and their homsets.
result Homsets of entropic tribrackets form new entropic tribrackets.
We define link and graph invariants from entropic magmas modeling them on the Kauffman bracket and Tutte polynomial. We define the homology of entropic magmas. We also consider groups that can be assigned to the families of compatible entropic magmas.
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.
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.
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.
Entropic herding generates smooth distributions for probabilistic modeling.
problem Generating smooth distributions for probabilistic modeling.
method Derives entropic herding as optimization of maximum entropy principle.
result Entropic herding generates smoother distributions than original herding.
The paper explains emergent phenomena in deep learning using entropic forces.
problem Understanding the cause of emergent phenomena in deep learning and large language models.
method Proposes a rigorous entropic-force theory for neural networks trained with SGD and variants.
result Shows that representation learning is governed by emergent entropic forces that break continuous symmetries and preserve discrete ones.
The paper studies convergence rates of Tsallis entropic regularization in optimal transport.
problem Optimal transport with regularization.
method Γ-convergence and quantization/shadow arguments.
result Derives convergence rate of Tsallis entropic regularization.
Paper generalizes Bakry-Émery calculus for curvature and applies to Markov chains.
problem Formulating both Bakry-Émery and entropic curvature simultaneously.
method Generalization of Bakry-Émery calculus, new measure optimality criterion, dimension parameter in entropic curvature.
result Diameter estimates for Markov chains with strictly positive entropic curvature and spectral gap.
Paper explores entropic curvature in Markov chains, comparing it to other curvatures.
problem Comparing entropic curvature to other curvatures in Markov chains.
method Adapted Γ-calculus for θ-curvatures, explicit lower bounds, curvature perturbation.
result Entropic curvature differs significantly from other curvature notions.
ERTS uses Thompson sampling for Gaussian entropic risk bandits, achieving regret bounds.
problem Risk in decision making complicates reward maximization in MAB problems.
method ERTS (Entropic Risk Thompson Sampling) using Thompson sampling with an entropic risk measure.
result Regret bounds for ERTS under entropic risk measure provided.
An Entropic Dynamics of exchange rates is laid down to model the dynamics of foreign exchange rates, FX, and European Options on FX. The main objective is to represent an alternative framework to model dynamics. Entropic inference is an inductive inference framework equipped with proper tools to handle situations where…
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.
Researchers calculated EVaR for various distributions using Lambert function.
problem Difficulty in finding analytical representation of EVaR measure.
method Used Lambert function to calculate EVaR for multiple distributions.
result Successfully calculated EVaR for 7 specific distributions.
Efficiently computes optimal policies for Entropic Risk Measures.
problem Optimizing risk-sensitive metrics in MDPs is computationally expensive.
method Uses Entropic Risk Measures and novel structural analysis for efficient computation.
result Achieves strong performance in various decision-making scenarios.
Efficiently estimates optimal transport maps with rigorous guarantees.
problem Estimating optimal transport maps between distributions efficiently.
method Entropic version of Brenier's theorem, Sinkhorn's algorithm.
result Estimator is parallelizable and efficient for massive data sets.
New risk measures incorporate economic states to assess crude oil derivatives.
problem Assessing risk in crude oil derivatives with varying economic conditions.
method Introduced regime switching entropic risk measures using Markov chains.
result Closed formulae for risk measures derived, showing term structure and mean-reverting convenience yield.
The paper connects tempering and entropic mirror descent for sampling.
problem Sampling from a target distribution with known unnormalized density.
method Establishes the connection between tempering SMC and entropic mirror descent, deriving convergence rates and geometric insights.
result Tempering SMC iterates correspond to entropic mirror descent on the reverse KL divergence, providing new optimization perspectives.
Paper proposes a new method to solve Schrödinger Bridge Problem using kernel regression.
problem Schrödinger Bridge Problem in the context of entropic optimal transport.
method Forward-reverse iterative Monte Carlo procedure using kernel regression.
result Developed a provably convergent algorithm for approximating Schrödinger potentials.
We prove several fundamental statistical bounds for entropic OT with the squared Euclidean cost between subgaussian probability measures in arbitrary dimension. First, through a new sample complexity result we establish the rate of convergence of entropic OT for empirical measures. Our analysis improves exponentially o…
In this paper, we obtain fundamental Lp bounds in sequential prediction and recursive algorithms via an entropic analysis. Both classes of problems are examined by investigating the underlying entropic relationships of the data and/or noises involved, and the derived lower bounds may all be quantified in…
Using elements from the theory of ergodic backward stochastic differential equations (BSDE), we study the behavior of forward entropic risk measures. We provide their general representation results (via both BSDE and convex duality) and examine their behavior for risk positions of long maturities. We show that forward …
The paper improves convergence for linear systems using entropic mirror descent with Polyak stepsizes.
problem Convergence analysis for linear systems with unbounded domain.
method Entropic mirror descent with Polyak stepsizes, sublinear and linear convergence results.
result Generalized convergence result for arbitrary convex functions.
In this paper, we present a new class of Markov decision processes (MDPs), called Tsallis MDPs, with Tsallis entropy maximization, which generalizes existing maximum entropy reinforcement learning (RL). A Tsallis MDP provides a unified framework for the original RL problem and RL with various types of entropy, includin…
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.
Solving linear programs by using entropic penalization has recently attracted new interest in the optimization community, since this strategy forms the basis for the fastest-known algorithms for the optimal transport problem, with many applications in modern large-scale machine learning. Crucial to these applications h…
Unified framework for optimal transport on curved spaces using neural potentials.
problem Optimal transport on curved Riemannian manifolds.
method Entropic RNOT combines entropic regularization with neural pullback parameterization.
result Unified framework recovers entropic optimal coupling in strong probabilistic metrics.
Paper proposes risk-averse reinforcement learning algorithms.
problem Managing model uncertainty in reinforcement learning.
method Entropic risk constrained policy gradient and actor-critic algorithms.
result Demonstrates usefulness of risk-averse algorithms on various domains.
Simplified explanation of ML for mixtures and OT.
problem Maximum likelihood estimation for mixture models.
method Optimal transport with entropic regularization.
result EM algorithm is a block-coordinate descent on OT loss.
Novel algorithms for entropic optimal transport from an optimisation perspective.
problem Solving the entropic-regularised optimal transport problem.
method Developed novel methods inspired by mirror descent, solving semi-dual problems or non-convex constrained problems over joint distributions.
result Non-asymptotic rates of convergence for the proposed methods under minimal assumptions.
Neural networks' optimization dynamics are confined to a single basin despite connected basins in the loss landscape.
problem Neural networks' optimization dynamics are confined to a single basin despite connected basins in the loss landscape.
method Identifying entropic barriers arising from the interplay between curvature variations along low-loss paths and noise in optimization dynamics.
result Curvature-induced entropic forces bias noisy dynamics back toward the endpoints, explaining the confinement and connectivity of solutions.
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.
The paper mentioned in the title introduces the entropic value at risk. I give some extra comments and using the general theory make a relation with some commonotone risk measures.
The Sinkhorn-Knopp derivatives converge with linear rate.
problem Optimal transport problem with entropic regularization.
method Iterative proportional fitting procedure.
result Derivatives converge with linear rate.
Intertwining curvature bounds for graphs and quantum Markov semigroups verified.
problem Intertwining curvature bounds for graphs and quantum Markov semigroups.
method Introducing and verifying curvature bounds in various examples.
result Improved entropic curvature bounds for depolarizing semigroups and qubits.
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.
Proposes a method to generate counterfactuals for ensemble models using entropic risk measures.
problem Finding a single counterfactual explanation for an ensemble of models.
method Incorporates entropic risk measure into a constrained optimization to generate counterfactuals valid for an adjustable fraction of models.
result Entropic risk measure allows generation of counterfactuals valid for all models in the ensemble under a limiting case.
An equivalent definition of entropic Ricci curvature on discrete spaces was given in terms of the global gradient estimate. With a particular choice of the density function ρ, we obtain a localized gradient estimate, which in turns allow us to derive a Bonnet-Myers type diameter bound for graphs with positive entropi…
We introduce the entropic measure transform (EMT) problem for a general process and prove the existence of a unique optimal measure characterizing the solution. The density process of the optimal measure is characterized using a semimartingale BSDE under general conditions. The EMT is used to reinterpret the conditiona…
Dropout has recently emerged as a powerful and simple method for training neural networks preventing co-adaptation by stochastically omitting neurons. Dropout is currently not grounded in explicit modelling assumptions which so far has precluded its adoption in Bayesian modelling. Using Bayesian entropic reasoning we s…
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.
Quantification of the stationary points and the associated basins of attraction of neural network loss surfaces is an important step towards a better understanding of neural network loss surfaces at large. This work proposes a novel method to visualise basins of attraction together with the associated stationary points…
Estimates conditional Brenier maps using entropic optimal transport.
problem Non-parametric estimation of conditional Brenier maps.
method Entropic optimal transport for scalable non-parametric estimation.
result Entropic optimal transport maps asymptotically converge to conditional Brenier maps.
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…
New algorithm ATENT improves adversarial robustness in neural networks.
problem Improving neural network robustness against adversarial attacks.
method Proposes a new loss function with entropic regularization for training robust neural networks.
result ATENT achieves competitive robust classification accuracy on benchmark datasets.
New method improves approximate inference for Bayesian models.
problem Approximate inference for high-dimensional Bayesian models.
method Entropic regularization of mean-field variational inference.
result Improved recovery of true posterior dependency.