{"paper_id":"2405.00701","title":"Learning parameter dependence for Fourier-based option pricing with tensor trains","authors":["Rihito Sakurai","Haruto Takahashi","Koichi Miyamoto"],"paper_date":"2024-04-17","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2405.00701v8","page_url":"https://thequant.space/flowcharts/learning-parameter-dependence-for-fourier-based-option-prici/","scores":{"empirical_rigor":6,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a tensor‑train learning based pricing method that builds tensor trains to approximate functions in Fourier‑transform based option pricing with parameter dependence, enabling fast evaluation for varying inputs.","quote":"Here, we propose a pricing method, where, by a tensor train learning algorithm, we build tensor trains that approximate functions appearing in FT-based option pricing with their parameter dependence and efficiently calculate the option price for the varying input parameters.","summary":"A long-standing issue in mathematical finance is the speed-up of option pricing, especially for multi-asset options. A recent study has proposed to use tensor train learning algorithms to speed up Fourier transform (FT)-based option pricing, utilizing the ability of tensor trains to compress…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Underlying asset dynamics follow the Black‑Scholes SDE with constant risk‑free rate and constant volatilities.","type":"model","stated":"explicit","quote":"... where r ∈R and σ1, · · · , σd > 0 are constant parameters called the risk‑free interest rate and the volatilities, respectively."},{"assumption":"Brownian motions driving assets have a constant correlation matrix ρij.","type":"model","stated":"explicit","quote":"W1(t), · · · , Wd(t) are the Brownian motions with constant correlation matrix ρij, namely dWm(t)dWn(t) = ρmndt,"},{"assumption":"Option considered is European with payoff max(c(∏S_i(T)−K),0).","type":"other","stated":"explicit","quote":"…(T) −K), 0}, where c = 1 and −1 for a call and put option, respectively."},{"assumption":"Parameter grid for volatilities and initial stock prices is discretized on integer‑labeled points.","type":"data","stated":"implied","quote":"we assume that, in reality, the grid points in Rd is labeled by integers and the indexes of the tensor denotes the integers."}]},"datasets":{"status":"available","items":[{"name":"Multi‑asset option benchmark (volatility and stock‑price variations)","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":"up to 11 assets","quote":"As a benchmark test, we run the proposed method to price a multi‑asset option for the various values of volatilities and present asset prices."},{"name":"Monte Carlo reference (10^6 paths)","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":"up to 11 assets","quote":"the proposed method outperforms Monte Carlo‑based option pricing with $10^6$ paths in terms of computational complexity while keeping"}],"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 TT‑based method outperforms Monte Carlo with 10^6 paths in computational complexity for up to 11 assets while maintaining comparable or better accuracy.","kind":"performance","quote":"we show that, in the tested cases involving up to 11 assets, the proposed method outperforms Monte Carlo‑based option pricing with $10^6$ paths in terms of computational complexity while keeping"},{"finding":"In all tested cases the error of the TT‑based result is smaller than that of the MC‑based result.","kind":"pricing-calibration","quote":"the error in the TT‑based result is smaller than that in the MC‑based result in all the tested cases."},{"finding":"TT‑based option pricing demonstrates superiority over Monte Carlo in both computational complexity and runtime for d=5 and d=10 after SVD compression.","kind":"performance","quote":"TT‑based option pricing demonstrates superiority over the Monte Carlo method in terms of computational complexity and time."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"available","supports":[],"contradicts":[],"qualifies":[],"compared_with":24,"citations":{"cited_by_in_corpus":2,"by_independent_authors":2,"how_cited":{"used_as_baseline":0,"uses_method_or_data":2,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[{"paper":{"paper_id":"2601.00009","title":"Full grid solution for multi-asset options pricing with tensor networks","paper_date":"2025-12-20","authors":["Lucas Arenstein","Michael Kastoryano"],"empirical_rigor":7,"page_url":"https://thequant.space/flowcharts/full-grid-solution-for-multi-asset-options-pricing-with-tens/"},"how":"uses_method_or_data","quote":null},{"paper":{"paper_id":"2407.14573","title":"Trading Devil Final: Backdoor attack via Stock market and Bayesian Optimization","paper_date":"2024-07-21","authors":["Orson Mengara"],"empirical_rigor":2,"page_url":"https://thequant.space/flowcharts/trading-devil-final-backdoor-attack-via-stock-market-and-ba/"},"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-14T18:10:58Z"},"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/"}