{"paper_id":"2408.09185","title":"Method of Moments Estimation for Affine Stochastic Volatility Models","authors":["Yan-Feng Wu","Xiangyu Yang","Jian-Qiang Hu"],"paper_date":"2024-08-17","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2408.09185v1","page_url":"https://thequant.space/flowcharts/method-of-moments-estimation-for-affine-stochastic-volatilit/","scores":{"empirical_rigor":3,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes moment estimators for the parameters of affine stochastic volatility models, including a recursive equation for closed-form moments and a central limit theorem with explicit asymptotic covariance.","quote":"We develop moment estimators for the parameters of affine stochastic volatility models.","summary":"We develop moment estimators for the parameters of affine stochastic volatility models. We first address the challenge of calculating moments for the models by introducing a recursive equation for deriving closed-form expressions for moments of any order. Consequently, we propose our moment…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The initial asset price s(0) and variance v(0) are independent of each other and of the driving Brownian motions.","type":"model","stated":"explicit","quote":"Assume that the initial values s(0) and v(0) are independent of each other and also independent of ws(t) and wv(t).","support":"full"},{"assumption":"The variance process follows a Cox‑Ingersoll‑Ross (square‑root) diffusion with parameters satisfying σ_v^2 ≤ 2kθ.","type":"model","stated":"explicit","quote":"The variance process (4) is a Cox-Ingersoll-Ross process (Cox et al., 1985), which is also called square-root diﬀusion. The parameters θ > 0, 5 k > 0, and σv determine the long-run mean, the mean reversion velocity, and the volatility of the variance process v(t), respectively, and satisfy the condition σ2 v ≤2kθ.","support":"full"},{"assumption":"The simulation uses a first‑order Euler approximation with step h=1 and 20 sub‑steps per interval.","type":"data","stated":"explicit","quote":"To generate sample observations for the Heston model, we use the ﬁrst order Euler approximation method in which we set h = 1 and partition each interval into 20 smaller segments for approximation.","support":"full"},{"assumption":"The sample moments required are of relatively low order, even though the recursive formula can generate moments of any order.","type":"statistical","stated":"explicit","quote":"In fact, we have established a recursive equation for deriving closed-form expressions for moments of any order, while our MM estimators only require those moments of relatively low order.","support":"full"},{"assumption":"The estimators are derived under the assumption that high‑frequency or option price data are not required.","type":"data","stated":"explicit","quote":"The advantage of our estimators is that they are simple and easy to implement in practice and do not require the availability of high-frequency data or option price data.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Synthetic Heston model simulations","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"To generate sample observations for the Heston model, we use the ﬁrst order Euler approximation method in which we set h = 1 and partition each interval into 20 smaller segments for approximation. For each parameter setting, we run 400 replications with 400K samples for each replication.","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":"none","findings":[{"finding":"The proposed moment estimators are fairly accurate, with mean estimates close to true parameter values across 400 replications.","kind":"statistical","quote":"The results show our estimators are fairly accurate.","support":"partial"},{"finding":"Estimator accuracy improves with larger sample size N at the rate 1/√N.","kind":"statistical","quote":"The results are provided in Table 2, which show as N increases the accuracy of our estimators improves at the rate of 1/ √ N. We run the third set of experiments to test the eﬀect of h on our estimators.","support":"full"},{"finding":"The method is not very sensitive to the discretization step h.","kind":"statistical","quote":"It is clear that the accuracy of our estimators is not very sensitive to the value of h.","support":"full"},{"finding":"Compared to MCMC, the moment method achieves similar or better accuracy while being orders of magnitude faster (less than a second versus over an hour per replication).","kind":"performance","quote":"MCMC is very time-consuming and it takes more than one hour for each replication while our method takes less than a second.","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":26,"citations":{"cited_by_in_corpus":2,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":2},"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:55:56Z"},"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/"}