{"paper_id":"2401.17472","title":"Convergence of the deep BSDE method for stochastic control problems formulated through the stochastic maximum principle","authors":["Zhipeng Huang","Balint Negyesi","Cornelis W. Oosterlee"],"paper_date":"2024-01-30","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2401.17472v3","page_url":"https://thequant.space/flowcharts/convergence-of-the-deep-bsde-method-for-stochastic-control-p/","scores":{"empirical_rigor":7,"math_complexity":9,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper provides a convergence result for the deep SMP‑BSDE algorithm and derives a‑posteriori error estimates that bound the total approximation error by the loss functional value and the discretization error.","quote":"In this paper, we provide a convergence result for this deep SMP-BSDE algorithm and compare its performance with other existing methods. In particular, by adopting a strategy as in Han and Long 2020, we derive a-posteriori estimate, and show that the total approximation error can be bounded by the value of the loss functional and the discretization error.","summary":"It is well-known that decision-making problems from stochastic control can be formulated by means of a forward-backward stochastic differential equation (FBSDE). Recently, the authors of Ji et al. 2022 proposed an efficient deep learning algorithm based on the stochastic maximum principle (SMP). In…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The functions \\(\\bar\\phi = \\bar b, \\bar\\sigma, \\bar f\\) and \\(g\\) are twice continuously differentiable in \\(x\\), bounded at zero, and their first and second derivatives are uniformly Lipschitz in \\(x\\) and \\(u\\).","type":"model","stated":"explicit","quote":"The map ¯φ is C2 in x, and ¯φ(t, 0, u) is bounded for any (t, u) ∈[0, T]×U. Moreover, ¯φ, ¯φx and ¯φxx are uniformly Lipschitz in x and u. Remark 2.","support":"full"},{"assumption":"The terminal cost \\(g\\) is convex and the Hamiltonian \\(\\bar H\\) is concave in \\((x,u)\\) for the optimality theorem.","type":"model","stated":"explicit","quote":"Suppose that g(·) is convex, ¯H (t, ·, ·, P ∗ t , Q∗ t) defined by (2) is concave for all t ∈[0, T] P almost surely, and the maximum condition ¯H (t, X∗ t , u∗ t, P ∗ t , Q∗ t) = max u∈U ¯H (t, X∗ t , u, P ∗ t , Q∗ t) , a.e. t ∈[0, T], P-a.s. (4) holds.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Linear‑quadratic synthetic examples","provider":null,"kind":"synthetic","access":"public","period":null,"universe":null,"quote":"Our numerical examples are given for so-called linear quadratic (LQ) type problems, a special case of (1), where ¯b(t, x, u) = Ax + Bu + β, ¯σj(t, x, u) = Cjx + Dju + Σj, (41) ¯f(t, x, u) = 1 2(x⊤Rxx + u⊤Rxux + u⊤Ruu), g(x) = 1 2x⊤Gx, with A ∈Rd×d, B ∈Rd×ℓ, β ∈Rd, Rx ∈Rd×d, Rxu ∈Rl×d, Ru ∈Rℓ×ℓand G ∈Rd×d, Rx, Ru and G are symmetric, and, for j = 1, . . . , m, Cj ∈Rd×d, Dj ∈Rd×ℓ, Σj ∈Rd.","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":"The relative approximation errors of both state and adjoint processes are on the order of 10⁻³ for over 95 % of sampling paths.","kind":"theoretical","quote":"The relative approximation errors of both processes are O(10−3) for over 95% of the sampling paths.","support":"full"},{"finding":"Approximation errors of all processes decay with at least an O(h) rate as the number of discretization points N increases.","kind":"theoretical","quote":"Indeed, Figure 2a confirms our theoretical findings, where the approximation errors of all processes decay with a rate of at least O(h).","support":"full"},{"finding":"The total approximation error can be bounded by the sum of the time step size h and the value of the objective functional, confirming the a‑posteriori estimate.","kind":"theoretical","quote":"In particular, by adopting a strategy as in Han and Long 2020, we derive a-posteriori estimate, and show that the total approximation error can be bounded by the value of the loss functional and the discretization error. The convergence of the proposed algorithm is collected in Figure 2a, where the absolute errors of all corresponding processes are plotted for different val-ues of N. We recall that the insights of","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":11,"citations":{"cited_by_in_corpus":3,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":3},"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-14T19:59:00Z"},"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/"}