Privacy-Preserving Genomic Analysis via PSO-Driven Federated Learning on Blockchain
Bibliographic record
Abstract
Federated learning, a distributed machine learning method, trains statistical models over remote devices or servers with local data, without exchanging data samples. It preserves patient data securely behind hospital firewalls, sharing only anonymous model parameters, enhancing privacy and security. This innovative approach exchanges only untraceable learned feature representations. This study introduces a new federated learning framework an innovative aggregation methods based on Particle Swarm Optimization (PSO) algorithm for breast cancer prognosis. To safeguard patient data privacy, a privacy mechanism is implemented at the user's end. By utilizing the federated learning model, they've addressed the data scarcity problem, leading to improved accuracy in breast cancer progno-sis. Federated learning, as mentioned earlier, protects personal data by sending model parameters to agents instead of raw data to a central node, keeping data localized. However, the risk of malicious nodes injecting fake data into the global model is a concern. To address this, we need a verification mechanism to authenticate senders and their training data while preserving data privacy. We use zero-knowledge proof (ZKP) for verification without exposing raw data for this part. At the outset of the federated learning process, each client computes the Merkle tree root hash of their local training data and submits it to the federated learning contract for participation. In subsequent training rounds, the client's compiler checks the integrity of their data by comparing the Merkle tree root hash to the initial one. If they match, a trace file is generated and sent for proof generation, verification, fact creation, and registration. Leveraging the TCGAbiolinks package, we conducted experiments demonstrating the effectiveness of our approach with real data. Learner clients enhance their local models using a PSO algorithm, achieving remarkable results in binary classification tasks with 400 features while preserving patient data privacy via ZKP integration. Our framework reaches 97% accuracy with eight clients, compared to a comparable system's 82%, highlighting its practical applicability and efficiency in real-world scenarios, particularly when dealing with larger numbers of participants.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.011 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.007 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.034 | 0.130 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; both teacher heads agree on what is shown here.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".