Cargando…
Information Bottleneck Analysis by a Conditional Mutual Information Bound
Task-nuisance decomposition describes why the information bottleneck loss [Formula: see text] is a suitable objective for supervised learning. The true category y is predicted for input x using latent variables z. When n is a nuisance independent from y, [Formula: see text] can be decreased by reduc...
Autores principales: | Tezuka, Taro, Namekawa, Shizuma |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8391358/ https://www.ncbi.nlm.nih.gov/pubmed/34441114 http://dx.doi.org/10.3390/e23080974 |
Ejemplares similares
-
Mutual Information Rate and Bounds for It
por: Baptista, Murilo S., et al.
Publicado: (2012) -
A Comparison of Variational Bounds for the Information Bottleneck Functional
por: Geiger, Bernhard C., et al.
Publicado: (2020) -
On the Difference between the Information Bottleneck and the Deep Information Bottleneck
por: Wieczorek, Aleksander, et al.
Publicado: (2020) -
Learnability for the Information Bottleneck
por: Wu, Tailin, et al.
Publicado: (2019) -
Nonlinear Information Bottleneck
por: Kolchinsky, Artemy, et al.
Publicado: (2019)