← Back
Evidence source 5832Spot Checked

Onflow: an online portfolio allocation algorithm

Unknown venue2023-12-08Paper
Executive summary

Onflow: a reinforcement learning algorithm for dynamic portfolio allocation optimizing expected log returns with transaction costs.

What it examines

The paper introduces Onflow, a reinforcement learning algorithm for online portfolio allocation using gradient flows. It aims to optimize portfolio allocation dynamically to maximize expected log returns while considering transaction costs, without assuming any statistical properties of asset returns.

What it concludes

Onflow is a promising algorithm for dynamic portfolio management, performing well even with high transaction costs. It offers a model-free approach, reducing model risk. Future research could explore short positions and test Onflow in different markets and periods.

Extracted from this source

Evidence objects

Evidence 622375% extraction confidence
Onflow is a promising algorithm for dynamic portfolio management, performing well even with high transaction costs. It offers a model-free approach, reducing model risk. Future research could explore short positions and test Onflow in different markets and periods.

key_findings bullet 1 · key_findings · validation V0

Raw abstract and provenance

Abstract: We introduce Onflow, a reinforcement learning technique that enables online optimization of portfolio allocation policies based on gradient flows. We devise dynamic allocations of an investment portfolio to maximize its expected log return while taking into account transaction fees. The portfolio allocation is parameterized through a softmax function, and at each time step, the gradient flow metho… ▽ More We introduce Onflow, a reinforcement learning technique that enables online optimization of portfolio allocation policies based on gradient flows. We devise dynamic allocations of an investment portfolio to maximize its expected log return while taking into account transaction fees. The portfolio allocation is parameterized through a softmax function, and at each time step, the gradient flow method leads to an ordinary differential equation whose solutions correspond to the updated allocations. This algorithm belongs to the large class of stochastic optimization procedures; we measure its efficiency by comparing our results to the mathematical theoretical values in a log-normal framework and to standard benchmarks from the 'old NYSE' dataset. For log-normal assets, the strategy learned by Onflow, with transaction costs at zero, mimics Markowitz's optimal portfolio and thus the best possible asset allocation strategy. Numerical experiments from the 'old NYSE' dataset show that Onflow leads to dynamic asset allocation strategies whose performances are: a) comparable to benchmark strategies such as Cover's Universal Portfolio or Helmbold et al. "multiplicative updates" approach when transaction costs are zero, and b) better than previous procedures when transaction costs are high. Onflow can even remain efficient in regimes where other dynamical allocation techniques do not work anymore. Therefore, as far as tested, Onflow appears to be a promising dynamic portfolio management strategy based on observed prices only and without any assumption on the laws of distributions of the underlying assets' returns. In particular it could avoid model risk when building a trading strategy. △ Less

Source row: 1481 · abstract type: unknown