analiza aiqbench
This research applies online learning algorithms, specifically the Fixed Share and Hedge methods, to optimize portfolio management by dynamically selecting window sizes as "experts." The study derives theoretical bounds on tracking regret that explicitly account for transaction costs and turnover, offering a rigorous framework for adaptive financial strategies. While the application is in finance, the core contribution lies in advancing machine learning techniques for sequential decision-making under cost constraints.
Cost-Sensitive Online Window Size Selection for Portfolio Management
arXiv:2609.29887v1 Announce Type: cross 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.
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.
Optimization and Control (math.OC); Machine Learning (cs.LG); Portfolio Management (q-fin.PM)
arXiv:2609.29887 [math.OC]
(or arXiv:2609.29887v1 [math.OC] for this version)
https://doi.org/10.48550/arXiv.2609.29887 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 199 cuvinte
Subiecte conexe

Building trust in AI agents: A production-ready evaluation framework with Amazon Bedrock AgentCore
AWS · 16 oct. 2026

[AINews] not much happened today
Latent Space · 18 sept. 2026

The best time-tracking software of 2026: Expert tested
ZDNet · 11 iun. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026