mlsanityData to 7 Oct 2026

The Virtue of Sparsity in Complexity

arXiv 2604.17166 ↗First posted 18 Apr 2026q-fin.GN cs.LG econ.EMcited by 0

Not on the map. Why?

Abstract (arXiv)

Sparsity or complexity? In modern high-dimensional asset pricing, these are often viewed as competing principles: recent empirical evidence favors richer models, while economic intuition has long favored parsimony. We reconcile this tension by distinguishing capacity sparsity-restrictions on effective model capacity-from factor sparsity-the parsimonious structure of priced risks. Revisiting the benchmark empirical design of Didisheim et al. (2025), we combine nonlinear feature expansions with basis pursuit, using column generation and GPU acceleration to scale estimation to 432 million candidate factors. Reaching this scale reveals a reversal in out-of-sample performance: sparse portfolios trail dense ridgeless benchmarks at lower complexity but achieve a higher Sharpe ratio and lower pricing error at the largest candidate set. Capacity expansion and factor sparsity are therefore complements: enlarging the candidate space allows a parsimonious pricing kernel to outperform its dense counterpart.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 2 of its 23 references that are in the map. First posted on arXiv 18 Apr 2026.

Builds on

2 of 23 references.

References · 2

  1. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  2. 2025Deep Learning is Not So Mysterious or Differentcited by 55

Built on by

Not cited yet.