In the problem of online portfolio selection as formulated by Cover (1991) [12], the trader repeatedly distributes her capital over d assets in each of T > 1 rounds, with the goal of maximizing the total return. Cover proposed an algorithm, termed Universal Portfolios, that performs nearly as well as the best (in hindsight) static assignment of a portfolio, with an O(d log(T )) logarithmic regret. Without imposing any restrictions on the market this guarantee is known to be worst-case optimal, and no other algorithm attaining it has been discovered so far. Unfortunately, Cover's algorithm crucially relies on computing certain d-dimensional integral, which must be approximated in any implementation; this results in a prohibitive Õ(d 4 (T + d) 14 ) per-round runtime for the fastest known implementation due to Kalai and Vempala (2002) [22]. We propose an algorithm for online portfolio selection that admits essentially the same regret guarantee as Universal Portfolios-up to a constant factor and replacement of log(T ) with log(T + d)-yet has a drastically reduced runtime of Õ(d 2 (T + d)) per round. The selected portfolio minimizes the observed logarithmic loss regularized with the log-determinant of its Hessian-equivalently, the hybrid logarithmic-volumetric barrier of the polytope specified by the asset return vectors. As such, our work reveals surprising connections of online portfolio selection with two classical topics in optimization theory: cutting-plane and interior-point algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.