[2604.10758] Investing Is Compression

-->

Computer Science > Computational Engineering, Finance, and Science

arXiv:2604.10758 (cs)

[Submitted on 12 Apr 2026 (v1), last revised 15 Apr 2026 (this version, v3)]

Title:Investing Is Compression

Authors:Oscar Stiffelman<br>View a PDF of the paper titled Investing Is Compression, by Oscar Stiffelman

View PDF<br>HTML (experimental)

Abstract:In 1956 John Kelly wrote a paper at Bell Labs describing the relationship between gambling and Information Theory. What came to be known as the Kelly Criterion is both an objective and a closed-form solution to sizing wagers when odds and edge are known. Samuelson argued it was arbitrary and subjective, and successfully kept it out of mainstream economics. Luckily it lived on in computer science, mostly because of Tom Cover's work at Stanford. He showed that it is the uniquely optimal way to invest: it maximizes long-term wealth, minimizes the risk of ruin, and is competitively optimal in a game-theoretic sense, even over the short term.

One of Cover's most surprising contributions to portfolio theory was the universal portfolio. Related to universal compression in information theory, it performs asymptotically as well as the best constant-rebalanced portfolio in hindsight. I borrow a trick from that algorithm to show that Kelly's objective, even in the general form, factors the investing problem into three terms: a money term, an entropy term, and a divergence term. The only way to maximize growth is to minimize divergence which measures the difference between our distribution and the true distribution in bits. Investing is, fundamentally, a compression problem.

This decomposition also yields new practical results. Because the money and entropy terms are constant across strategies in a given backtest, the difference in log growth between two strategies measures their relative divergence in bits. I also introduce a winner fraction heuristic which allocates capital in proportion to each asset's probability of dominating the candidate set. The growth shortfall of this heuristic relative to the optimal portfolio is bounded by the entropy of the winner fraction distribution. To my knowledge, both the heuristic and the entropy bound are original contributions.

Subjects:

Computational Engineering, Finance, and Science (cs.CE); Portfolio Management (q-fin.PM)

Cite as:<br>arXiv:2604.10758 [cs.CE]

(or<br>arXiv:2604.10758v3 [cs.CE] for this version)

https://doi.org/10.48550/arXiv.2604.10758

Focus to learn more

arXiv-issued DOI via DataCite

Submission history<br>From: Oscar Stiffelman [view email]<br>[v1]<br>Sun, 12 Apr 2026 17:56:53 UTC (15 KB)

[v2]<br>Tue, 14 Apr 2026 14:13:57 UTC (15 KB)

[v3]<br>Wed, 15 Apr 2026 03:54:44 UTC (15 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled Investing Is Compression, by Oscar Stiffelman<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.CE

next >

new<br>recent<br>| 2026-04

Change to browse by:

cs<br>q-fin<br>q-fin.PM

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)