Sparse Unit-Sum Regression

Abstract

This paper considers sparsity in linear regression under the restriction that the regression weights sum to one. We propose an approach that combines 0- and 1-regularization. We compute its solution by adapting a recent methodological innovation made by Bertsimas et al. (2016) for 0-regularization in standard linear regression. In a simulation experiment we compare our approach to 0-regularization and 1-regularization and find that it performs favorably in terms of predictive performance and sparsity. In an application to index tracking we show that our approach can obtain substantially sparser portfolios compared to 1-regularization while maintaining a similar tracking performance.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…