{"paper_id":"2408.06531","title":"Adaptive Multilevel Stochastic Approximation of the Value-at-Risk","authors":["Stéphane Crépey","Noufel Frikha","Azar Louzi","Jonathan Spence"],"paper_date":"2024-08-12","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2408.06531v1","page_url":"https://thequant.space/flowcharts/adaptive-multilevel-stochastic-approximation-of-the-value-at/","scores":{"empirical_rigor":3,"math_complexity":9.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes and analyzes a multilevel stochastic approximation algorithm that adaptively selects the number of inner samples at each level, achieving a best complexity of O(ε^{-2}|\\ln{\\varepsilon}|^{5/2}).","quote":"To mitigate this issue, this paper proposes and analyzes a multilevel stochastic approximation algorithm that adaptively selects the number of inner samples at each level, and proves that its best complexity is in O($\\varepsilon^{-2}|\\ln{\\varepsilon}|^\\frac52$).","summary":"Crépey, Frikha, and Louzi (2023) introduced a multilevel stochastic approximation scheme to compute the value-at-risk of a financial loss that is only simulatable by Monte Carlo. The optimal complexity of the scheme is in O(\"ε\"^\"-5/2\"), \"ε\" > 0 being a prescribed accuracy, which is suboptimal when…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"For all h in H, the distribution function FXh admits a first order Taylor expansion FXh(ξ) - FX0(ξ) = v(ξ)h + w(ξ,h)h with bounded integrals of v and vanishing w as h→0.","type":"statistical","stated":"explicit","quote":"(i) For all h ∈H, FXh admits the first order Taylor expansion FXh(ξ) −FX0(ξ) = v(ξ)h + w(ξ, h)h, ξ ∈R, for some functions v, w(·, h) : R →R satisfying, for all ξ0 ⋆∈Argmin V0, Z ∞ ξ0⋆ v(ξ)dξ < ∞, lim H∋h↓0 w(ξ0 ⋆, h) = lim H∋h↓0 Z ∞ ξ0⋆ w(ξ, h)dξ = 0.","support":"full"},{"assumption":"For all h in H, the law of Xh admits a continuous probability density function fXh.","type":"model","stated":"explicit","quote":"(2.12) (ii) For all h ∈H, the law of Xh admits a continuous pdf fXh with respect to the Lebesgue measure.","support":"full"},{"assumption":"The densities fXh converge locally uniformly to fX0 as h→0.","type":"model","stated":"explicit","quote":"Moreover, the pdf (fXh)h∈H converge locally uniformly to fX0.","support":"full"},{"assumption":"For any radius R>0, the density fXh is bounded away from zero on the ball B(ξ0*,R) uniformly over h.","type":"statistical","stated":"explicit","quote":"(iii) For all R > 0, inf h∈H,ξ∈B(ξ0⋆,R) fXh(ξ) > 0.","support":"full"},{"assumption":"The densities fXh are uniformly bounded and uniformly Lipschitz.","type":"statistical","stated":"explicit","quote":"(iv) The pdf (fXh)h∈H are uniformly bounded and uniformly Lipschitz, namely, sup h∈H (∥fXh∥∞+ [fXh]Lip) < ∞, where [fXh]Lip denotes the Lipschitz constant of fXh, h ∈H. 5 Remark 2.4 ([15, Remark 1.2]).","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Synthetic nested Monte Carlo loss model","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"The nested Monte Carlo averaging (2.7) is thus available to ap-proximate (7.2), hence the applicability of NSA, adNSA, σ-adNSA, u-adNSA, MLSA, adMLSA, σ-adMLSA and u-adMLSA to approximate the VaR.","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 adaptive multilevel stochastic approximation scheme attains the canonical ε^{-2} multilevel complexity up to a logarithmic factor, closing the performance gap with unbiased Robbins-Monro schemes.","kind":"theoretical","quote":"8 Conclusion For a prescribed accuracy ε > 0, the canonical ε−2 multilevel complexity order is retrieved, up to a logarithmic factor, for an MLSA scheme with a Heaviside-type update function. This is made possible by adopting an adaptive refinement strategy on the samples driving the multilevel algorithm’s inner nested schemes.","support":"full"},{"finding":"Adaptive MLSA achieves a two‑fold speed‑up over its non‑adaptive counterpart in numerical experiments.","kind":"performance","quote":"The overperformance over u-adNSA can be explained by the desaturated refinement strategy used by the latter algorithm. adMLSA, σ-adMLSA and u-adMLSA show to be outperforming MLSA: for a target RMSE of order 10−2, adMLSA, σ-adMLSA and u-adMLSA run on average in 1s while MLSA runs in 2s, achieving a 2-fold speed-up over their non-adaptive counterpart. σ-adMLSA seems to be slightly outperforming adMLSA, The performance","support":"full"},{"finding":"The proposed algorithm reduces the complexity from O(ε^{-5/2}) to O(ε^{-2}|\\ln{\\varepsilon}|^{5/2}).","kind":"theoretical","quote":"The best complexity of the scheme is in O($\\varepsilon^{-\\frac52}$), $\\varepsilon>0$ being a prescribed accuracy, which is suboptimal compared to the canonical multilevel Monte Carlo performance. To mitigate this issue, this paper proposes and analyzes a multilevel stochastic approximation algorithm that adaptively selects the number of inner samples at each level, and proves that its best complexity is in","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":14,"citations":{"cited_by_in_corpus":4,"by_independent_authors":4,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":2,"unclassified":2},"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/azarlouzi/ada_mlsa","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":2,"extracted_at":"2026-11-14T19:56:04Z"},"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/"}