An Introduction To Regret Minimization In Algorithmic Trading: A Survey of Universal Portfolio Techniques

05/26/2021
by   Thomas Orton, et al.
0

In financial investing, universal portfolios are a means of constructing portfolios which guarantee a certain level of performance relative to a baseline, while making no statistical assumptions about the future market data. They fall under the broad category of regret minimization algorithms. This document covers an introduction and survey to universal portfolio techniques, covering some of the basic concepts and proofs in the area. Topics include: Constant Rebalanced Portfolios, Cover's Algorithm, Incorporating Transaction Costs, Efficient Computation of Portfolios, Including Side Information, and Follow The Leader Algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2021

On universal covers for carpenter's rule folding

We present improved universal covers for carpenter's rule folding in the...
research
02/12/2013

Competing With Strategies

We study the problem of online learning with a notion of regret defined ...
research
05/18/2018

Efficient Online Portfolio with Logarithmic Regret

We study the decades-old problem of online portfolio management and prop...
research
07/30/2021

The Adaptive Multi-Factor Model and the Financial Market

Modern evolvements of the technologies have been leading to a profound i...
research
04/07/2019

Competitive ratio versus regret minimization: achieving the best of both worlds

We consider online algorithms under both the competitive ratio criteria ...
research
03/02/2023

Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation

We present the OMG-CMDP! algorithm for regret minimization in adversaria...
research
02/04/2022

On Universal Portfolios with Continuous Side Information

A new portfolio selection strategy that adapts to a continuous side-info...

Please sign up or login with your details

Forgot password? Click here to reset