Limits To (Machine) Learning

Zhimin Chen, Bryan Kelly, Semyon Malamud
12/14/2025
stat.MLcs.LG

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Machine learning (ML) methods are highly flexible, but their ability to approximate the true data-generating process is fundamentally constrained by finite samples. We characterize a universal lower bound, the Limits-to-Learning Gap (LLG), quantifying the unavoidable discrepancy between a model's empirical fit and the population benchmark. Recovering the true population $R^2$, therefore, requires correcting observed predictive performance by this bound. Using a broad set of variables, including excess returns, yields, credit spreads, and valuation ratios, we find that the implied LLGs are large. This indicates that standard ML approaches can substantially understate true predictability in financial data. We also derive LLG-based refinements to the classic Hansen and Jagannathan (1991) bounds, analyze implications for parameter learning in general-equilibrium settings, and show that the LLG provides a natural mechanism for generating excess volatility.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chen2025limits,
  title  = {Limits To (Machine) Learning},
  author = {Zhimin Chen and Bryan Kelly and Semyon Malamud},
  year   = {2025},
  eprint = {2512.12735},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.12735v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.12735.svg)](https://codeofpaper.com/paper/2512.12735)

Discussion