{"paper_id":"2306.03822","title":"Swing contract pricing: with and without Neural Networks","authors":["Vincent Lemaire","Gilles Pagès","Christian Yeo"],"paper_date":"2023-06-06","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2306.03822v4","page_url":"https://thequant.space/flowcharts/swing-contract-pricing-with-and-without-neural-networks/","scores":{"empirical_rigor":7,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes two parametric approaches to evaluate swing contracts, one using an explicit parametric function and another using a neural network to parameterize the optimal control.","quote":"We propose two parametric approaches to evaluate swing contracts with firm constraints. Our objective is to define approximations for the optimal control, which represents the amounts of energy purchased throughout the contract.","summary":"We propose two parametric approaches to evaluate swing contracts with firm constraints. Our objective is to define approximations for the optimal control, which represents the amounts of energy purchased throughout the contract. The first approach involves approximating the optimal control by means…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Interest rates are assumed to be zero.","type":"model","stated":"explicit","quote":"we will assume to be zero from now on."},{"assumption":"The swing contract has firm (non‑violable) local and global volume constraints.","type":"other","stated":"explicit","quote":"In this paper, we only consider firm constraints which means that the holder of the contract is not allowed to violate the constraints."},{"assumption":"The underlying dynamics are simulated offline via nearest‑neighbour projections (quantization tree).","type":"model","stated":"explicit","quote":"This tree is built offline by nearest neighbour projections of simulated paths of the underlying dynamics."}]},"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":"Using Langevin‑type optimization (PSGLD) yields better swing contract prices than state‑of‑the‑art methods with short computation time.","kind":"pricing-calibration","quote":"Our results show that using Langevin-type algorithms can accelerate the optimization of our parameterizations and leads to better prices compared to the state-of-the-art methods."},{"finding":"The neural‑network parameterization achieves a price of 708.46 (95% CI [705.76, 711.16]) compared to 645.3 for the benchmark method.","kind":"performance","quote":"Results using NN strat. A confidence interval (95%) is in brackets. For the neural network architecture we used I = 2 layers with q1 = q2 = 50 units."}],"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":2,"by_independent_authors":1,"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":true,"code_url":"https://github.com/ChristianYeo/swing_parametric_strategies","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:25:57Z"},"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/"}