相关论文: Convexity of mutual information along the Ornstein…
We present two extended forms of Fisher information that fit well in the context of nonextensive thermostatistics. We show that there exists an interplay between these generalized Fisher information, the generalized $q$-Gaussian…
We derive general upper bounds to pointwise mutual information in terms of stochastic Fisher information and show these bounds average to known results in the literature for bounds to mutual information in terms of Fisher information. These…
We study the Dyson-Ornstein-Uhlenbeck diffusion process, an evolving gas of interacting particles. Its invariant law is the beta Hermite ensemble of random matrix theory, a non-product log-concave distribution. We explore the convergence to…
The Ornstein-Uhlenbeck process is interpreted as Brownian motion in a harmonic potential. This Gaussian Markov process has a bounded variance and admits a stationary probability distribution, in contrast to the standard Brownian motion. It…
We solve a physically significant extension of a classic problem in the theory of diffusion, namely the Ornstein-Uhlenbeck process [G. E. Ornstein and L. S. Uhlenbeck, Phys. Rev. 36, 823, (1930)]. Our generalised Ornstein-Uhlenbeck systems…
We explore an interplay between an analysis of diffusion flows such as Ornstein--Uhlenbeck flow and Fokker--Planck flow and inequalities from convex geometry regarding the volume product. More precisely, we introduce new types of…
We prove that the (square root) Fisher information functional is a strong Wasserstein upper gradient of the entropy on non-convex Riemannian domains. This fills a gap in the literature by allowing one to completely dispense from…
We construct a smooth, strictly positive, Gaussian-decaying density on $\mathbb{R}^2$ for which Fisher information along the heat flow is not log-convex. This disproves the Cheng--Geng log-convexity conjecture in dimension two and, by…
We study formal properties of smooth max-information, a generalization of von Neumann mutual information derived from the max-relative entropy. Recent work suggests that it is a useful quantity in one-shot channel coding, quantum rate…
We consider the area functional defined by the integral of an Ornstein-Uhlenbeck process which starts from a given value and ends at the time it first reaches zero (its equilibrium level). Exact results are presented for the mean, variance,…
In the past decade, J. Huh solved several long-standing open problems on log-concave sequences in combinatorics. The ground-breaking techniques developed in those work are from algebraic geometry: "We believe that behind any log-concave…
The sliced-Wasserstein flow is an evolution equation where a probability density evolves in time, advected by a velocity field computed as the average among directions in the unit sphere of the optimal transport displacements from its 1D…
We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…
We develop an information-theoretic perspective on some questions in convex geometry, providing for instance a new equipartition property for log-concave probability measures, some Gaussian comparison results for log-concave measures, an…
We prove new, general versions of Bernstein-von Mises theorem for both well-specified and misspecified models when the log-likelihood is concave in the parameter and the prior distribution is log-concave. Unlike classical versions of…
Mutual information $I(X;Y)$ is a useful definition in information theory to estimate how much information the random variable $Y$ holds about the random variable $X$. One way to define the mutual information is by comparing the joint…
Mutual information is widely used, in a descriptive way, to measure the stochastic dependence of categorical random variables. In order to address questions such as the reliability of the descriptive value, one must consider…
We introduce a framework for Newton's flows in probability space with information metrics, named information Newton's flows. Here two information metrics are considered, including both the Fisher-Rao metric and the Wasserstein-2 metric. A…
In this note we analyze the Almgren-Taylor-Wang scheme for mean curvature flow in the case of mean convex initial conditions. We show that the scheme preserves strict mean convexity and, by compensated compactness techniques, that the…
We study the problem of sampling from a distribution $\target$ using the Langevin Monte Carlo algorithm and provide rate of convergences for this algorithm in terms of Wasserstein distance of order $2$. Our result holds as long as the…