{"paper_id":"2609.29887","title":"Cost-Sensitive Online Window Size Selection for Portfolio Management","authors":["Yi-Chen Liu","Chung-Han Hsieh"],"paper_date":"2026-09-24","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2609.29887","page_url":"https://thequant.space/flowcharts/cost-sensitive-online-window-size-selection-for-portfolio-management/","scores":{"empirical_rigor":4,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a two‑level framework that builds portfolios from candidate window sizes and dynamically aggregates them via online learning with turnover‑inclusive losses.","quote":"Specifically, we propose a two-level framework that constructs portfolios using candidate window sizes and dynamically aggregates them through online learning.","summary":"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…","strategy":"Fixed Share"},"assumptions":{"status":"available","items":[{"assumption":"The per‑round prediction loss is bounded: a ≤ ℓ(w, y) ≤ b for all (w, y).","type":"statistical","stated":"explicit","quote":"Assume further that a ≤ℓ(w, y) ≤b for all (w, y) ∈W × Y, where a < b are fixed finite constants."},{"assumption":"Transaction cost rates are non‑negative at each time step.","type":"execution","stated":"explicit","quote":"Let c(t) ≥0 denote the transaction cost rate."},{"assumption":"A switching budget K (0…T‑1) limits the number of expert changes.","type":"model","stated":"explicit","quote":"Given a time horizon T ≥1 and a switching budget K ∈{0, . . . , T −1}, our goal is to select q(t) ∈∆n before y(t) is revealed..."},{"assumption":"The maximum ℓ1 distance between any two probability‑simplex vectors is 2, used to bound combined loss.","type":"statistical","stated":"explicit","quote":"Because the original loss is bounded in [a, b] and the maximum l1 distance between any two vectors on the probability simplex is 2, the combined loss at time t lies in the interval ˜ℓj(t) ∈[a, b+2c(t)]."},{"assumption":"Synthetic data generation assumes returns follow a linear autoregressive model with a regime shift at halfway point.","type":"other","stated":"explicit","quote":"the market undergoes a sharp regime shift precisely halfway through the dataset: for the first 1,000 days, the returns are driven by a jt = 63, and jt = 5 for the remaining days."}]},"datasets":{"status":"available","items":[{"name":"Synthetic regime‑shift dataset","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"− µ + ǫ(t) ... for the first 1,000 days, the returns are driven by a jt = 63, and jt = 5 for the remaining days."},{"name":"DJIA","provider":null,"kind":"market-prices","access":"public","period":"2021/03/04–2024/02/25","universe":"DJIA constituents","quote":"Table 1: Summary of the empirical studies with transaction cost rate c = 0.001. DJIA: 2021/03/04–2024/02/25; ..."},{"name":"S&P 500","provider":null,"kind":"market-prices","access":"public","period":"2020/01/02–2026/08/01","universe":"S&P 500 constituents","quote":"Table 1: Summary of the empirical studies with transaction cost rate c = 0.001."}],"known":[],"sample":{"start":"2021-03","end":"2024-02","market":"DJIA stocks","asset_class":"equities","frequency":"daily"},"data_resolution":"daily"},"transaction_costs":{"status":"available","modeled":"yes","headline_net_of_costs":null,"detail":"A flat transaction cost rate c is incorporated into the loss; experiments use c = 0.001.","quote":"Define the cost-sensitive loss of expert j at time t as their prediction loss plus their incurred transaction cost: ˜ℓj(t) := ℓ(wj(t), y(t)) + c(t)∥wj(t) −wj(t −1)∥1.","source":"evidence_card","rule":"R2","candidates":{"front_matter":"unclear","evidence_card":"yes","evidence_card_quoted":true},"card_detail":"A flat transaction cost rate c is incorporated into the loss; experiments use c = 0.001.","card_quote":"Define the cost-sensitive loss of expert j at time t as their prediction loss plus their incurred transaction cost: ˜ℓj(t) := ℓ(wj(t), y(t)) + c(t)∥wj(t) −wj(t −1)∥1.","meaning":"costs are part of the reported headline results"},"results":{"status":"available","evaluation_type":"trading-pnl","findings":[{"finding":"Fixed Share achieves a cost‑sensitive tracking‑regret bound that scales with the transaction‑cost rate and switching budget, recovering Hedge’s static‑regret bound as a special case.","kind":"theoretical","quote":"We derive a cost-sensitive tracking-regret bound for Fixed Share, with the static-regret bound for Hedge recovered as a special case."},{"finding":"In synthetic experiments, Fixed Share attains lower cumulative return than Hedge but still tracks the regime shift with bounded regret.","kind":"performance","quote":"Figure 1 shows the cost-sensitive tracking regret defined in P…"}],"reported_performance":{"strategy":"Fixed Share","sharpe":null,"sharpe_benchmark":null,"annual_return_pct":null,"total_return_pct":38.1074,"max_drawdown_pct":12.9282},"out_of_sample":{"method":"walk-forward","headline_out_of_sample":true}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":15,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T17:04:42Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}