{"paper_id":"2405.11392","title":"Deep Penalty Methods: A Class of Deep Learning Algorithms for Solving High Dimensional Optimal Stopping Problems","authors":["Yunfei Peng","Pengyu Wei","Wei Wei"],"paper_date":"2024-05-18","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2405.11392v1","page_url":"https://thequant.space/flowcharts/deep-penalty-methods-a-class-of-deep-learning-algorithms-fo/","scores":{"empirical_rigor":7,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a deep learning algorithm called the Deep Penalty Method (DPM) for solving high dimensional optimal stopping problems.","quote":"We propose a deep learning algorithm for high dimensional optimal stopping problems.","summary":"We propose a deep learning algorithm for high dimensional optimal stopping problems. Our method is inspired by the penalty method for solving free boundary PDEs. Within our approach, the penalized PDE is approximated using the Deep BSDE framework proposed by \\cite{“weinan2017deep”}, which leads us…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"b and σ are uniformly Hölder continuous in time with exponent 1/2 and uniformly Lipschitz continuous in space.","type":"model","stated":"explicit","quote":"Assumption 1 b and σ are uniformly H¨older continuous in t with exponent 1/2 and uniformly Lipschitz continuous in x, i.e., there exists an L > 0 such that, |ϕ(t, x) −ϕ(s, y)| ≤L(|t −s|^{1/2} + |x −y|)"},{"assumption":"The differential operator L is uniformly parabolic, i.e., there exists λ1>0 such that aij(t,x)ξiξj ≥ λ1|ξ|^2 for all (t,x).","type":"model","stated":"explicit","quote":"Suppose that L is uniformly parabolic for any T > 0, i.e., there exists a positive constant λ1 > 0, such that for any ξ = (ξ1, ξ2, . . . , ξd)T ∈Rd"}]},"datasets":{"status":"available","items":[{"name":"high-dimensional American index put option","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"Finally, we test our algorithm on a high-dimensional American index put option. This pricing problem for this type of option can be simplified to a standard one-dimensional option pricing case, and thus providing a good benchmark for our analysis."}],"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 error of the DPM can be bounded by the cost function and O(1/λ)+O(λh)+O(√h), with a convergence rate of O(√h) when λ=1/√h.","kind":"theoretical","quote":"We show that the error of the DPM can be bounded by the cost function and O( 1/λ) + O(λh) + O( √h), where h is the step size in time and λ"},{"finding":"Numerical tests confirm that the DPM achieves relative errors significantly below 1% across dimensions up to d=200, with loss variance between O(10⁻⁸) and O(10⁻⁷).","kind":"performance","quote":"... The data reveals that the DPM maintains a relative error significantly below 1% across all tested cases. Furthermore, the consistently low loss variance (O(10−8) −O(10−7)) across all high-dimensional tests underscores the stability of the DPM during the final stages of optimization."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":29,"citations":{"cited_by_in_corpus":2,"by_independent_authors":2,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":1},"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/weiw1422/DeepPenaltyMethod","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-14T18:09:14Z"},"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/"}