{"paper_id":"2505.10099","title":"A Scalable Gradient-Based Optimization Framework for Sparse Minimum-Variance Portfolio Selection","authors":["Sarat Moka","Matias Quiroz","Vali Asimit","Samuel Muller"],"paper_date":"2025-05-15","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2505.10099v1","page_url":"https://thequant.space/flowcharts/a-scalable-gradient-based-optimization-framework-for-sparse/","scores":{"empirical_rigor":3,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a fast and scalable gradient‑based optimization framework for sparse minimum‑variance portfolio selection using a Boolean relaxation and a tunable parameter that moves the auxiliary objective from convex to concave.","quote":"We propose a fast and scalable gradient‑based approach that transforms the combinatorial sparse selection problem into a constrained continuous optimization task via Boolean relaxation, while preserving equivalence with the original problem on the set of binary points.","summary":"Portfolio optimization involves selecting asset weights to minimize a risk-reward objective, such as the portfolio variance in the classical minimum-variance framework. Sparse portfolio selection extends this by imposing a cardinality constraint: only k assets from a universe of p may be included.…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The covariance matrix Σ is positive definite.","type":"model","stated":"explicit","quote":"Assumption 1. The covariance matrix Σ is positive definite."}]},"datasets":{"status":"available","items":[{"name":"Chang et al. (2000) dataset","provider":null,"kind":"market-prices","access":"unknown","period":null,"universe":"31 assets","quote":"datasets ... containing, respectively, 31 and 85 assets from Chang et al. (2000) for k up to 10."}],"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":"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":"trading-pnl","findings":[{"finding":"The method matches commercial solvers in asset selection for most instances and, when it differs, only by a few assets with negligible variance error.","kind":"performance","quote":"In practice, our method matches commercial solvers in asset selection for most instances and, in rare instances, the solution differs by a few assets whilst showing a negligible error in portfolio variance."},{"finding":"Final and best models achieve optimal or nearly optimal variance, with at most one false positive in the tested datasets.","kind":"theoretical","quote":"the final and the best models in each case achieve optimal or nearly optimal variance (just one false positive2 in two cases)."}],"reported_performance":null,"out_of_sample":{"method":"unclear","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":12,"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":true,"code_url":"https://github.com/saratmoka/grid-fw","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-14T17:38: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/"}