{"paper_id":"2409.10301","title":"Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing","authors":["Atithi Acharya","Romina Yalovetzky","Pierre Minssen","Shouvanik Chakrabarti","Ruslan Shaydulin","Rudy Raymond","Yue Sun","Dylan Herman","Ruben S. Andrist","Grant Salton","Martin J. A. Schuetz","Helmut G. Katzgraber","Marco Pistoia"],"paper_date":"2024-09-16","paper_type":"software-tool","paper_url":"https://arxiv.org/pdf/2409.10301v2","page_url":"https://thequant.space/flowcharts/decomposition-pipeline-for-large-scale-portfolio-optimizatio/","scores":{"empirical_rigor":6,"math_complexity":7.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a decomposition pipeline that splits large portfolio optimization problems into constrained subproblems, solves them independently, and aggregates the solutions.","quote":"Our pipeline includes three main components: preprocessing of correlation matrices based on random matrix theory, modified spectral clustering based on Newman's algorithm, and risk rebalancing.","summary":"Industrially relevant constrained optimization problems, such as portfolio optimization and portfolio rebalancing, are often intractable or difficult to solve exactly. In this work, we propose and benchmark a decomposition pipeline targeting portfolio optimization and rebalancing problems with…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Daily returns are used without loss of generality.","type":"data","stated":"explicit","quote":"For brevity, we will assume daily returns without loss of generality, but it is straightforward to use other types of returns."},{"assumption":"Decision variables are integer (binary or integer) variables.","type":"model","stated":"explicit","quote":"Given a universe of n ∈Z assets to choose from, the objective is to maximize the return while minimizing the exposure to risk."},{"assumption":"Risk aversion coefficient q is a positive real number.","type":"model","stated":"explicit","quote":"their trade-off is governed by the risk aversion coefficient q ∈R+."},{"assumption":"Correlation matrix can be decomposed into random and signal components using a threshold λ+.","type":"statistical","stated":"explicit","quote":"the eigendecomposition of C whose eigenvalues are at most λ+ captures the random components associated with eigenvalues less than or equal to λ+, and Csignal represents the structured components reflecting eigenvalues greater than λ+."},{"assumption":"Subproblem size threshold ϕ is set to limit community size.","type":"execution","stated":"explicit","quote":"denoted by ϕ) after executing Algorithm 1 or Algorithm 3, respectively."}]},"datasets":{"status":"available","items":[{"name":"Russell 3000 index daily returns","provider":null,"kind":"market-prices","access":"public","period":"1000 days starting from January 2010","universe":"90 to 1500 assets","quote":"The dataset utilized in this work is based on the Russell 3000 index, with daily returns collected over a period of 1000 days starting from January 2010. The instances range in size from 90 to 1500 assets."}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"daily"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R1","candidates":{"front_matter":"n/a","evidence_card":"unclear","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"The decomposition pipeline reduces problem size by approximately 80%.","kind":"performance","quote":"Our empirical results show that our pipeline consistently decomposes real‑world portfolio optimization problems into subproblems with a size reduction of approximately 80%."},{"finding":"Time‑to‑solution is reduced by at least 3× for the largest problems (1500 variables) when using the pipeline with a branch‑and‑bound solver.","kind":"performance","quote":"the time‑to‑solution is significantly reduced (by at least 3× for the largest problems considered in our numerical experiments, with 1500 variables) as compared to directly solving the problem with the same solver."},{"finding":"Decomposed subproblems become suitable targets for quantum optimization techniques.","kind":"other","quote":"even the decomposed subproblems become difficult to solve with classical techniques, but are"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":13,"citations":{"cited_by_in_corpus":2,"by_independent_authors":2,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":1},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":true,"code_url":"https://github.com/jpmorganchase/dcmppln","note":null},"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-14T18:02:04Z"},"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/"}