The fundamental thermodynamic bounds on finite models
December 06, 2019 Β· Declared Dead Β· π Chaos
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Andrew J. P. Garner
arXiv ID
1912.03217
Category
cond-mat.stat-mech
Cross-listed
cs.IT,
nlin.CD
Citations
3
Venue
Chaos
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β cond-mat.stat-mech
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Unsupervised learning of phase transitions: from principal component analysis to variational autoencoders
π
π
Old Age
Unsupervised Generative Modeling Using Matrix Product States
R.I.P.
π»
Ghosted
Solving Statistical Mechanics Using Variational Autoregressive Networks
R.I.P.
π»
Ghosted
Learning Thermodynamics with Boltzmann Machines
R.I.P.
π»
Ghosted
Information Flows? A Critique of Transfer Entropies
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted