FedPref: Federated Preference Learning for Structured Radiology Report Extraction

• URL: http://arxiv.org/abs/2608.16971v1
• Date: Mon, 17 Aug 2026 12:29:42 GMT
• Title: FedPref: Federated Preference Learning for Structured Radiology Report Extraction
• Abstract summary: Radiology reports describe findings and locations in free text, but downstream search and analysis require these relations in a fixed schema.<n>We introduce FedPref: frozen public language models propose alternative extractions, local annotations rank them, and sites collaboratively train pooled compact Qwen3-8B adapters.<n>On development data from six simulated hospitals with unequal data volume and disease prevalence, FedPref improves client-mean F1 by 2.49 points and worst-site F1 by 9.10 points compared with training each site in isolation.
• Score: 69.11739400975445
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Radiology reports describe findings and locations in free text, but downstream search and analysis require these relations in a fixed schema. Learning this extraction requires labels that are unevenly distributed across institutions: smaller hospitals have less local evidence, and pooling data may be infeasible. We introduce FedPref: frozen public language models propose alternative JSON extractions, local annotations rank them, and sites collaboratively train compact Qwen3-8B adapters while sharing only model updates. A heterogeneous teacher pool provides cross-model contrast when repeated single-model samples collapse. On development data from six simulated hospitals with unequal data volume and disease prevalence, FedPref improves client-mean F1 by 2.49 points and worst-site F1 by 9.10 points compared with training each site in isolation, with the largest gains at the sites holding the least data. Central training on the pooled preference-pair union is 2.66 points higher on client-mean F1. On a locked, 400-report manually validated gold test set, FedPref reaches 68.68 F1 and pooled training 71.67, preserving that same ordering. FedPref thus lets institutions with unequal, unpooled data benefit from collaboration without ever sharing reports or annotations.

Related papers

• FedDRAW: Federated Dual Reputation Annealing Weighting for Heterogeneous Multi-Institutional Chest Radiograph Classification [1.0384586035475536]
  We propose Federated Dual Reputation Annealing Weighting (FedDRAW) as a server-side aggregation method.<n>FedDRAW achieves the highest average rank among all eight methods under both AUC and the geometric mean (GM) of sensitivity and specificity.<n> Scheduling two signals, rather than fixing the weights by sample count alone, could enable less biased diagnostic models.
  arXiv  Detail & Related papers  (2026-09-04T14:53:31Z)
• Federated LoRA Adaptation of BiomedCLIP Across Four International Chest X-Ray Cohorts [3.8298947210288374]
  Federated learning lets institutions train a shared model without exchanging data.<n>Low-Rank Adaptation (LoRA) makes this practical at scale by communicating only compact low-rank updates.
  arXiv  Detail & Related papers  (2026-09-02T04:40:05Z)
• FederatedRSF : Federated Random Survival Forests for Partially Overlapping Medical Data [1.0303353919699785]
  FederatedRSF implements random survival forests, aggregating locally trained survival trees and redistributing only feature-compatible trees to each site.<n>We evaluate FederatedRSF on the GBSG2 breast cancer cohort distributed with the scikit-survival package.
  arXiv  Detail & Related papers  (2026-05-21T18:32:25Z)
• Fractional-Order Federated Learning [4.1751058176413105]
  Federated learning (FL) allows remote clients to train a global model collaboratively while protecting client privacy.<n>Despite its privacy-preserving benefits, FL has significant drawbacks, including slow convergence, high communication cost, and non-independent-and-identically-distributed (non-IID) data.
  arXiv  Detail & Related papers  (2026-02-17T06:25:23Z)
• Federated Few-Shot Learning for Epileptic Seizure Detection Under Privacy Constraints [1.4150452759904846]
  We propose a two-stage federated few-shot learning framework for personalized EEG-based seizure detection.<n>In Stage 1, a pretrained biosignal transformer (BIOT) is fine-tuned across non-IID simulated hospital sites using federated learning.<n>In Stage 2, federated few-shot personalization adapts the classifier to each patient using only five labeled EEG segments.
  arXiv  Detail & Related papers  (2025-12-09T16:01:35Z)
• Prediction-space knowledge markets for communication-efficient federated learning on multimedia tasks [0.0]
  Federated learning (FL) enables collaborative training over distributed multimedia data.<n>We propose KTA v2, a prediction-space knowledge trading market for FL.<n>Experiments on FEMNIST, CIFAR-10 and AG News show that KTA v2 consistently outperforms a local-only baseline and strong parameter-based methods.
  arXiv  Detail & Related papers  (2025-11-30T11:24:19Z)
• Federated Block-Term Tensor Regression for decentralised data analysis in healthcare [2.756275481133711]
  Block-Term Regression (BTTR) has proven to be a powerful tool for modeling complex, high-dimensional data by leveraging multilinear relationships.<n>We introduce Federated Block-Term Regression (FBTTR), an extension of FBR designed for federated learning scenarios.
  arXiv  Detail & Related papers  (2024-12-02T12:40:07Z)
• A Federated Learning Framework for Stenosis Detection [70.27581181445329]
  This study explores the use of Federated Learning (FL) for stenosis detection in coronary angiography images (CA) Two heterogeneous datasets from two institutions were considered: dataset 1 includes 1219 images from 200 patients, which we acquired at the Ospedale Riuniti of Ancona (Italy) dataset 2 includes 7492 sequential images from 90 patients from a previous study available in the literature.
  arXiv  Detail & Related papers  (2023-10-30T11:13:40Z)
• FedSkip: Combatting Statistical Heterogeneity with Federated Skip Aggregation [95.85026305874824]
  We introduce a data-driven approach called FedSkip to improve the client optima by periodically skipping federated averaging and scattering local models to the cross devices. We conduct extensive experiments on a range of datasets to demonstrate that FedSkip achieves much higher accuracy, better aggregation efficiency and competing communication efficiency.
  arXiv  Detail & Related papers  (2022-12-14T13:57:01Z)
• Heterogeneous Federated Learning via Grouped Sequential-to-Parallel Training [60.892342868936865]
  Federated learning (FL) is a rapidly growing privacy-preserving collaborative machine learning paradigm. We propose a data heterogeneous-robust FL approach, FedGSP, to address this challenge. We show that FedGSP improves the accuracy by 3.7% on average compared with seven state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-01-31T03:15:28Z)
• Examining and Combating Spurious Features under Distribution Shift [94.31956965507085]
  We define and analyze robust and spurious representations using the information-theoretic concept of minimal sufficient statistics. We prove that even when there is only bias of the input distribution, models can still pick up spurious features from their training data. Inspired by our analysis, we demonstrate that group DRO can fail when groups do not directly account for various spurious correlations.
  arXiv  Detail & Related papers  (2021-06-14T05:39:09Z)
• WAFFLe: Weight Anonymized Factorization for Federated Learning [88.44939168851721]
  In domains where data are sensitive or private, there is great value in methods that can learn in a distributed manner without the data ever leaving the local devices. We propose Weight Anonymized Factorization for Federated Learning (WAFFLe), an approach that combines the Indian Buffet Process with a shared dictionary of weight factors for neural networks.
  arXiv  Detail & Related papers  (2020-08-13T04:26:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.