ResearchTrend.AI
Pareto-optimal data compression for binary classification tasks
v1v2 (latest)

Pareto-optimal data compression for binary classification tasks

Max Tegmark
Tailin Wu
ArXiv (abs)PDFHTML

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