paper-with-me

홈 › Papers

Beating the Best Constant Rebalancing Portfolio in Long-Term Investment: A Generalization of the Kelly Criterion and Universal Learning Algorithm for Markets with Serial Dependence

2025-07-08 · Duy Khanh Lam arxiv

In the online portfolio optimization framework, existing learning algorithms generate strategies that yield significantly poorer cumulative wealth compared to the best constant rebalancing portfolio in hindsight, despite being consistent in asymptotic growth rate. While this unappealing performance can be improved by incorporating more side information, it raises difficulties in feature selection and high-dimensional settings. Instead, the inherent serial dependence of assets' returns, such as day-of-the-week and other calendar effects, can be leveraged. Although latent serial dependence patterns are commonly detected using large training datasets, this paper proposes an algorithm that learns such dependence using only gradually revealed data, without any assumption on their distribution, to form a strategy that eventually exceeds the cumulative wealth of the best constant rebalancing portfolio. Moreover, the classical Kelly criterion, which requires independent assets' returns, is generalized to accommodate serial dependence in a market modeled as an independent and identically distributed process of random matrices. In such a stochastic market, where existing learning algorithms designed for stationary processes fail to apply, the proposed learning algorithm still generates a strategy that asymptotically grows to the highest rate among all strategies, matching that of the optimal strategy constructed under the generalized Kelly criterion. The experimental results with real market data demonstrate the theoretical guarantees of the algorithm and its performance as expected, as long as serial dependence is significant, regardless of the validity of the generalized Kelly criterion in the experimental market. This further affirms the broad applicability of the algorithm in general contexts.

📄 PDF Abstract BibTeX arXiv:2507.05994

Code (0)

등록된 구현이 없습니다.

Tasks

Portfolio Optimization

Similar Papers 제목 키워드 기반

Multilinear Superhedging of Lookback Options

2018-10-04 · Alex Garivaltis

In a pathbreaking paper, Cover and Ordentlich (1998) solved a max-min portfolio game between a trader (who picks an entire trading algorithm, $\theta(\cdot)$) and "nature," who picks the matrix $X$ of gross-returns of al…

Cover's universal portfolio, stochastic portfolio theory and the numeraire portfolio

2016-11-29

Cover's celebrated theorem states that the long run yield of a properly chosen "universal" portfolio is as good as the long run yield of the best retrospectively chosen constant rebalanced portfolio. The "universality" p…

Exact Replication of the Best Rebalancing Rule in Hindsight

2018-10-05 · Alex Garivaltis

This paper prices and replicates the financial derivative whose payoff at $T$ is the wealth that would have accrued to a $\$1$ deposit into the best continuously-rebalanced portfolio (or fixed-fraction betting scheme) de…

Benchmark Beating with the Increasing Convex Order

2023-11-03 · Jianming Xia

In this paper we model benchmark beating with the increasing convex order (ICX order). The mean constraint in the mean-variance theory of portfolio selection can be regarded as beating a constant. We then investigate the…

Rebalancing Frequency Considerations for Kelly-Optimal Stock Portfolios in a Control-Theoretic Framework

2018-08-21

In this paper, motivated by the celebrated work of Kelly, we consider the problem of portfolio weight selection to maximize expected logarithmic growth. Going beyond existing literature, our focal point here is the rebal…