The Convex Information Bottleneck Lagrangian

The information bottleneck (IB) problem tackles the issue of obtaining relevant compressed representations T of some random variable X for the task of predicting Y. It is defined as a constrained optimization problem that maximizes the information the representation has about the task, [Formula: see...

Descripción completa

Detalles Bibliográficos
Autores principales: Rodríguez Gálvez, Borja, Thobaben, Ragnar, Skoglund, Mikael
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7516537/
https://www.ncbi.nlm.nih.gov/pubmed/33285873
http://dx.doi.org/10.3390/e22010098

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7516537/
https://www.ncbi.nlm.nih.gov/pubmed/33285873
http://dx.doi.org/10.3390/e22010098

Ejemplares similares