Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chaitanya Goswami

dblp:294/2414 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 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%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › information measures › information decomposition
partial information decomposition
0.812024
Analytically deriving Partial Information Decomposition for affine systems of stable and convolution-closed distributions · NeurIPS 2024
Information theory › probability theory › continuous distributions
stable distributions
0.812024
Analytically deriving Partial Information Decomposition for affine systems of stable and convolution-closed distributions · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
exponential family
0.212024
Analytically deriving Partial Information Decomposition for affine systems of stable and convolution-closed distributions · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

data thinning · 1.5data fission · 1.5analytical derivation · 1.5
YearPublicationVenuePosition
2024 Analytically deriving Partial Information Decomposition for affine systems of stable and convolution-closed distributions
abstract
Bivariate partial information decomposition (PID) has emerged as a promising tool for analyzing interactions in complex systems, particularly in neuroscience. PID achieves this by decomposing the information that two sources (e.g., different brain regions) have about a target (e.g., a stimulus) into unique, redundant, and synergistic terms. However, the computation of PID remains a challenging problem, often involving optimization over distributions. While several works have been proposed to compute PID terms numerically, there is a surprising dearth of work on computing PID terms analytically. The only known analytical PID result is for jointly Gaussian distributions. In this work, we present two theoretical advances that enable analytical calculation of the PID terms for numerous well-known distributions, including distributions relevant to neuroscience, such as Poisson, Cauchy, and binomial. Our first result generalizes the analytical Gaussian PID result to the much larger class of stable distributions. We also discover a theoretical link between PID and the emerging fields of data thinning and data fission. Our second result utilizes this link to derive analytical PID terms for two more classes of distributions: convolution-closed distributions and a sub-class of the exponential family. Furthermore, we provide an analytical upper bound for approximately calculating PID for convolution-closed distributions, whose tightness we demonstrate in simulation.
Chaitanya Goswami, Amanda Merkley
NeurIPS1