Pareto-optimal data compression for binary classification tasks

v1v2 (latest)

Pareto-optimal data compression for binary classification tasks

23 August 2019

ArXiv (abs)PDF HTML

Papers citing "Pareto-optimal data compression for binary classification tasks"

5 / 5 papers shown

Title
Understanding Encoder-Decoder Structures in Machine Learning Using Information Measures Jorge F. Silva Victor Faraggi Camilo Ramírez Álvaro F. Egaña Eduardo Pavez 54 1 0 30 May 2024
Pareto-optimal clustering with the primal deterministic information bottleneck Andrew K. Tan Max Tegmark I. Chuang 21 3 0 05 Apr 2022
Studying the Interplay between Information Loss and Operation Loss in Representations for Classification Jorge F. Silva Felipe A. Tobar Mario L. Vicuna Felipe Cordova 44 2 0 30 Dec 2021
Intelligence, physics and information -- the tradeoff between accuracy and simplicity in machine learning Tailin Wu 121 1 0 11 Jan 2020
Phase Transitions for the Information Bottleneck in Representation Learning Tailin Wu Ian S. Fischer DRL 80 29 0 07 Jan 2020