Demo Data from EDBT 2026 / reviewers in the wild / expert
Keenan J. A. Down
dblp:347/2896
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0006-3730-0295ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
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
1 paper |
Information theory · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › information measures › multiterminal information measures
common information |
1.0 | 1 | 2026 | A Logarithmic Decomposition and a Signed Measure Space for Entropy · IEEE Trans. Inf. Theory 2026 |
Information theory › information measures › entropy
shannon entropy |
1.0 | 1 | 2026 | A Logarithmic Decomposition and a Signed Measure Space for Entropy · IEEE Trans. Inf. Theory 2026 |
Information theory › estimation theory
sufficient statistics |
1.0 | 1 | 2026 | A Logarithmic Decomposition and a Signed Measure Space for Entropy · IEEE Trans. Inf. Theory 2026 |
Methods — techniques the papers use, named apart from their topics
logarithmic decomposition · 1.0i-measure extension · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Logarithmic Decomposition and a Signed Measure Space for EntropyabstractThe Shannon entropy behaves in many ways like a signed measure. Previous work has explored this connection by defining a signed measure on abstract sets, representing the information that different variables contain. This yields many measure-theoretic counterparts to information quantities such as the mutual information (set intersection), the joint entropy (set union), and the conditional entropy (set difference), but an explicit construction of the elements of these sets remains ambiguous. Here we provide a concrete characterisation of these abstract sets and a corresponding signed measure by extending Yeung’s I-measure to all possible outcomes in an outcome space Ω, and in doing so we demonstrate a much finer decomposition with intuitive properties that we call the logarithmic decomposition (LD). We show that this signed measure space has the useful property that its logarithmic atoms can be characterised as having negative or positive entropy (depending only on their structure), while being consistent with classical information quantities. Using this logarithmic decomposition, we re-examine the Gács-Körner common information, the functional common information, and minimally sufficient statistics from this new perspective and characterise them in terms of our logarithmic atoms—a property we call logarithmic decomposability. We present possible extensions of this construction to continuous probability distributions, before finally applying our new decomposition to the Dyadic and Triadic systems of James and Crutchfield as a motivating example. We show that, in contrast to the I-measure alone, our classically derived decomposition qualitatively distinguishes between them. Keenan J. A. Down, Pedro A. M. Mediano |
IEEE Trans. Inf. Theory | 1 |
| 2023 | A Logarithmic Decomposition for InformationabstractThe Shannon entropy of a random variable X has much behaviour analogous to a signed measure. Previous work has concretized this connection by defining a signed measure µ on an abstract information space $\tilde X$, which is taken to represent the information that X contains. This construction is sufficient to derive many measure-theoretical counterparts to information quantities such as the mutual information $I(X;Y) = \mu (\tilde X \cap \tilde Y)$, the joint entropy $H(X,Y) = \mu (\tilde X \cup \tilde Y)$, and the conditional entropy $H(X|Y) = \mu (\tilde X\backslash \tilde Y)$. We demonstrate that there exists a much finer decomposition with intuitive properties which we call the logarithmic decomposition (LD). We show that this signed measure space has the useful property that its logarithmic atoms are easily characterised with negative or positive entropy, while also being coherent with Yeung’s I-measure [14]. We present the usability of our approach by re-examining the Gács-Körner common information from this new geometric perspective and characterising it in terms of our logarithmic atoms. We then highlight that our geometric refinement can account for an entire class of information quantities, which we call logarithmically decomposable quantities. Keenan J. A. Down, Pedro A. M. Mediano |
ISIT | 1 |