Regret-based Selection for Sparse Dynamic Portfolios
This paper considers portfolio construction in a dynamic setting. We specify a loss function comprised of utility and complexity components with an unknown tradeoff parameter. We develop a novel regret-based criterion for selecting the tradeoff parameter to construct optimal sparse portfolios over time.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States
We revisit the classical online portfolio selection problem. It is widely assumed that a trade-off between computational complexity and regret is unavoidable, with Cover's Universal Portfolios algorithm, SOFT-BAYES and A…
Damped Online Newton Step for Portfolio Selection
We revisit the classic online portfolio selection problem, where at each round a learner selects a distribution over a set of portfolios to allocate its wealth. It is known that for this problem a logarithmic regret with…
Growth-Optimal Portfolio Selection under CVaR Constraints
Online portfolio selection research has so far focused mainly on minimizing regret defined in terms of wealth growth. Practical financial decision making, however, is deeply concerned with both wealth and risk. We consid…
Decision MakingRegret-Driven Portfolios: LLM-Guided Smart Clustering for Optimal Allocation
We attempt to mitigate the persistent tradeoff between risk and return in medium- to long-term portfolio management. This paper proposes a novel LLM-guided no-regret portfolio allocation framework that integrates online …
Dynamic portfolio strategy using clustering approach
The problem of portfolio optimization is one of the most important issues in asset management. This paper proposes a new dynamic portfolio strategy based on the time-varying structures of MST networks in Chinese stock ma…
Asset ManagementClusteringManagementPortfolio Optimization