{"paper_id":"2410.22568","title":"Fast Deep Hedging with Second-Order Optimization","authors":["Konrad Mueller","Amira Akkari","Lukas Gonon","Ben Wood"],"paper_date":"2024-10-29","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2410.22568v1","page_url":"https://thequant.space/flowcharts/fast-deep-hedging-with-second-order-optimization/","scores":{"empirical_rigor":7,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a second‑order optimization scheme for deep hedging that uses a block‑diagonal, Kronecker‑factored curvature matrix to precondition gradients.","quote":"To address this, we propose a second-order optimization scheme for deep hedging. We leverage pathwise differentiability to construct a curvature matrix, which we approximate as block-diagonal and Kronecker-factored to efficiently precondition gradients.","summary":"Hedging exotic options in presence of market frictions is an important risk management task. Deep hedging can solve such hedging problems by training neural network policies in realistic simulated markets. Training these neural networks may be delicate and suffer from slow convergence, particularly…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Proportional transaction costs are assumed and accumulate linearly with trade size.","type":"execution","stated":"explicit","quote":"For simplicity, we consider proportional transaction costs that accumulate to 𝐶𝑇(𝑢) :="},{"assumption":"The curvature matrix can be approximated as block‑diagonal and Kronecker‑factored (KFAC).","type":"model","stated":"explicit","quote":"We leverage pathwise differentiability to construct a curvature matrix, which we approximate as block-diagonal and Kronecker-factored to efficiently precondition gradients."},{"assumption":"KFAC applicability requires the Hessian to be invertible.","type":"statistical","stated":"explicit","quote":"We assume this for KFAC applicability; the invariance only requires invertibility."},{"assumption":"The underlying asset follows a stochastic volatility model.","type":"market","stated":"explicit","quote":"hedging a cliquet option on a stock with stochastic volatility by trading in the spot and vanilla options."},{"assumption":"The cliquet option is locally‑capped and globally‑floored in a standard form.","type":"other","stated":"explicit","quote":"We consider a standard form of the locally-capped, globally-floored cliquet option, which pays at maturity ..."}]},"datasets":{"status":"available","items":[{"name":"Synthetic cliquet‑option hedging simulation","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"We evaluate our method on a challenging and practically important problem: hedging a cliquet option on a stock with stochastic volatility by trading in the spot and vanilla options."}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"available","modeled":"yes","headline_net_of_costs":null,"detail":"Proportional transaction costs c per instrument are included in the objective as E[C_T(u)] and in the inner Hessian via a scaled L2 cost ˜c = 8c.","quote":"For simplicity, we consider proportional transaction costs that accumulate to 𝐶𝑇(𝑢) :=","source":"evidence_card","rule":"R2","candidates":{"front_matter":"unclear","evidence_card":"yes","evidence_card_quoted":true},"card_detail":"Proportional transaction costs c per instrument are included in the objective as E[C_T(u)] and in the inner Hessian via a scaled L2 cost ˜c = 8c.","card_quote":"For simplicity, we consider proportional transaction costs that accumulate to 𝐶𝑇(𝑢) :=","meaning":"costs are part of the reported headline results"},"results":{"status":"available","evaluation_type":"pricing-calibration","findings":[{"finding":"The second‑order DH‑KFAC scheme reaches the target validation loss in about 25% of the steps required by Adam.","kind":"performance","quote":"DH‑KFAC progresses significantly faster than Adam and only requires about 25% of Adam’s number of steps to reach the targeted loss level."},{"finding":"DH‑KFAC optimizes the policy in one‑quarter the number of steps compared to standard adaptive‑moment methods.","kind":"performance","quote":"we find that our second‑order scheme can optimize the policy in 1/4 of the number of steps that standard adaptive moment‑based optimization takes."},{"finding":"The learned hedging policy reduces PnL variance, with option hedging cutting the standard deviation by another 50% and increasing skewness.","kind":"performance","quote":"Including option hedging reduces the PnL’s standard deviation by another 50% and increases the skewness of the PnL distribution significantly."}],"reported_performance":null,"out_of_sample":{"method":"holdout","headline_out_of_sample":null}},"independent_evidence":{"status":"available","supports":[],"contradicts":[],"qualifies":[],"compared_with":24,"citations":{"cited_by_in_corpus":3,"by_independent_authors":3,"how_cited":{"used_as_baseline":0,"uses_method_or_data":1,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":1},"independent_papers":[{"paper":{"paper_id":"2510.16938","title":"A Topological Approach to Parameterizing Deep Hedging Networks","paper_date":"2025-10-19","authors":["Alok Das","Kiseop Lee"],"empirical_rigor":6.5,"page_url":"https://thequant.space/flowcharts/a-topological-approach-to-parameterizing-deep-hedging-networks/"},"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":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-14T17:57:28Z"},"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/"}