{"paper_id":"2308.14487","title":"Deep multi-step mixed algorithm for high dimensional non-linear PDEs and associated BSDEs","authors":["Daniel Bussell","Camilo Andrés García-Trillos"],"paper_date":"2023-08-28","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2308.14487v1","page_url":"https://thequant.space/flowcharts/deep-multi-step-mixed-algorithm-for-high-dimensional-non-lin/","scores":{"empirical_rigor":3,"math_complexity":9.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a new multistep deep learning‑based algorithm for solving moderate to high dimensional nonlinear backward stochastic differential equations (BSDEs) and their corresponding parabolic PDEs.","quote":"We propose a new multistep deep learning-based algorithm for the resolution of moderate to high dimensional nonlinear backward stochastic differential equations (BSDEs) and their corresponding parabolic partial differential equations (PDE).","summary":"We propose a new multistep deep learning-based algorithm for the resolution of moderate to high dimensional nonlinear backward stochastic differential equations (BSDEs) and their corresponding parabolic partial differential equations (PDE). Our algorithm relies on the iterated time discretisation…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"X0 is in L3(F0, Rd).","type":"model","stated":"explicit","quote":"(i) X0 ∈L3(F0, Rd) (ii) The functions µ and σ are uniformly Lipschitz in t, Lipschitz in x and continuously differ-entiable in x.","support":"full"},{"assumption":"The functions μ and σ are uniformly Lipschitz in t, Lipschitz in x and continuously differentiable in x.","type":"model","stated":"explicit","quote":"(i) X0 ∈L3(F0, Rd) (ii) The functions µ and σ are uniformly Lipschitz in t, Lipschitz in x and continuously differ-entiable in x.","support":"full"},{"assumption":"The generator f is Lipschitz continuous in x, y, z and 1/2‑Hölder continuous in time.","type":"model","stated":"explicit","quote":"(iii) The generator f is Lipschitz continuous in x, y, z and 1/2-H¨older continuous in time, that is: ∃K > 0 such that for all (t, x, y, z) and (t′, x′, y′, z′) ∈[0, T] × Rd × R × Rd, |f(t, x, y, z) −f(t′, x′, y′, z′)| ≤K(|t −t′|1/2 + |x −x′|2 + |y −y′| + |z −z′|2).","support":"full"},{"assumption":"The function g satisfies a linear growth condition.","type":"model","stated":"explicit","quote":"(v) The function g satisfies a linear growth condition.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Unbounded example (50)","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"6.2. Unbounded example. We consider the parameters (50) ( µ = 0, σ = Id √ d f(x, y, z) = k(x) + y √ d(1d.z) + y2 2 DEEP MULTI-STEP MIXED ALGORITHM FOR HIGH-DIMENSIONAL BSDES 15 such that the solution of the PDE is given by u(t, x) = T −t d d X i=1 (sin(xi)1xi<0 + xi1xi>0) + cos d X i=1 ixi ! .","support":"full"}],"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":"unclear","findings":[{"finding":"In dimension d=1 the DADM scheme achieves an averaged value 1.3735 with relative error 0.29%, outperforming DBDP2 (0.41%) and DBSDE (0.49%).","kind":"performance","quote":"The results are listed in Figure 5 and we show the plots in dimension 1 for the DADM Scheme below Scheme errors Averaged value Standard devia-tion Relative error (%) (DBDP2) 1.3719 0.0040 0.41 (DBSDE) 1.3708 0.0031 0.49 (DADM) 1.3735 0.0041 0.29 Table 4.","support":"full"},{"finding":"In dimension d=8 the DADM scheme achieves an averaged value 1.0675 with relative error 8.01%, improving over DBDP2 (11.02%) while DBSDE does not converge.","kind":"performance","quote":"16 DANIEL BUSSELL AND CAMILO ANDR´ES GARC´IA TRILLOS Scheme errors Averaged value Standard devia-tion Relative error (DBDP2) 1.0327 0.0081 11.02 (DBSDE) NotConv NotConv NotConv (DADM) 1.0675 0.01241 8.01 Table 5.","support":"full"},{"finding":"Overall, the DADM scheme outperforms the benchmark DBSDE and its one‑step counterpart DBDP2 in terms of smaller relative error across tested dimensions.","kind":"theoretical","quote":"We can see that,from our example (6.1) ,when the maturity is large our the DADM scheme outperforms the benchmark DBSDE as that method fails to converge due to the high number of times steps in the discretisation, We also note that our scheme outperforms its one step counterpart the DBDP2 scheme in terms of smaller relative error.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":20,"citations":{"cited_by_in_corpus":1,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":0},"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":2,"extracted_at":"2026-11-14T20:01:25Z"},"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/"}