{"paper_id":"2401.13314","title":"An Explicit Scheme for Pathwise XVA Computations","authors":["Lokman Abbas-Turki","Stéphane Crépey","Botao Li","Bouazza Saadeddine"],"paper_date":"2024-01-24","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2401.13314v1","page_url":"https://thequant.space/flowcharts/an-explicit-scheme-for-pathwise-xva-computations/","scores":{"empirical_rigor":6,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes an explicit simulation/regression scheme for anticipated BSDEs arising in XVA computations, using neural network least‑squares and quantile regressions.","quote":"we introduce a simulation/regression scheme for a class of anticipated BSDEs, where the coefficient entails a conditional expected shortfall of the martingale part of the solution. The scheme is explicit in time and uses neural network least-squares and quantile regressions for the embedded conditional expectations and","summary":"Motivated by the equations of cross valuation adjustments (XVAs) in the realistic case where capital is deemed fungible as a source of funding for variation margin, we introduce a simulation/regression scheme for a class of anticipated BSDEs, where the coefficient entails a conditional expected…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Coefficients b(t,x) and σ(t,x) are Lipschitz in x uniformly in t and have linear growth in x.","type":"model","stated":"explicit","quote":"for coefficients b(t, x) and σ(t, x) Lipschitz in x uniformly in t ∈[0, T] and with linear growth in x."},{"assumption":"Every (F,P) martingale in S^2 starting from 0 admits a representation Z·W + U·µ.","type":"model","stated":"explicit","quote":"starting from 0 has a representation of the form"},{"assumption":"The map Φ_h is Lipschitz in its arguments.","type":"model","stated":"explicit","quote":"Φ_h is assumed Λ_h^Φ Lipschitz in the sense mimicking (9) that … ≤Λ_h^Φ …"},{"assumption":"The process γ(b)(t,X_t)(P_c J(t,X_t)M_t^c(t,X_t)) is in H^2 (e.g., γ(b) bounded).","type":"model","stated":"explicit","quote":"Assumption 2.2(ii) holds provided the process γ(b)(t, X_t)(P_c J(t"},{"assumption":"The XVA equations have zero terminal conditions.","type":"model","stated":"explicit","quote":"as all our XVA equations are endowed with zero terminal conditions"}]},"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":"pricing-calibration","findings":[{"finding":"The explicit scheme dominates the implicit/Picard scheme in computation time, being roughly 3–4 times faster.","kind":"performance","quote":"the Picard scheme comes at the cost of j = 3-4 times longer computations (for reference, the explicit scheme takes 7mins 48secs using the finest time grid, i.e. θ = 8, on an NVidia A100 GPU)."},{"finding":"Both schemes produce mutually validating XVA numbers, with the Picard iteration converging after a few steps to results visually close to the explicit scheme.","kind":"theoretical","quote":"toward a solution visually very close, already for j = 4, to the one provided by the explicit scheme"},{"finding":"Mean and quantiles of CVA, FVA, KVA and EC learned by the explicit scheme are reported across different time‑step sizes.","kind":"statistical","quote":"Figure 1: Mean and quantiles of CVA, FVA, KVA and EC learned by the explicit scheme at t = T/2 for different sizes of the time step."},{"finding":"Local regression errors (L2) decrease with finer time discretization, confirming the accuracy of the regression components.","kind":"statistical","quote":"L2 error against conditional expectation at time t"}],"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":3,"by_independent_authors":2,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":3},"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/BouazzaSE/NeuralXVA","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:15:48Z"},"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/"}