HackerPapers

arXiv:2106.10800cs.LG

Lossy Compression for Lossless Prediction

Yann Dubois, Benjamin Bloem-Reddy, Karen Ullrich, Chris J. Maddison

Abstract

Most data is automatically collected and only ever "seen" by algorithms. Yet, data compressors preserve perceptual fidelity rather than just the information needed by algorithms performing downstream tasks. In this paper, we characterize the bit-rate required to ensure high performance on all predictive tasks that are invariant under a set of transformations, such as data augmentations. Based on our theory, we design unsupervised objectives for training neural compressors. Using these objectives, we train a generic image compressor that achieves substantial rate savings (more than $1000\times$ on ImageNet) compared to JPEG on 8 datasets, without decreasing downstream classification performance.

arXiv comments
Accepted at NeurIPS 2021
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.ITInformation Theory stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Jun 2021 to Apr 2022. Found in 1 HN submission from Jun 2021 to Jun 2021. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

  1. Silly Image Compression Idea 1 comment
    • While not exactly the idea in your post, this recent paper by Dubois, Bloem-Reddy, Ullrich, and Maddison on "Lossy Compression for Lossless Prediction" (https://arxiv.org/abs/2106.10800) kinda gets at this idea. From the abstract: Most data is automatically collected and only…

      marauder777View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.