The fundamental thermodynamic bounds on finite models
Andrew J. P. Garner

TL;DR
This paper establishes thermodynamic bounds on finite models that produce or predict patterns, linking dissipation to unmanifested historical information in the model's memory, and proposes models that can minimize this dissipation.
Contribution
It derives fundamental thermodynamic bounds for finite pattern models and introduces constructions to minimize dissipation by managing historical information.
Findings
Dissipation is proportional to unmanifested historical information.
Models can be constructed to reduce dissipation to zero.
Finite models can serve as thermodynamically consistent information reservoirs.
Abstract
The minimum heat cost of computation is subject to bounds arising from Landauer's principle. Here, I derive bounds on finite modelling -- the production or anticipation of patterns (time-series data) -- by devices that model the pattern in a piecewise manner and are equipped with a finite amount of memory. When producing a pattern, I show that the minimum dissipation is proportional to the information in the model's memory about the pattern's history that never manifests in the device's future behaviour and must be expunged from memory. I provide a general construction of model that allow this dissipation to be reduced to zero. By also considering devices that consume, or effect arbitrary changes on a pattern, I discuss how these finite models can form an information reservoir framework consistent with the second law of thermodynamics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
