{"paper_id":"2310.09181","title":"A generalization of the rational rough Heston approximation","authors":["Jim Gatheral","Radoš Radoičić"],"paper_date":"2023-10-13","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2310.09181v2","page_url":"https://thequant.space/flowcharts/a-generalization-of-the-rational-rough-heston-approximation/","scores":{"empirical_rigor":3,"math_complexity":9.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper extends the rational approximation of the rough Heston model to the general case with a Mittag‑Leffler kernel (λ ≥ 0) and provides numerical evidence of convergence.","quote":"In this paper we extend this solution to the general case of the Mittag‑Leﬄer kernel with λ ≥0. We provide numerical evidence of the convergence of the solution.","summary":"Previously, in [“GR19”], we derived a rational approximation of the solution of the rough Heston fractional ODE in the special case λ= 0, which corresponds to a pure power-law kernel. In this paper we extend this solution to the general case of the Mittag-Leffler kernel with λ\\geq 0. We provide…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The kernel parameter λ is non‑negative (λ ≥ 0).","type":"model","stated":"explicit","quote":"In the case λ ≥0, the rough Heston model of [JR16] may be written in forward variance form"},{"assumption":"Realistic rough Heston parameters are H = 0.05, ν = 0.4, ρ = −0.65, λ = 1.","type":"model","stated":"explicit","quote":"In the following, we assume the following realistic rough Heston parameters: H = 0.05; ν = 0.4; ρ = −0.65; λ = 1."}]},"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":"unclear","findings":[{"finding":"Rational approximations h(3,3), h(4,4) and h(5,5) are almost indistinguishable from the 1,000‑step Adams estimate and are significantly faster to compute than the classical Heston solution.","kind":"theoretical","quote":"h(3,3), h(4,4) and h(5,5) are almost indistinguishable from the 1,000 step Adams estimate and signiﬁcantly better than h(2,2). Moreover, all of these rational approximations are at least as fast to compute as the classical Heston solution."},{"finding":"Approximation quality decreases as H increases, but h(5,5) remains very accurate even in the classical case H = ½.","kind":"theoretical","quote":"It turns out that the quality of the rational approximations decreases as H increases from 0 to 1/2, which corresponds to the classical Heston model"},{"finding":"Numerical evidence shows exponential convergence of the diagonal approximants h(n,n) with respect to the order n.","kind":"theoretical","quote":"we have provided numerical evidence of exponential convergence of the h(n,n) with respect to the approximation order n."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":13,"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-14T18:20:41Z"},"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/"}