{"paper_id":"2504.19717","title":"A high-order recombination algorithm for weak approximation of stochastic differential equations","authors":["Syoiti Ninomiya","Yuji Shinozaki"],"paper_date":"2025-04-28","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2504.19717v2","page_url":"https://thequant.space/flowcharts/a-high-order-recombination-algorithm-for-weak-approximation/","scores":{"empirical_rigor":3,"math_complexity":9.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a high-order recombination algorithm for weak approximation of SDEs, including a refined error analysis and a recursive partitioning method.","quote":"Based on this condition, a computationally feasible recursive partitioning algorithm is developed.","summary":"This paper presents an algorithm for applying the high-order recombination method, originally introduced by Lyons and Litterer in ``High-order recombination and an application to cubature on Wiener space’’ (Ann. Appl. Probab. 22(4):1301–1327, 2012), to practical problems in mathematical finance. A…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The vector fields in the SDE satisfy the UFG condition.","type":"model","stated":"explicit","quote":"Assume that the vector fields in the SDE (1) satisfy the UFG condition, that X is the diffusion process defined by (1), and that Q(s) is an m-similar operator."},{"assumption":"The vector fields satisfy the uniform Hörmander (UH) condition.","type":"model","stated":"explicit","quote":"The vector fields V0, V1, . . . , Vd are said to satisfy the uniform H¨ormandar (UH) condition if there exists ℓ∈N such that ..."},{"assumption":"Test functions are distinct homogeneous polynomials of degree at most m, with g1(x)=1 and gi(0)=0 for i>1.","type":"other","stated":"explicit","quote":"we consider the set of test functions G to consist of distinct homogeneous polynomials of degree at most m and we assume that g1(x) = 1 and g2(0) = g3(0) = · · · = gMG(0) = 0."},{"assumption":"The payoff function f belongs to CLip(RN;R).","type":"statistical","stated":"explicit","quote":"In the original work of Kusuoka [11, 13], Theorem 2 is proved under the assumption that f ∈C∞b (RN; R). This assumption can, however, be relaxed to f ∈CLip(RN; R), as pointed out in Section 3 of [18]."}]},"datasets":{"status":"none_found","items":[],"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 refined error analysis yields a sharper condition for space partitioning, allowing a feasible recursive partitioning algorithm.","kind":"theoretical","quote":"A refined error analysis is provided, yielding a sharper condition for space partitioning."},{"finding":"The proposed algorithm avoids the explosive growth in the cardinality of the support required for high-order approximations.","kind":"theoretical","quote":"Numerical examples are also included, demonstrating that the proposed algorithm effectively avoids the explosive growth in the cardinality of the support required to achieve high-order approximations."},{"finding":"Recombination does not compromise the order of the discretisation error under the LL patch condition.","kind":"theoretical","quote":"In other words, the recombination does not compromise the order of the discretisation error."},{"finding":"Theorem 5 refines Theorem 4 by incorporating patch weights as well as radii, improving error bounds.","kind":"theoretical","quote":"Taking the weight of each patch into account yields Theorem 5 below, which refines Theorem 4 by incorporating not only the radii of the patches but also their weights."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":28,"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:23Z"},"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/"}