Adaptive Robust Online Portfolio Selection
Man Yiu Tsang, Tony Sit, Hoi Ying Wong

TL;DR
This paper introduces an adaptive robust optimization strategy for online portfolio selection that accounts for transaction costs and dynamically adjusts parameters to improve returns and risk management.
Contribution
It develops a novel adaptive scheme that dynamically calibrates model parameters, enhancing robustness and performance in sequential investment decisions compared to existing methods.
Findings
Outperforms existing OLPS strategies in cumulative returns
Achieves higher Sharpe ratios across various data sets
Effectively balances market trend capture and transaction cost control
Abstract
The online portfolio selection (OLPS) problem differs from classical portfolio model problems, as it involves making sequential investment decisions. Many OLPS strategies described in the literature capture market movement based on various beliefs and are shown to be profitable. In this paper, we propose a robust optimization (RO)-based strategy that takes transaction costs into account. Moreover, unlike existing studies that calibrate model parameters from benchmark data sets, we develop a novel adaptive scheme that decides the parameters sequentially. With a wide range of parameters as input, our scheme captures market uptrend and protects against market downtrend while controlling trading frequency to avoid excessive transaction costs. We numerically demonstrate the advantages of our adaptive scheme against several benchmarks under various settings. Our adaptive scheme may also be…
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.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Auction Theory and Applications · Financial Markets and Investment Strategies
