Download
Abstract

Transformers achieve superior performance on many tasks, but impose heavy compute and memory requirements during inference. This inference can be made more efficient by partitioning the process across multiple devices, which, in turn, requires compressing its intermediate representations. We study compressibility of transformer’s intermediate representations via learned compression through the lens of rate-distortion and the theory of usable information. Our study reveals that, unlike convolutional models, deeper representations in transformers become more difficult to compress. The reason for this behavior is twofold: first, the complexity of representation increases as we move deeper into the transformer, necessitating a higher rate; and second, the higher complexity of representations worsens the generaliztion bound for learned entropy estimates, which further compromises compression performance. Through a combination of experiments and theory, we characterize and analyze the compressibility of transformer representations, derive bounds on the achievable rate of learned codecs applied to these representations, and offer a unified lens for understanding rate-distortion performance in representation coding.

Citation

Anderson de Andrade, Alon Harell, & Ivan V. Bajić. (2026). “Understanding rate-distortion performance in distributed transformer inference.” arXiv:2601.22002.

@article{DBLP:journals/corr/abs-2601-22002,
  author       = {Anderson de Andrade and
                  Alon Harell and
                  Ivan V. Bajic},
  title        = {Understanding rate-distortion performance in distributed transformer inference},
  journal      = {CoRR},
  volume       = {abs/2601.22002},
  year         = {2026},
  url          = {https://doi.org/10.48550/arXiv.2601.22002},
  doi          = {10.48550/ARXIV.2601.22002},
  eprinttype   = {arXiv},
  eprint       = {2601.22002},
  timestamp    = {Thu, 26 Feb 2026 09:55:42 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2601-22002.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}