English
Related papers

Related papers: Properties of the Strong Data Processing Constant …

200 papers

In this paper we provide a new inequality useful for the proofs of strong converse theorems in the multiterminal information theory. We apply this inequality to the recent work by Tyagi and Watanabe on the strong converse theorem for the…

Information Theory · Computer Science 2019-01-18 Yasutada Oohama

Tight bounds for several symmetric divergence measures are introduced, given in terms of the total variation distance. Each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these bounds…

Information Theory · Computer Science 2016-11-15 Igal Sason

Stochastic gradient descent (SGD) is a promising numerical method for solving large-scale inverse problems. However, its theoretical properties remain largely underexplored in the lens of classical regularization theory. In this note, we…

Numerical Analysis · Mathematics 2020-07-22 Tim Jahn , Bangti Jin

The Pearcey process is a universal point process in random matrix theory and depends on a parameter $\rho \in \mathbb{R}$. Let $N(x)$ be the random variable that counts the number of points in this process that fall in the interval…

Probability · Mathematics 2021-05-06 Christophe Charlier

Characterizing the differential privacy (DP) of learning algorithms has become a major challenge in recent years. In parallel, many studies suggested investigating the behavior of stochastic gradient descent (SGD) with heavy-tailed noise,…

Machine Learning · Statistics 2025-11-20 Benjamin Dupuis , Mert Gürbüzbalaban , Umut Şimşekli , Jian Wang , Sinan Yildirim , Lingjiong Zhu

We study the universal scaling limit of random partitions obeying the Schur measure. Extending our previous analysis [arXiv:2012.06424], we obtain the higher-order Pearcey kernel describing the multi-critical behavior in the cusp scaling…

Mathematical Physics · Physics 2024-02-06 Taro Kimura , Ali Zahabi

In this paper, we study the approximation and estimation of $s$-concave densities via R\'enyi divergence. We first show that the approximation of a probability measure $Q$ by an $s$-concave densities exists and is unique via the procedure…

Statistics Theory · Mathematics 2015-10-23 Qiyang Han , Jon A. Wellner

Statistical data depth plays an important role in the analysis of multivariate data sets. The main outcome is a center-outward ordering of the observations that can be used both to highlight features of the underlying distribution of the…

Statistics Theory · Mathematics 2026-03-11 Giacomo Francisci , Claudio Agostinelli

Existing polarization theories have mostly been concerned with Shannon's information measures, such as Shannon entropy and mutual information, and some related measures such as the Bhattacharyya parameter. In this work, we extend…

Information Theory · Computer Science 2019-07-16 Mengfan Zheng , Ling Liu , Cong Ling

Recent works have shown that high probability metrics with stochastic gradient descent (SGD) exhibit informativeness and in some cases advantage over the commonly adopted mean-square error-based ones. In this work we provide a formal…

Machine Learning · Computer Science 2022-11-03 Dragana Bajovic , Dusan Jakovetic , Soummya Kar

Data processing lower bounds on the expected distortion are derived in the finite-alphabet semi-deterministic setting, where the source produces a deterministic, individual sequence, but the channel model is probabilistic, and the decoder…

Information Theory · Computer Science 2016-11-17 Neri Merhav

The time-dependent diffusion spreadability $\mathcal{S}(t)$ is a powerful dynamical probe of the microstructure of two-phase heterogeneous media across length scales [Torquato, S., \emph{Phys. Rev. E.}, 104 054102 (2021)]. It has been shown…

Materials Science · Physics 2026-02-23 Shaobing Yuan , Salvatore Torquato

Denote by $A$ the adjacency matrix of an Erdos-Renyi graph with bounded average degree. We consider the problem of maximizing $\langle A-E\{A\},X\rangle$ over the set of positive semidefinite matrices $X$ with diagonal entries $X_{ii}=1$.…

Discrete Mathematics · Computer Science 2015-12-25 Andrea Montanari , Subhabrata Sen

In this paper, we consider the problem of computing the barycenter of a set of probability distributions under the Sinkhorn divergence. This problem has recently found applications across various domains, including graphics, learning, and…

Machine Learning · Computer Science 2020-07-22 Zebang Shen , Zhenfu Wang , Alejandro Ribeiro , Hamed Hassani

This paper gives improved R\'{e}nyi entropy power inequalities (R-EPIs). Consider a sum $S_n = \sum_{k=1}^n X_k$ of $n$ independent continuous random vectors taking values on $\mathbb{R}^d$, and let $\alpha \in [1, \infty]$. An R-EPI…

Information Theory · Computer Science 2016-07-21 Eshed Ram , Igal Sason

The inverse tangent function can be bounded by different inequalities, for example by Shafer's inequality. In this publication, we propose a new sharp double inequality, consisting of a lower and an upper bound, for the inverse tangent…

Information Theory · Computer Science 2013-07-19 Gholamreza Alirezaei

We present a unifying theme relating BPS partition functions and superconformal indices. In the case with complex SUSY central charges (as in N=2 in d=4 and N=(2,2) in d=2) the known results can be reinterpreted as the statement that the…

High Energy Physics - Theory · Physics 2015-12-22 Amer Iqbal , Cumrun Vafa

We present large deviations estimates in the supremum norm for a system of independent random walks superposed with a birth-and-death dynamics evolving on the discrete torus with $N$ sites. The scaling limit considered is the so-called…

Probability · Mathematics 2021-02-26 Tertuliano Franco , Luana A. Gurgel , Bernardo N. B. de Lima

We revisit generalized entropic formulations of the uncertainty principle for an arbitrary pair of quantum observables in two-dimensional Hilbert space. R\'enyi entropy is used as uncertainty measure associated with the distribution…

Quantum Physics · Physics 2014-06-23 Steeve Zozor , Gustavo Martín Bosyk , Mariela Portesi

A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an…

Quantum Physics · Physics 2026-04-01 Liuhang Ye , Bjarne Bergh , Nilanjana Datta