Large (and Deep) Factor Models

Bryan Kelly, Boris Kuznetsov, Semyon Malamud, Teng Andrea Xu
1/20/2024
q-fin.STcs.CEcs.LG

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

Abstract

We open up the black box behind Deep Learning for portfolio optimization and prove that a sufficiently wide and arbitrarily deep neural network (DNN) trained to maximize the Sharpe ratio of the Stochastic Discount Factor (SDF) is equivalent to a large factor model (LFM): A linear factor pricing model that uses many non-linear characteristics. The nature of these characteristics depends on the architecture of the DNN in an explicit, tractable fashion. This makes it possible to derive end-to-end trained DNN-based SDFs in closed form for the first time. We evaluate LFMs empirically and show how various architectural choices impact SDF performance. We document the virtue of depth complexity: With enough data, the out-of-sample performance of DNN-SDF is increasing in the NN depth, saturating at huge depths of around 100 hidden layers.

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. 5 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{kelly2024large,
  title  = {Large (and Deep) Factor Models},
  author = {Bryan Kelly and Boris Kuznetsov and Semyon Malamud and Teng Andrea Xu},
  year   = {2024},
  eprint = {2402.06635},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.06635v1}
}

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/2402.06635.svg)](https://codeofpaper.com/paper/2402.06635)

Discussion