{"paper_id":"2309.07023","title":"Weak Markovian Approximations of Rough Heston","authors":["Christian Bayer","Simon Breneis"],"paper_date":"2023-09-13","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2309.07023v1","page_url":"https://thequant.space/flowcharts/weak-markovian-approximations-of-rough-heston/","scores":{"empirical_rigor":3,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes weak error bounds for Markovian approximations of the rough Heston model using L1‑kernel errors and introduces specific approximations that converge super‑polynomially in the number of dimensions.","quote":"we show that the weak error of the Markovian approximations can be bounded using the $L^1$-error in the kernel approximation for general classes of payoff functions for European style options. Moreover, we give specific Markovian approximations which converge super-polynomially in the number of dimensions","summary":"The rough Heston model is a very popular recent model in mathematical finance; however, the lack of Markov and semimartingale properties poses significant challenges in both theory and practice. A way to resolve this problem is to use Markovian approximations of the model. Several previous works…","strategy":null},"assumptions":{"status":"none_found","items":[]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"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":"Markovian approximations achieve the same accuracy as the Adams scheme for implied volatility smiles while being dramatically faster (40–270 s vs 6183 s for H = −0.1).","kind":"performance","quote":"the computation of the smile for H = −0.1 with relative accuracy 10−4 took 6183 seconds using the Adams scheme, while the Markovian approximations took 40 – 270 seconds, depending on N and the quadrature rule used"},{"finding":"Quadrature rules based on L1‑error (GG, NGG, OL1, AE) remain accurate for tiny or negative H, whereas L2‑based rules perform poorly.","kind":"performance","quote":"quadrature rules relying on the L2-error (i.e. OL2, AK) perform very badly for tiny H (and are not well-defined for negative H), while quadrature rules relying on the L1-error (i.e. GG, NGG, OL1, AE) still work well even for H = −0.1"},{"finding":"The BL2 quadrature rule, despite optimizing a penalized L2‑error, outperforms all other methods by multiple orders of magnitude even for tiny or negative H.","kind":"performance","quote":"the exception here is BL2, which, despite optimizing the (penalized) L2-error outperforms every other method by multiple magnitudes, even for tiny or negative H"},{"finding":"For sufficiently large N, NGG is expected to outperform GG, though such large N are likely unnecessary for typical applications.","kind":"theoretical","quote":"we guess that for sufficiently large N, NGG will outperform GG, but such large N are likely not necessary for usual applications"},{"finding":"The weak error analysis extends to the hyper‑rough case H > −1/2.","kind":"theoretical","quote":"The new approximations also work for the hyper-rough case $H > -1/2$."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"available","supports":[],"contradicts":[],"qualifies":[],"compared_with":30,"citations":{"cited_by_in_corpus":9,"by_independent_authors":8,"how_cited":{"used_as_baseline":0,"uses_method_or_data":3,"extends":0,"discusses_findings":0,"mentions":3,"unclassified":3},"independent_papers":[{"paper":{"paper_id":"2512.00448","title":"Efficient Calibration in the rough Bergomi model by Wasserstein distance","paper_date":"2025-11-29","authors":["Changqing Teng","Guanglian Li"],"empirical_rigor":6,"page_url":"https://thequant.space/flowcharts/efficient-calibration-in-the-rough-bergomi-model-by-wasserst/"},"how":"uses_method_or_data","quote":null},{"paper":{"paper_id":"2609.08541","title":"Variance-Optimal Hedging in the Rough Hawkes--Heston Model","paper_date":"2026-09-08","authors":["Yingli Wang","Xiaoyu Wang"],"empirical_rigor":6,"page_url":"https://thequant.space/flowcharts/variance-optimal-hedging-in-the-rough-hawkes-heston-model/"},"how":"uses_method_or_data","quote":null},{"paper":{"paper_id":"2504.21658","title":"Approximation and regularity results for the Heston model and related processes","paper_date":"2025-04-30","authors":["Edoardo Lombardo"],"empirical_rigor":4,"page_url":"https://thequant.space/flowcharts/approximation-and-regularity-results-for-the-heston-model-an/"},"how":"uses_method_or_data","quote":null}],"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/SimonBreneis/approximations_to_fractional_stochastic_volterra_equations","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:22:08Z"},"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/"}