Yau's Affine-Normal Descent for Large-Scale Unrestricted Higher-Moment Portfolio Optimization
Ya-Juan Wang, Yi-Shuai Niu, Artan Sheshmani, Shing-Tung Yau

TL;DR
This paper introduces a structure-exploiting algorithm based on Yau's affine-normal descent for large-scale unrestricted higher-moment portfolio optimization, enabling efficient computation without explicit higher-order tensors.
Contribution
The paper develops a novel algorithm that efficiently handles large-scale higher-moment portfolio optimization by exploiting problem structure and avoiding explicit tensor computations.
Findings
Effective on small benchmarks with direct configuration.
Preconditioned conjugate-gradient method excels on large asset universes.
Higher moments provide most value at moderate return targets.
Abstract
Unrestricted mean-variance-skewness-kurtosis portfolio optimization can capture asymmetry and tail risk, but sample-moment formulations become computationally impractical when the asset universe is large: they produce dense nonconvex quartic objectives with prohibitive coskewness and cokurtosis tensors and anisotropic, ill-conditioned level sets. We develop a structure-exploiting algorithm based on Yau's affine-normal descent that follows affine-normal directions of the current level set while working directly with the return matrix. The method avoids explicit higher-order tensors and exploits the quartic structure for exact sample oracles, derivative evaluation, and exact line search. We also provide theory for the reduced simplex formulation, including regularity and convexity conditions that separate data-map geometry from investor preference coefficients. Computational results show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
