Skip to main content
Search

# Federated Learning

20 related articles

Subscribe to updates
  1. arXiv

    Different LLMs can now collaborate federatedly: FedVP pools locally trained verifiers instead of merging parameters

    Federated learning usually requires institutions to share one model backbone so parameter updates can be aggregated, which keeps centers running different model families or sizes from collaborating. FedVP moves collaboration from parameter aggregation to shared verification: each client trains a verifier on its local data and candidate responses from its own frozen LLM, and the server pools these independently trained verifiers to score and select answers, never merging backbone parameters. Across five medical question-answering datasets, with centers using Qwen and LLaMA backbones from 3B to 14B parameters, one verifier pool is reused for all five backbones without retraining and raises mean accuracy by 1.46 to 5.79 percentage points over the strongest conventional federated baselines.

  2. Buildings stop merging forecasts blindly: a local cross-fit gate avoids the 3% negative transfer that unconditional federation caused on Electricity

    Distributed building energy management depends on forecasts, yet federated forecasting is usually scored on error without testing the decisions those forecasts support. UtilityGossip keeps a private and a collaborative low-rank adapter at each node and accepts a peer adapter only when randomized four-fold cross-fitting on local held-out data shows a meaningful error reduction. On Electricity, unconditional federation raised mean squared error more than 3% above local training while the gated method avoided that degradation; on Solar-Energy at the 96-step horizon it lowered mean squared error by 1.59% relative to local training using half the communication of federated averaging.

  3. Vehicles Leave After One-Shot Training: Exact Federated Editing Cuts Cumulative Time 36%–44% in Mobility Simulation

    One-shot federated learning finishes training in a single communication round, but the resulting model is frozen once devices join or leave, leaving full retraining as the fallback. F-SOSA draws a fixed-size uniform random client subset so outputs under neighboring device sets stay bounded in total variation, then rewrites curvature-aware fusion as a projection over client-additive sufficient statistics, enabling F-SOSA-U for withdrawing a contribution and F-SOSA-I for adding one. In a SUMO urban mobility simulation, both match retraining accuracy while cutting cumulative time and communication by 36%–44% and 22%–33%.

  4. arXiv

    One self-supervised encoder lifts CWRU fault-classification macro-F1 from 0.350 to 0.812, but not remaining-useful-life accuracy

    Across 47 public PHM datasets harmonized to one tensor contract, an 801,808-parameter channel-independent Transformer encoder pretrained with masked patch prediction raises fault-classification macro-F1 from 0.350 to 0.812 on the fully withheld CWRU set and from 0.569 to 0.951 on HSG18, with frozen linear probing alone reaching 0.705 and 0.906; the same pretraining does not reliably beat a from-scratch baseline on CMAPSS remaining-useful-life estimation. Simulated federated pretraining over ten clients grouped by physical domain retains part of the representation but trails the centralized encoder at matched budget, and the self-supervised loss does not predict downstream utility.

  5. Private federated learning stops uploading whole updates: filtering shareable sport semantics per network stage lifts accuracy about four points under strong privacy

    Sports images sit with schools, clubs and other organizations, and federated learning avoids sending raw pictures but still transmits model updates that can leak information, while the clipping and noise of differential privacy damage useful knowledge. FedSS scores each network stage for how shareable it is before clipping, uploads only the perturbed cross-client sport semantics, and keeps client-specific appearance and background context local. On sport22 and sport100 it beats the strongest baseline DPSIR-Fed by 5.78 and 5.71 points under visual-context heterogeneity, and raises sport22 accuracy from 42.67% to 46.81% at the strong-privacy setting ε=4.

  6. arXiv

    Federated fine-tuning stops choosing sides: shared adapters plus a local vision projection hit 82.15 harmonic mean across ten datasets

    BLEND splits federated CLIP fine-tuning into shared vision and text adapters plus a per-client vision projection adapter, reaching an average harmonic mean of 82.15 across ten image datasets, 4.81 points above the strongest baseline.

  7. IoT devices stop trusting a one-time credential: behavioral fingerprints plus federated learning cut membership inference success from 48.2% to 12.4%

    IoT device authentication is shifting from a one-time check of fixed credentials to continuous checking of device behavior. Static credentials and centralized trust miss anomalies after a device is compromised and keep exposing identifiable attributes. A combined scheme uses hardware behavioral fingerprints, federated learning with differential privacy, a lightweight permissioned chain and agentic orchestration; on 11 Raspberry Pi devices in the PP-IDE dataset, differential privacy lowered membership inference attack success from 48.2% to 12.4%, with 99.2% authentication accuracy.

  8. arXiv

    Oilfield sites stop handing over traffic: secret shares leave servers one accept bit, holding F1 at 0.641 under 30% attackers

    Oilfield sites split each local-traffic update into secret shares so two non-colluding servers learn only accept or reject, holding macro-F1 at 0.641 against a 30% adaptive attacker where FedAvg falls to 0.046.

  9. arXiv

    Robust aggregators scrub federated watermarks: camouflaging watermarked updates as inliers keeps one client's 3.3% effective watermark detectable

    In federated LLM fine-tuning, a server using the strong Byzantine-robust aggregator RandEigen filters out existing text-watermark updates as outliers, but optimizing the watermarked samples' input embeddings to sit close to clean updates keeps the watermark detectable by black-box access from a single client's 3.3% effective watermarked data.

  10. Knee osteoarthritis grading without pooled records: ten sites hold feature columns, asynchronous federation reports 99.64% accuracy

    Knee osteoarthritis diagnosis draws on multimodal data scattered across institutions, and centralizing it is both costly and privacy-risky. An asynchronous federated scheme first fuses structured records, semi-structured files and imaging into a queryable data table, then has ten simulated institutions compute gradients on vertically partitioned feature columns, with Bulyan aggregation and adaptive differential privacy filtering malicious updates on the server. On 5,580 knee osteoarthritis cases it reports 99.64% accuracy, 0.998 AUC, 285 MB communication overhead and a 1.8% attack success rate.