{"paper_id":"2309.04557","title":"Regret-Optimal Federated Transfer Learning for Kernel Regression with Applications in American Option Pricing","authors":["Xuwei Yang","Anastasis Kratsios","Florian Krach","Matheus Grasselli","Aurelien Lucchi"],"paper_date":"2023-09-08","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2309.04557v2","page_url":"https://thequant.space/flowcharts/regret-optimal-federated-transfer-learning-for-kernel-regres/","scores":{"empirical_rigor":6,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes an optimal iterative scheme for federated transfer learning that minimizes cumulative deviation of parameters across datasets while respecting the loss of the final model.","quote":"We propose an optimal iterative scheme for federated transfer learning, where a central planner has access to datasets ${\\cal D}_1,\\dots,{\\cal D}_N$ for the same learning model $f_θ$.","summary":"We propose an optimal iterative scheme for federated transfer learning, where a central planner has access to datasets \" D\"1,,\" D\"N for the same learning model f_θ. Our objective is to minimize the cumulative deviation of the generated parameters “θ_i(t)\"“t=0”^T across all T iterations from the…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"All data samples satisfy bounded feature and label norms: \\|u_i^j\\|_2 \\le K_x and |y_i^j|^2 \\le K_y.","type":"data","stated":"explicit","quote":"Assumption 1 (D-Boundedness). There are constants Kx, Ky > 0 such that all (x_i^j, y_i^j)"}]},"datasets":{"status":"available","items":[{"name":"Synthetic \"true market dynamics\" D1 and similar datasets D2,…,DN","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"We generate our synthetic “true market dynamics” D1 and several more or less similar datasets D2, . . . , D_N."}],"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 regret‑optimal method (RO) with information sharing level η=100 outperforms the local optimizer on the main dataset by 9%.","kind":"performance","quote":"η = 100 leads to the best result outperforming the local optimizer of the main dataset (LO-1) by 9%."},{"finding":"RO with η=100 also outperforms the joint subset optimizer by about 3%, showing superior transfer learning ability.","kind":"performance","quote":"This joint subset optimizer is significantly outperformed by our regret-optimal algorithm RO (η = 100) by about 3%."},{"finding":"The regret‑optimal algorithm has computational complexity O(N 2p^3 + T (Np)^{2.373}).","kind":"theoretical","quote":"we show that our regret-optimal algorithm has a computational complexity of O(N 2p3 + T (Np)2.373)."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":12,"citations":{"cited_by_in_corpus":2,"by_independent_authors":0,"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":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:22:15Z"},"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/"}