{"paper_id":"2504.20250","title":"Financial Data Analysis with Robust Federated Logistic Regression","authors":["Kun Yang","Nikhil Krishnan","Sanjeev R. Kulkarni"],"paper_date":"2025-04-28","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2504.20250v1","page_url":"https://thequant.space/flowcharts/financial-data-analysis-with-robust-federated-logistic-regre/","scores":{"empirical_rigor":6.5,"math_complexity":4,"quadrant":"Street Traders"},"proposes":{"status":"available","statement":"The paper proposes a robust federated logistic regression framework with robust aggregation to handle outliers while remaining interpretable.","quote":"we propose a robust federated logistic regression-based framework that strives to strike a balance between these goals.","summary":"In this study, we focus on the analysis of financial data in a federated setting, wherein data is distributed across multiple clients or locations, and the raw data never leaves the local devices. Our primary focus is not only on the development of efficient learning frameworks (for protecting user…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"All data is stored and centralized at one location with full access.","type":"data","stated":"explicit","quote":"these classical (supervised) machine learning based solutions, such as logistic regression and random forest, usually implicitly assume that 1) all the data is stored and centralized at one location, typically a single machine, and that we have full access to the entire data"},{"assumption":"The provided data is clean and free from outliers introduced by malicious adversaries.","type":"data","stated":"explicit","quote":"the provided data is clean and free from outliers introduced by malicious adversaries, as it is stored at a single location equipped with high security protection mechanisms to prevent data corruption"},{"assumption":"IID data generation: each client’s data follows the same distribution as the original data.","type":"data","stated":"explicit","quote":"We refer to this data generation process for clients as IID because it ensures that each client’s data follows the same distribution as the original data"},{"assumption":"A large sample size for each class (at least 10 observations per variable).","type":"statistical","stated":"explicit","quote":"A large sample size for each class: A general guideline in [45] suggests to have at least 10 observations with the least frequent outcome for each independent variable in the model"}]},"datasets":{"status":"available","items":[{"name":"BankMarketing","provider":"Portuguese banking institution","kind":"other","access":"public","period":null,"universe":null,"quote":"[...] The data is related to direct marketing campaigns of a Portuguese banking institution. The marketing campaigns were based on phone calls. The goal is to predict whether a client will subscribe a term deposit or not."},{"name":"LoanPred","provider":"Univ.AI (Hackathon)","kind":"other","access":"public","period":null,"universe":null,"quote":"[...] The dataset belongs to a Hackathon organized by “Univ.AI” that collected historic customer behavior. The goal is to predict who possible defaulters are for the consumer loans product."},{"name":"Fourth public dataset","provider":null,"kind":"other","access":"public","period":null,"universe":null,"quote":"Table 1: Four public datasets with various number of features and classes for binary and multi-class classification tasks."}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"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":"forecast-accuracy","findings":[{"finding":"The proposed robust federated logistic regression achieves comparable performance to classical centralized algorithms (LR, DT, KNN) on both binary and multi-class tasks.","kind":"performance","quote":"our proposed method can achieve comparable performance to those of classical centralized algorithms, such as Logistical Regression, Decision Tree, and K-Nearest Neighbors, in both binary and multi-class classification tasks"},{"finding":"The framework’s performance is not sensitive to sample size when s ≥ 50 and to the number of clients M.","kind":"performance","quote":"our framework does not seem to be affected by the sample size s much, especially when s >= 50; 2) this also applies to the number of clients M"},{"finding":"The framework remains robust across different percentages of outliers.","kind":"performance","quote":"our framework is robust to different percentages of outliers pout"}],"reported_performance":null,"out_of_sample":{"method":"unclear","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":13,"citations":{"cited_by_in_corpus":1,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"unclassified":0},"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-14T17:39:54Z"},"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/"}