Copertina

Which bits went where? Past and future transfer entropy decomposition with the information bottleneck

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Murphy, Kieran A., Yin, Zhuowen, Bassett, Dani S.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Information Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Machine-learning optimized measurements of chaotic dynamical systems via the information bottleneck
di: Murphy, Kieran A., et al.
Pubblicazione: (2023)

Information decomposition in complex systems via machine learning
di: Murphy, Kieran A., et al.
Pubblicazione: (2023)

Surveying the space of descriptions of a composite system with machine learning
di: Murphy, Kieran A., et al.
Pubblicazione: (2024)

Partial information decomposition: redundancy as information bottleneck
di: Kolchinsky, Artemy
Pubblicazione: (2024)

Comparing the information content of probabilistic representation spaces
di: Murphy, Kieran A., et al.
Pubblicazione: (2024)

Towards understanding neural collapse in supervised contrastive learning with the information bottleneck method
di: Wang, Siwei, et al.
Pubblicazione: (2023)

InfoChess: A Game of Adversarial Inference and a Laboratory for Quantifiable Information Control
di: Murphy, Kieran A.
Pubblicazione: (2026)

Data efficiency, dimensionality reduction, and the generalized symmetric information bottleneck
di: Martini, K. Michael, et al.
Pubblicazione: (2023)

Quantile Multi-Armed Bandits with 1-bit Feedback
di: Lau, Ivan, et al.
Pubblicazione: (2025)

Price of universality in vector quantization is at most 0.11 bit
di: Harbuzova, Alina, et al.
Pubblicazione: (2026)

A discrete Benamou-Brenier formulation of Optimal Transport on graphs
di: Morris, Kieran, et al.
Pubblicazione: (2026)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
di: Lau, Ivan, et al.
Pubblicazione: (2025)

Higher order definition of causality by optimally conditioned transfer entropy
di: Kořenek, Jakub, et al.
Pubblicazione: (2024)

Which Similarity-Sensitive Entropy (Sentropy)?
di: Nguyen, Phuc, et al.
Pubblicazione: (2025)

Distributional Information Embedding: A Framework for Multi-bit Watermarking
di: He, Haiyun, et al.
Pubblicazione: (2025)

Haiku to Opus in Just 10 bits: LLMs Unlock Massive Compression Gains
di: Rinberg, Roy, et al.
Pubblicazione: (2026)

Estimation of discrete distributions in relative entropy, and the deviations of the missing mass
di: Mourtada, Jaouad
Pubblicazione: (2025)

Quantum Fisher information matrices from Rényi relative entropies
di: Wilde, Mark M.
Pubblicazione: (2025)

From independent patches to coordinated attention: Controlling information flow in vision transformers
di: Murphy, Kieran A.
Pubblicazione: (2026)

Overfitting has a limitation: a model-independent generalization gap bound based on Rényi entropy
di: Suzuki, Atsushi, et al.
Pubblicazione: (2025)

Approximating mutual information of high-dimensional variables using learned representations
di: Gowri, Gokul, et al.
Pubblicazione: (2024)

Interpretable Diffusion via Information Decomposition
di: Kong, Xianghao, et al.
Pubblicazione: (2023)

The augmented NLP bound for maximum-entropy remote sampling
di: Ponte, Gabriel, et al.
Pubblicazione: (2026)

WaterSIC: information-theoretically (near) optimal linear layer quantization
di: Lifar, Egor, et al.
Pubblicazione: (2026)

A series of maximum entropy upper bounds of the differential entropy
di: Nielsen, Frank, et al.
Pubblicazione: (2016)

Sample efficient inductive matrix completion with noise and inexact side information
di: Yang, Yuepeng, et al.
Pubblicazione: (2026)

Maximum entropy based testing in network models: ERGMs and constrained optimization
di: Ghosh, Subhro, et al.
Pubblicazione: (2026)

A new pathway to generative artificial intelligence by minimizing the maximum entropy
di: Miotto, Mattia, et al.
Pubblicazione: (2025)

Shannon invariants: A scalable approach to information decomposition
di: Gutknecht, Aaron J., et al.
Pubblicazione: (2025)

Providing Differential Privacy for Federated Learning Over Wireless: A Cross-layer Framework
di: Mao, Jiayu, et al.
Pubblicazione: (2024)

An efficient search-and-score algorithm for ancestral graphs using multivariate information scores
di: Lagrange, Nikita, et al.
Pubblicazione: (2024)

LZ Penalty: An information-theoretic repetition penalty for autoregressive language models
di: Ginart, Antonio A., et al.
Pubblicazione: (2025)

Estimating quantum relative entropies on quantum computers
di: Lu, Yuchen, et al.
Pubblicazione: (2025)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
di: Zhang, Kaihong, et al.
Pubblicazione: (2024)

Differentially-Private Collaborative Online Personalized Mean Estimation
di: Yakimenka, Yauhen, et al.
Pubblicazione: (2024)

Asymptotic evaluation of the information processing capacity in reservoir computing
di: Saito, Yohei
Pubblicazione: (2025)

Entropy-informed Decoding: Adaptive Information-Driven Branching
di: Evans, Benjamin Patrick, et al.
Pubblicazione: (2026)

Communication-Constrained Private Decentralized Online Personalized Mean Estimation
di: Yakimenka, Yauhen, et al.
Pubblicazione: (2025)

FAdam: Adam is a natural gradient optimizer using diagonal empirical Fisher information
di: Hwang, Dongseong
Pubblicazione: (2024)

Image selective encryption analysis using mutual information in CNN based embedding space
di: Messadi, Ikram, et al.
Pubblicazione: (2025)