A two-level framework that constructs portfolios using candidate window sizes and dynamically aggregates them through online learning is proposed and finite-horizon cost-sensitive tracking-regret bounds are derived that account for turnover of the aggregated portfolio, with static regret as a special case.
Abstract
This paper investigates cost-sensitive online window size selection for portfolio management under changing market conditions. Specifically, we propose a two-level framework that constructs portfolios using candidate window sizes and dynamically aggregates them through online learning. By treating candidate window sizes as ``experts,''we dynamically update their aggregation weights using turnover-inclusive losses. Moreover, we derive finite-horizon cost-sensitive tracking-regret bounds that account for turnover of the aggregated portfolio, with static regret as a special case. Under bounded losses and cost rates, suitably tuned Fixed Share achieves asymptotically no tracking regret for sublinear switching budgets, with Hedge covering the static case.
The enhanced index tracking (EIT) portfolio selection problem aims to construct a portfolio that is expected to outperform a benchmark index. In practice, investors face uncertainty in the joint distribution of asset and index losses, as the true distribution is typically unknown and only partial information is availab...
In this paper, we present robust portfolio selection models by incorporating a reward and penalty mechanism into portfolio management. We assume that the joint distribution of the losses of the underlying risky assets in a portfolio is uncertain but lies within a multivariate distribution set. Our goal is to identify o...
The equal-weighted portfolio is a passive, rule-based strategy that has historically been difficult to outperform, delivering higher returns than the capitalization-weighted"market"benchmark across many markets and periods. Stochastic portfolio theory (SPT) reveals that this relative performance is regime dependent, wi...
Brian Ceco, Xiao-Fei Shi, Ting-Kam Leonard Wong· 0 citations
We study sequential minimum-variance allocation when estimated market-factor loadings are uncertain. At each date, a horizon-one convex problem is solved using an ellipsoidal confidence region for the jointly estimated loading vector. The full loading covariance includes cross-asset residual dependence, and the uncerta...
L. Carvalho, J. M. Palma· Mathematics· 0 citations
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.