{"paper_id":"2601.07687","title":"Physics-Informed Singular-Value Learning for Cross-Covariances Forecasting in Financial Markets","authors":["Efstratios Manolakis","Christian Bongiorno","Rosario Nunzio Mantegna"],"paper_date":"2026-01-12","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2601.07687v1","page_url":"https://thequant.space/flowcharts/physics-informed-singular-value-learning-for-cross-covarianc/","scores":{"empirical_rigor":6.5,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a physics‑informed neural architecture that learns a nonlinear mapping from empirical singular values to cleaned cross‑covariance values, preserving random‑matrix theory symmetries.","quote":"we address this gap by designing a random-matrix-inspired neural architecture that operates in the empirical singular-vector basis and learns a nonlinear mapping from empirical singular values to their corresponding cleaned values.","summary":"A new wave of work on covariance cleaning and nonlinear shrinkage has delivered asymptotically optimal analytical solutions for large covariance matrices. Building on this progress, these ideas have been generalized to empirical cross-covariance matrices, whose singular-value shrinkage…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Analytical cross‑covariance cleaners are derived under strong stationarity and large‑sample assumptions.","type":"statistical","stated":"explicit","quote":"Existing analytical cross‑covariance cleaners are derived under strong stationarity and large-sample assumptions"},{"assumption":"The random‑matrix‑inspired network can recover the analytical solution as a special case.","type":"model","stated":"explicit","quote":"By construction, the network can recover the analytical solution as a special case"},{"assumption":"Zero‑mean random vectors X and Y are considered for cross‑covariance estimation.","type":"model","stated":"explicit","quote":"Consider two zero–mean random vectors, X ∈R^{n_x} and Y ∈R^{n_y}, observed over a…"},{"assumption":"Universe selection enforces stable short‑term liquidity and sufficiently long homogeneous trading histories.","type":"market","stated":"implied","quote":"Our objective is to construct a time‑varying investable universe that enforces (i) stable short‑term liquidity and (ii) sufficiently long and homogeneous trading histories"},{"assumption":"Stocks that will be delisted within the subsequent 240 trading days are excluded to avoid look‑ahead bias.","type":"execution","stated":"implied","quote":"any stock that will be delisted within the subsequent"}]},"datasets":{"status":"available","items":[{"name":"NYSE and NASDAQ listed equities","provider":null,"kind":"market-prices","access":"public","period":"1990-01-01 to 2024-12-31","universe":"All NYSE‑ and NASDAQ‑listed equities (excluding ETFs, funds, non‑operating vehicles, ADRs)","quote":"The dataset comprises all NYSE- and NASDAQ-listed equities from January 1, 1990, to December 31, 2024, including ADRs, and excludes ETFs, funds, and non‑operating vehicles."},{"name":"Synthetic spectral‑regime datasets","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"To assess our Neural Network (NN) based estimator, we first benchmark it on synthetic datasets that reproduce the spectral regimes of finite‑rank signals and heavy‑tailed noise"}],"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":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"forecast-accuracy","findings":[{"finding":"The proposed neural method achieves a more favorable bias‑variance trade‑off than purely analytical cleaners and yields systematically lower out‑of‑sample cross‑covariance prediction errors.","kind":"predictive-accuracy","quote":"the proposed method achieves a more favorable bias–variance trade-off than purely analytical cleaners and delivers systematically lower out-of-sample cross–covariance prediction errors"},{"finding":"On synthetic benchmarks the neural estimator matches the BBP analytical performance in stationary regimes.","kind":"performance","quote":"our estimator matches the BBP performance across these validation tests"},{"finding":"In market‑data OOS tests (2017–2024) the NN consistently outperforms BBP and CV‑based shrinkage in MSE, except at n=1000 where BBP is comparable.","kind":"performance","quote":"both BBP and the CV-based shrinkage remain consistently worse than the NN in OOS MSE. The only notable exception occurs at n = 1000, where BBP attains NN-level performance"}],"reported_performance":null,"out_of_sample":{"method":"unclear","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":22,"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/bongiornoc/CrossRIEnet","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:16:26Z"},"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/"}