{"paper_id":"2503.17737","title":"Bayesian Optimization for CVaR-based portfolio optimization","authors":["Robert Millar","Jinglai Li"],"paper_date":"2025-03-22","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2503.17737v1","page_url":"https://thequant.space/flowcharts/bayesian-optimization-for-cvar-based-portfolio-optimization/","scores":{"empirical_rigor":6.5,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes four new Bayesian Optimization algorithms for CVaR-based portfolio optimization that significantly reduce the number of evaluations of the expensive objective function.","quote":"We proposed four new BO algorithms specifically designed for such problems, sig-nificantly reducing the number of evaluations of the expensive objective function.","summary":"Optimal portfolio allocation is often formulated as a constrained risk problem, where one aims to minimize a risk measure subject to some performance constraints. This paper presents new Bayesian Optimization algorithms for such constrained minimization problems, seeking to minimize the conditional…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"f(x, z) is a continuous function of x for any fixed z.","type":"model","stated":"explicit","quote":"Assumptions (1) 𝑓(x, z) is a continuous function of x for any fixed z. (2) 𝑓(0, z) ≡0.","support":"full"},{"assumption":"f(0, z) ≡ 0.","type":"model","stated":"explicit","quote":"Assumptions (1) 𝑓(x, z) is a continuous function of x for any fixed z. (2) 𝑓(0, z) ≡0.","support":"full"},{"assumption":"For a given x and any fixed z, if f(x, z) ≤ 0, then f(ρx, z) is decreasing in ρ∈[0,1].","type":"model","stated":"explicit","quote":"(3) For a given x ∈W and any fixed z, if 𝑓(x, z) ≤0, 𝑓(𝜌x, z) is a decreasing function of 𝜌∈[0, 1].","support":"full"},{"assumption":"There exists α∈(0,1) such that vf(x;α) ≥ 0 for all x.","type":"model","stated":"explicit","quote":"(4) There exists 𝛼∈(0, 1) such that 𝑣𝑓(x;𝛼) ≥0 for all x ∈W. • Assumption 1 ensures that small portfolio allocation changes do not lead to abrupt or unpredictable changes in outcomes, which is reasonable in most financial models. • Assumption 2 is straightforward; an absence of investment results in a neutral (zero) financial return.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Twenty largest technology companies portfolio","provider":"morningstar.com, marketwatch.com, nasdaq.com","kind":"market-prices","access":"public","period":"data taken from July 13, 2022","universe":"twenty largest technology companies listed on NYSE & Nasdaq","quote":"Our portfolio allocation example is based on the twenty largest technology companies listed on American stock exchanges (both the NYSE & Nasdaq) by market capitalisation, as is shown in Table 3. Data is taken from July 13, 2022.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"evidence_card","rule":"R2","candidates":{"front_matter":"unclear","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"The proposed algorithms demonstrate competitive performance on practical examples.","kind":"performance","quote":"The proposed algorithm's competitive performance is demonstrated through practical examples.","support":"full"},{"finding":"Four new BO methods significantly reduce the number of evaluations of the expensive CVaR objective.","kind":"performance","quote":"We proposed four new BO algorithms specifically designed for such problems, sig-nificantly reducing the number of evaluations of the expensive objective function.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":7,"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":2,"extracted_at":"2026-11-14T19:51:13Z"},"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/"}