REVIEW 2 cited by
Which bits went where? Past and future transfer entropy decomposition with the information bottleneck
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Whether the system under study is a shoal of fish, a collection of neurons, or a set of interacting atmospheric and oceanic processes, transfer entropy measures the flow of information between time series and can detect possible causal relationships. Much like mutual information, transfer entropy is generally reported as a single value summarizing an amount of shared variation, yet a more fine-grained accounting might illuminate much about the processes under study. Here we propose to decompose transfer entropy and localize the bits of variation on both sides of information flow: that of the originating process's past and that of the receiving process's future. We employ the information bottleneck (IB) to compress the time series and identify the transferred entropy. We apply our method to decompose the transfer entropy in several synthetic recurrent processes and an experimental mouse dataset of concurrent behavioral and neural activity. Our approach highlights the nuanced dynamics within information flow, laying a foundation for future explorations into the intricate interplay of temporal processes in complex systems.
Forward citations
Cited by 2 Pith papers
-
InfoDPCCA: Information-Theoretic Dynamic Probabilistic Canonical Correlation Analysis
InfoDPCCA combines a dynamic probabilistic CCA model with an information-bottleneck objective so the shared latent state is trained to contain only the mutual information of the two sequences and still predict the nex...
-
Rethinking Spatio-Temporal Anomaly Detection: A Vision for Causality-Driven Cybersecurity
The paper is a position piece advocating causal graph learning as the basis for interpretable, drift-robust anomaly detection in cyber-physical systems, with a small comparison table as supporting evidence.
Discussion (0). Continue with ORCID to comment.