Pith. sign in

REVIEW 2 cited by

Thermodynamic cost and benefit of memory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1705.00612 v3 pith:VOOJZX7Z submitted 2017-04-29 cond-mat.stat-mech

classification cond-mat.stat-mech
keywords informationefficiencypredictivebounddataderiveddissipationinference
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This letter exposes a tight connection between the thermodynamic efficiency of information processing and predictive inference. A generalized lower bound on dissipation is derived for partially observable information engines which are allowed to use temperature differences. It is shown that the retention of irrelevant information limits efficiency. A data representation strategy is derived from optimizing a fundamental physical limit to information processing: minimizing the lower bound on dissipation leads to a data compression method that maximally retains relevant, predictive, information. In that sense, predictive inference emerges as the strategy that least precludes energy efficiency.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Thermodynamics of Learning: A Typed Four-Component Accounting of Memory, Fit, and Value

    cond-mat.stat-mech 2026-08 conditional novelty 7.0 of 10

    A typed accounting separates record correlation from operational capital value in finite learning devices, with separation, capitalization-efficiency, and value-retention theorems.

  2. Pareto-optimal data compression for binary classification tasks

    cs.LG 2019-08 conditional novelty 4.0 of 10

    For binary classification, the optimal tradeoff curve between stored bits and class information is achieved by binning the posterior class probability into contiguous intervals.

Pith tools