EDBT 2026 Demo / reviewers in the wild / expert
Yvik Swan
dblp:120/7520
· DBLP profile ↗
4ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0005-5956-7102ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Information theory · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › information measures › entropy
differential entropy |
0.8 | 1 | 2024 | Derivatives of Entropy and the MMSE Conjecture · IEEE Trans. Inf. Theory 2024 |
Information theory › information measures
entropy |
0.8 | 1 | 2024 | Derivatives of Entropy and the MMSE Conjecture · IEEE Trans. Inf. Theory 2024 |
Information theory › information measures
fisher information |
0.5 | 2 | 2018 | IT Formulae for Gamma Target: Mutual Information and Relative Entropy · IEEE Trans. Inf. Theory 2018 Local Pinsker Inequalities via Stein's Discrete Density Approach · IEEE Trans. Inf. Theory 2013 |
Information theory › information measures › divergence measures
kullback-leibler divergence |
0.5 | 2 | 2018 | IT Formulae for Gamma Target: Mutual Information and Relative Entropy · IEEE Trans. Inf. Theory 2018 Local Pinsker Inequalities via Stein's Discrete Density Approach · IEEE Trans. Inf. Theory 2013 |
Information theory › information measures
mutual information |
0.3 | 1 | 2018 | IT Formulae for Gamma Target: Mutual Information and Relative Entropy · IEEE Trans. Inf. Theory 2018 |
Information theory
information measures |
0.2 | 1 | 2013 | Local Pinsker Inequalities via Stein's Discrete Density Approach · IEEE Trans. Inf. Theory 2013 |
Information theory › information measures › divergence measures
pinsker inequality |
0.2 | 1 | 2013 | Local Pinsker Inequalities via Stein's Discrete Density Approach · IEEE Trans. Inf. Theory 2013 |
Methods — techniques the papers use, named apart from their topics
gamma-calculus · 0.8cumulant expansion · 0.8combinatorial analysis · 0.8stochastic representation · 0.3de bruijn identity · 0.3stein's method · 0.2covariance identity · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Derivatives of Entropy and the MMSE ConjectureabstractWe investigate the properties of the entropy of a probability measure along the heat flow and more precisely we seek for closed algebraic representations of its derivatives. Provided that the measure admits moments of any order, it has been proved in Guo et al. (2010) that this functional is smooth, and in Ledoux (2016) that its derivatives at zero can be expressed into multivariate polynomials evaluated in the moments (or cumulants) of the underlying measure. Moreover, these algebraic expressions are derived through$\Gamma $-calculus techniques which provide implicit recursive formulas for these polynomials. Our main contribution consists in a fine combinatorial analysis of these inductive relations and for the first time to derive closed formulas for the leading coefficients of these polynomials expressions. Building upon these explicit formulas we revisit the so-called “MMSE conjecture” from Ledoux (2016) which asserts that two distributions on the real line with the same entropy along the heat flow must coincide up to translation and symmetry. Our approach enables us to provide new conditions on the source distributions ensuring that the MMSE conjecture holds and to refine several criteria proved in Ledoux (2016). As illustrating examples, our findings cover the cases of uniform and Rademacher distributions, for which previous results in the literature were inapplicable. Paul Mansanarez, Guillaume Poly, Yvik Swan |
IEEE Trans. Inf. Theory | 3 |
| 2018 | IT Formulae for Gamma Target: Mutual Information and Relative EntropyabstractIn this paper, we introduce new Stein identities for gamma target distribution as well as a new non-linear channel specifically designed for gamma inputs. From these two ingredients, we derive an explicit and simple formula for the derivative of the input-output mutual information of this non-linear channel with respect to the channel quality parameter. This relation is reminiscent of the well-known link between the derivative of the input-output mutual information of additive Gaussian noise channel with respect to the signal-to-noise ratio and the minimum mean-square error. The proof relies on a rescaled version of De Bruijn identity for gamma target distribution together with a stochastic representation for the gamma-specific Fisher information. Finally, we are able to derive precise bounds and asymptotics for the input-output mutual information of the non-linear channel with gamma inputs. Benjamin Arras, Yvik Swan |
IEEE Trans. Inf. Theory | 2 |
| 2014 | Integration by parts and representation of information functionalsabstractWe introduce a new formalism for computing expectations of functionals of arbitrary random vectors, by using generalised integration by parts formulae. In doing so we extend recent representation formulae for the score function introduced in [19] and also provide a new proof of a central identity first discovered in [7]. We derive a representation for the standardised Fisher information of sums of i.i.d. random vectors which we use to provide rates of convergence in information theoretic central limit theorems (both in Fisher information distance and in relative entropy) and a Stein bound for Fisher information distance. Ivan Nourdin, Giovanni Peccati, Yvik Swan |
ISIT | 3 |
| 2013 | Local Pinsker Inequalities via Stein's Discrete Density ApproachabstractPinsker's inequality states that the relative entropy between two random variables X and Y dominates the square of the total variation distance between X and Y. In this paper, we introduce generalized Fisher information distances and prove that these also dominate the square of the total variation distance. To this end, we introduce a general discrete Stein operator for which we prove a useful covariance identity. We illustrate our approach with several examples. Whenever competitor inequalities are available in the literature, the constants in ours are at least as good, and, in several cases, better. Christophe Ley, Yvik Swan |
IEEE Trans. Inf. Theory | 2 |