{"paper_id":"2505.03789","title":"A new architecture of high-order deep neural networks that learn martingales","authors":["Syoiti Ninomiya","Yuming Ma"],"paper_date":"2025-05-01","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2505.03789v2","page_url":"https://thequant.space/flowcharts/a-new-architecture-of-high-order-deep-neural-networks-that-l/","scores":{"empirical_rigor":4,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a new deep‑learning neural network architecture based on high‑order weak approximation algorithms for stochastic differential equations to efficiently learn martingales.","quote":"A new deep-learning neural network architecture based on high-order weak approximation algorithms for stochastic differential equations (SDEs) is proposed.","summary":"A new deep-learning neural network architecture based on high-order weak approximation algorithms for stochastic differential equations (SDEs) is proposed. The architecture enables the efficient learning of martingales by deep learning models. The behaviour of deep neural networks based on this…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"High‑order discretisation refers to discretisation of 2nd order or higher.","type":"model","stated":"explicit","quote":"Henceforth, what is referred to as high-order discretisation in this paper refers to discretisation of 2nd order or higher."},{"assumption":"The Euler–Maruyama discretisation achieves 1st order accuracy under certain conditions.","type":"model","stated":"explicit","quote":"Under certain conditions, the Euler–Maruyama discretisation achieves 1st order accuracy."},{"assumption":"The Adam optimiser updates parameters using moment estimates of gradients.","type":"statistical","stated":"explicit","quote":"Adam optimiser is an optimiser that updates parameters via dynamically scaling the update step based on moment estimation along each parameter’s gradient vector."},{"assumption":"Quasi‑Monte Carlo integration uses 5000 Sobol sequence points.","type":"other","stated":"explicit","quote":"All numerical integrations included are proceeded by using Quasi-Monte Carlo method with KBIN = 5000 sample points generated from the generalised Sobol’ sequence."}]},"datasets":{"status":"available","items":[{"name":"Quasi‑Monte Carlo Sobol sample points","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"All numerical integrations included are proceeded by using Quasi-Monte Carlo method with KBIN = 5000 sample points generated from the generalised Sobol’ sequence."}],"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":"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":"pricing-calibration","findings":[{"finding":"The proposed architecture enables efficient learning of martingales by deep learning models.","kind":"theoretical","quote":"The architecture enables the efficient learning of martingales by deep learning models."},{"finding":"Theorem 2 allows the value of equation (18) to be used directly as the loss function for training.","kind":"theoretical","quote":"The result of Theorem 2 allows for the utilisation of the value of (18) itself as the LOSS function."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":12,"citations":{"cited_by_in_corpus":1,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":1},"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:39:15Z"},"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/"}