Fed-Equilibrium Framework for Topological Pareto Control in Robust and Fair Clinical Federated Learning
Summary
This paper proposes Fed-Equilibrium, a federated learning framework that balances robustness and fairness in clinical networks using topological Pareto control to ensure minority nodes achieve convergence comparable to dominant hubs.
View Cached Full Text
Cached at: 09/14/26, 08:27 AM
# Fed-Equilibrium Framework for Topological Pareto Control in Robust and Fair Clinical Federated Learning ††thanks: This work was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). The authors gratefully acknowledge the Canadian Network for Observational Drug Effect Studies (CNODES) and the MITRE Corporation (SyntheticMass) for providing the synthetic datasets used in this research.
Source: [https://arxiv.org/html/2609.11937](https://arxiv.org/html/2609.11937)
###### Abstract
The deployment of Federated Learning \(FL\) in multi\-center clinical networks faces the challenge of “knowledge dominance,” where high\-volume hubs naturally overwhelm minority community nodes, implicitly treating the distinct clinical patterns of smaller cohorts as outliers\. Existing geometric defenses provide a security baseline but leave this efficiency\-fairness dilemma unresolved\. To bridge this gap, we propose Fed\-Equilibrium, a framework that advances the paradigm from simple defense to topological equilibrium\. Unlike traditional aggregators, Fed\-Equilibrium implements a sequential architectural synergy\. It utilizes a two\-stage gradient control cascade: Stage I \(geometric quality assurance\) enforces directional consistency via a cosine similarity funnel to filter malicious noise, creating a stabilized manifold; Stage II \(topological Pareto control\) then actively modulates verified contributions by identifying the optimal Pareto knee point\. We validated this framework on a bi\-national simulation integrating Canadian \(CNODES\) and U\.S\. \(SyntheticMass\) registries\. Experimental results demonstrate that the system simultaneously secures the network against adversarial divergence while accommodating underrepresented signals\. Notably, the minority U\.S\. spoke \(representing less than 3% of data volume\) achieved deep convergence comparable to the data\-rich Canadian hub\. This confirms that Fed\-Equilibrium effectively counters “knowledge dominance,” establishing a true “knowledge commons” where global generalizability does not come at the cost of local clinical representation\.
## IIntroduction
Clinical registries have evolved into the foundation of modern medical research, offering real\-world evidence that complements randomized controlled trials\[[1](https://arxiv.org/html/2609.11937#bib.bib1),[2](https://arxiv.org/html/2609.11937#bib.bib2)\]\. However, the digitization of healthcare has created a fragmentation paradox: while massive volumes of high\-value clinical data exist, they remain locked within institutional “data silos” due to stringent privacy regulations such as HIPAA and GDPR\[[3](https://arxiv.org/html/2609.11937#bib.bib3)\]\. Federated Learning \(FL\) has emerged as the standard solution to bridge these silos, enabling collaborative intelligence without requiring direct data exchange\[[4](https://arxiv.org/html/2609.11937#bib.bib4)\]\.
Nevertheless, in securing these collaborative networks, the research community has largely focused on defense rather than equilibrium\[[5](https://arxiv.org/html/2609.11937#bib.bib5)\]\. Prior works, such as the geometric quality assurance \(GQA\) framework, have successfully established a robust security baseline, effectively filtering out adversarial divergence by enforcing directional consistency via a cosine similarity funnel\[[6](https://arxiv.org/html/2609.11937#bib.bib6),[7](https://arxiv.org/html/2609.11937#bib.bib7)\]\. Yet, security alone does not guarantee clinical fairness, especially in real\-world federated networks like PCORnet\[[8](https://arxiv.org/html/2609.11937#bib.bib8)\]or OHDSI\[[9](https://arxiv.org/html/2609.11937#bib.bib9)\]\. In these influence\-asymmetric structures, large hubs \(e\.g\., tertiary hospitals\) tend to dominate and neglect the voices of smaller spokes \(e\.g\., community clinics\)\.
Clinical data is inherently non\-IID \(independent and identically distributed\)\[[10](https://arxiv.org/html/2609.11937#bib.bib10)\]\. Even within a secure network protected by geometric defenses, a critical secondary challenge remains: knowledge dominance\[[11](https://arxiv.org/html/2609.11937#bib.bib11)\]\. Large tertiary centers \(dominant nodes\) generate high\-magnitude gradients that naturally overwhelm the subtle updates from smaller community clinics \(minority nodes\)\. Standard aggregation algorithms like FedAvg suffer from Pareto inefficiency by blindly averaging these updates\[[4](https://arxiv.org/html/2609.11937#bib.bib4),[11](https://arxiv.org/html/2609.11937#bib.bib11),[12](https://arxiv.org/html/2609.11937#bib.bib12)\]\. As a result, even though minority data, containing valuable rare disease profiles, is successfully preserved by the security filter, its impact can be overlooked during the aggregation process\. The global model inevitably converges towards the “average” patient, failing to capture the specialized knowledge residing in the long tail of the distribution\.
Hence, we propose the Fed\-Equilibrium framework that incorporates geometric defense with topological control to resolve this imbalance\. We argue that a robust clinical network requires a sequential architectural synergy consisting of: 1\) security \(inherited from GQA\) to filter out non\-directional consistent nodes\[[5](https://arxiv.org/html/2609.11937#bib.bib5)\]; and 2\) equilibrium \(focus of this work\) to actively modulate the remaining benign gradients\[[13](https://arxiv.org/html/2609.11937#bib.bib13)\]\.
To achieve this equilibrium, our work introduces the Topological Pareto Control \(TPC\) mechanism\. TPC locates the Pareto knee point through a systematic parameter sweep that projects the global model onto a Pareto frontier\[[12](https://arxiv.org/html/2609.11937#bib.bib12)\]\. The resulting threshold grants just enough leverage to minority spokes to counterbalance the “convergence momentum” arising from large hubs\. Our framework further incorporates a FedQLoRA architecture, ensuring that unique clinical patterns of underrepresented patients are effectively learned and preserved without compromising convergence\[[14](https://arxiv.org/html/2609.11937#bib.bib14),[15](https://arxiv.org/html/2609.11937#bib.bib15)\]\.
Validated on a bi\-national simulation of Canadian \(CNODES\) and U\.S\. \(SyntheticMass\) registries\[[16](https://arxiv.org/html/2609.11937#bib.bib16),[17](https://arxiv.org/html/2609.11937#bib.bib17)\], our results demonstrate that Fed\-Equilibrium effectively neutralizes the knowledge dominance effect\. This work completes the paradigm shift: while prior geometric defenses ensure the network is safe, Fed\-Equilibrium ensures the network is fair\.
## IIMethods
The Fed\-Equilibrium framework establishes a synergistic gradient control cascade designed to bridge the gap between geometric security and topological fairness\. Building upon the robust defense baseline established by GQA frameworks, Fed\-Equilibrium extends these principles into a stable topological Pareto\-equilibrium state\. By modeling the multi\-center network as a heterogeneous information network, our system ensures that the global model captures the full curvature of the clinical manifold without suppressing minority insights\. The framework operates through three layers: \(A\) semantic harmonization, \(B\) the federated parameter\-efficient fine\-tuning \(PEFT\) network, and \(C\) the synergistic gradient control cascade\.
### II\-ALayer 1: Data structuring and harmonization
To bridge the gap between heterogeneous registries and Large Language Model \(LLM\) training, this layer harmonizes diverse data sources into a unified instruction\-tuning format\.

Figure 1:Data harmonization pipeline illustrating the transformation of heterogeneous clinical registries into a unified instruction\-tuning format\.- •Simulation of post\-extraction environment:While real\-world registries are mostly unstructured and stored in various hospital systems, such as HIS, LIS, EMR, etc\., we assume that unstructured narratives have been pre\-processed via a local ETL and NLP pipeline\. This assumption allows us to utilize standardized datasets as a proxy for post\-extraction registry outputs and focus on the challenge of systematic heterogeneity\[[16](https://arxiv.org/html/2609.11937#bib.bib16)\]\.
- •Schema alignment \(ATC vs\. free\-text\):To reconcile extreme interoperability gaps between sites, we implemented a robust schema alignment process within the OMOP Common Data Model \(CDM\) framework\[[9](https://arxiv.org/html/2609.11937#bib.bib9),[18](https://arxiv.org/html/2609.11937#bib.bib18)\]\. Specifically, the pipeline maps structured Canadian ATC \(Anatomical Therapeutic Chemical\) codes and U\.S\. natural language clinical text into a standardized semantic space\. Subsequently, we transform these harmonized profiles into natural language prompts for supervised fine\-tuning \(SFT\)\[[19](https://arxiv.org/html/2609.11937#bib.bib19)\]\. We construct a dataset𝒟=\{\(xi,yi\)\}\\mathcal\{D\}=\\\{\(x\_\{i\},y\_\{i\}\)\\\}, wherexix\_\{i\}denotes the synthesized patient context \(e\.g\., ”Patient \(US\) is a white F, born in 1977…”\) andyiy\_\{i\}represents the corresponding target clinical decision or outcome \(Clinical History: Normal pregnancy; Acute bronchitis…Interventions: Pregnancy termination care; Vaccination for diphtheria pertussis and tetanus…\)\. This formulation ensures our model can directly learn clinically meaningful reasoning patterns from distributed, privacy\-preserving registry data\[[20](https://arxiv.org/html/2609.11937#bib.bib20)\]\.
### II\-BLayer 2: The federated PEFT architecture \(FedQLoRA\)
To enable collaborative training without data centralization, we adopt a “bring the model to the data” strategy\[[4](https://arxiv.org/html/2609.11937#bib.bib4)\], utilizing a federated quantized low\-rank adaptation \(FedQLoRA\) architecture\[[14](https://arxiv.org/html/2609.11937#bib.bib14),[15](https://arxiv.org/html/2609.11937#bib.bib15)\]\. This approach ensures that raw clinical data never leaves the local environment while allowing the global model to learn from diverse sources\.
Each local nodekkhosts a copy of the foundational LLM \(TinyLlama\-1\.1B\)\[[19](https://arxiv.org/html/2609.11937#bib.bib19)\]\. To reduce communication overhead, we freeze the backbone weightsWbaseW\_\{\\text\{base\}\}and only the adapter matricesA∈ℝd×rA\\in\\mathbb\{R\}^\{d\\times r\}andB∈ℝr×dB\\in\\mathbb\{R\}^\{r\\times d\}are optimized, whererris the rank of the low\-rank decomposition\. The forward passhhis defined as:
h=Wbasex\+αABxh=W\_\{\\text\{base\}\}x\+\\alpha ABx\(1\)whereα\\alphais a scaling factor that controls the contribution of the low\-rank update\. Consequently, the local updateΔθk\\Delta\\theta\_\{k\}for clientkkrepresents a sparse, efficient gradient vector, significantly reducing bandwidth usage compared to full fine\-tuning\[[14](https://arxiv.org/html/2609.11937#bib.bib14)\]\.
### II\-CLayer 3: Synergistic gradient control cascade \(TPC\)
To resolve the theoretical tension between robustness and fairness, Fed\-Equilibrium implements a two\-stage gradient control cascade, as illustrated in Fig\.[2](https://arxiv.org/html/2609.11937#S2.F2)\. Unlike traditional aggregators that treat security and utility as orthogonal objectives, our framework establishes a sequential synergy: the TPC modulator operates upon the verified trust region established by the GQA gatekeeper\. The sole purpose for introducing the TPC mechanism in Stage II is that geometric defense alone overlooks the topological imbalance of hubs and spokes within federated clinical networks\. Here, “topological” refers to the control of influence structure over the Pareto manifold rather than graph connectivity, emphasizing equilibrium over geometric proximity\.

Figure 2:System architecture of Stage II TPC, illustrating the identification of the optimal Pareto knee point \(λ∗\\lambda^\{\*\}\) to maximize minority fairness while maintaining global model utility\.#### II\-C1Stage I: GQA gatekeeper
To address the vulnerability of standard aggregation to adversarial noise and attacks, we first introduce a geometric consensus mechanism that filters updates based on their directional alignment as a Stage I gatekeeper\. The aggregator applies a gating function to the global model update:
θt\+1=θt\+∑γk⋅Δθk\\theta\_\{t\+1\}=\\theta\_\{t\}\+\\sum\\gamma\_\{k\}\\cdot\\Delta\\theta\_\{k\}\(2\)where the coefficientγk\\gamma\_\{k\}is determined by the funnel thresholdτ\>0\\tau\>0\. By settingτ\>0\\tau\>0\[[24](https://arxiv.org/html/2609.11937#bib.bib24)\], the GQA gatekeeper enforces geometric consensus through two distinct behavioral filters:
- •Constructive heterogeneity:Clients with complementary clinical data \(e\.g\., Canadian vs\. U\.S\. datasets\) maintain a positive alignment \(Sim\>τ\\text\{Sim\}\>\\tau\) despite magnitude differences and are preserved within the global update\.
- •Destructive noise:Malicious updates \(e\.g\., sign flipping\) typically exhibit orthogonality or negativity \(Sim≤τ\\text\{Sim\}\\leq\\tau\) and are strictly filtered out\[[21](https://arxiv.org/html/2609.11937#bib.bib21)\], ensuring the optimization remains within a secure trust region\.
This step is critical for stabilizing the optimization landscape, creating a secure trust region where subsequent fairness adjustments in Stage II are mathematically valid\.
#### II\-C2Stage II: Topological Pareto Control \(TPC\)
Within the trust region, the TPC mechanism acts as a topological modulator\. While Stage I ensures that gradients are safe, Stage II defines the optimal weighting to ensure they are representative\. We compute the final global updateΔθglobal\\Delta\\theta\_\{\\text\{global\}\}\(corresponding to the sum in Eq\.[2](https://arxiv.org/html/2609.11937#S2.E2)for verified nodes\) as:
Δθglobal=\(1−λk\)Δθmaj\+λkΔθmin\\Delta\\theta\_\{\\text\{global\}\}=\(1\-\\lambda\_\{k\}\)\\Delta\\theta\_\{\\text\{maj\}\}\+\\lambda\_\{k\}\\Delta\\theta\_\{\\text\{min\}\}\(3\)whereλk\\lambda\_\{k\}is the Pareto\-alignment coefficient that controls the trade\-off between majority and minority contributions\. In practice,λk\\lambda\_\{k\}is operationalized as the minority weightwusw\_\{us\}in our analysis\. Instead of heuristic weighting, the optimalwusw\_\{us\}is empirically determined through a non\-linear sensitivity analysis, sweeping \(wus∈\{0\.1,…,14\.0\}w\_\{us\}\\in\\\{0\.1,\\dots,14\.0\\\}\) to identify the Pareto knee point\[[12](https://arxiv.org/html/2609.11937#bib.bib12)\]\. This mechanism implements topological control to resolve the influence structure asymmetry in real\-world federated networks like PCORnet or OHDSI\[[8](https://arxiv.org/html/2609.11937#bib.bib8),[9](https://arxiv.org/html/2609.11937#bib.bib9)\], where high\-volume hubs \(e\.g\., large medical centers\) tend to be dominant and neglect the voices of smaller spokes \(e\.g\., community health centers\)\. By identifying the knee point on the Pareto frontier, TPC acts as an equilibrium stabilizer, which modulates the strategic influence of the minority node to counterbalance the convergence momentum of the majority\. The cosine similarity threshold used by the GQA gatekeeper is defined by the angular boundsθmin\\theta\_\{\\min\}andθmax\\theta\_\{\\max\}, which specify the minimum and maximum acceptable angular deviation between a local gradient and the consensus direction, respectively\. This restores collaborative fairness and reaches an equilibrium between the hubs and spokes, ensuring minority insights are preserved without compromising convergence\.
### II\-DSimulation and experiment setup
The framework is validated using a star\-topology clinical network simulated in PyTorch\[[22](https://arxiv.org/html/2609.11937#bib.bib22)\]\. The network is partitioned into 13 nodes: 10 dominant Canadian sites \(high\-volume administrative data\) and 3 minority U\.S\. sites \(specialized EHR data\)\. This configuration creates an extreme information density gradient of approximately 40:1 \(aggregating 37,287 Canadian hub records vs\. 974 U\.S\. spoke records\)\[[16](https://arxiv.org/html/2609.11937#bib.bib16),[17](https://arxiv.org/html/2609.11937#bib.bib17)\]\.
To rigorously evaluate performance and robustness through a game\-theoretic approach, we structured our experiments into three distinct operational modes:
- •Mode A \(Fed\-Equilibrium, the cooperative solution\):We utilize TinyLlama\-1\.1B\[[19](https://arxiv.org/html/2609.11937#bib.bib19)\]as the backbone model\. This mode implements the synergistic cascade with a Pareto\-alignment coefficientλk\\lambda\_\{k\}, derived from the Pareto knee point wherewus=2\.0w\_\{us\}=2\.0\. As a result, the system can maximize performance for spokes without diminishing the accuracy of the dominant hubs, effectively resolving the efficiency\-fairness dilemma found in unmanaged networks\[[12](https://arxiv.org/html/2609.11937#bib.bib12)\]\.
- •Mode B \(standard FedAvg, non\-cooperative baseline\):This mode represents the influence structure asymmetry inherent in the clinical network\[[4](https://arxiv.org/html/2609.11937#bib.bib4)\]\. By utilizing size\-proportional aggregation \(wk∝\|Dk\|w\_\{k\}\\propto\|D\_\{k\}\|\), it simulates a scenario similar to a Stackelberg dominance, where high\-volume hubs implicitly steer the optimization trajectory while smaller spokes have limited influence\[[11](https://arxiv.org/html/2609.11937#bib.bib11)\]\. The design intent is to observe how this non\-cooperative dynamic allows the convergence momentum of the majority to overwhelm the system, demonstrating the neglect of minority voices during Stage II\.
- •Mode C \(EqualAvg, naïve egalitarianism\):This mode assigns uniform influence \(wk=1/Nw\_\{k\}=1/N\) to all 13 nodes regardless of their size\. From a game theory perspective, this represents a suboptimal cooperative strategy \(“naïve egalitarianism”\)\. Unlike the TPC mechanism which empirically identifies the Pareto knee point, this mode applies a static yet blind weighting\. The objective is to demonstrate that heuristic weighting fails to function as an effective equilibrium stabilizer; it remains trapped in a suboptimal region of the loss curve, justifying the necessity of the TPC mechanism to reach the Pareto frontier\.
## IIIResults
In this section, we evaluated the Fed\-Equilibrium framework through a simulated bi\-center clinical network designed to replicate the structural asymmetry of real\-world data isolation\. The results quantify the framework’s efficacy across three critical dimensions: semantic harmonization, Pareto\-optimal convergence under imbalance, and synergistic resilience across the three modes defined in the methods\.
### III\-AData harmonization and semantic alignment
The primary challenge in federated learning is structural incompatibility\[[10](https://arxiv.org/html/2609.11937#bib.bib10)\]\. We evaluated the Fed\-Equilibrium framework on a harmonized cohort of 37,287 records from the Canadian CNODES \(administrative claims\) and 974 records from the U\.S\. SyntheticMass \(EHR\-simulated\) datasets\[[16](https://arxiv.org/html/2609.11937#bib.bib16),[17](https://arxiv.org/html/2609.11937#bib.bib17)\]\. Despite systematic heterogeneity, specifically the divergence between standardized Canadian ATC codes and unstructured U\.S\. natural language clinical texts, the OMOP mapping pipeline successfully unified 100% of the disparate variables into a shared conceptual vocabulary\[[9](https://arxiv.org/html/2609.11937#bib.bib9)\]\.
### III\-BEmpirical identification of the Pareto frontier
To resolve the efficiency\-fairness tension introduced in the TPC mechanism \(Stage II\), we performed a nonlinear sensitivity analysis to identify the Pareto knee point\.

Figure 3:Pareto frontier showing the trade\-off between majority and minority loss across the minority weight sweep \(wus∈\{0\.1,…,14\.0\}w\_\{us\}\\in\\\{0\.1,\\dots,14\.0\\\}\)\. The knee point atw=2\.0w=2\.0is marked\.As visualized in the Pareto frontier analysis \(Fig\.[3](https://arxiv.org/html/2609.11937#S3.F3)\) and sensitivity analysis \(Fig\.[4](https://arxiv.org/html/2609.11937#S3.F4)\), the system landscape exhibits a convex Pareto frontier:
- •The non\-cooperative extremes:Standard FedAvg\[[4](https://arxiv.org/html/2609.11937#bib.bib4)\]\(implicitlyw≈0\.03w\\approx 0\.03\) occupies the bottom\-right region, minimizing majority loss \(0\.985\) but incurring high minority loss \(0\.857\)\. Conversely, excessive upweighting \(w\>10w\>10\) drastically minimizes minority loss but destabilizes the majority convergence \(majority loss spikes\>1\.6\>1\.6\)\.
- •The knee\-point equilibrium:By calculating the maximum curvature of the Pareto frontier, we identifiedw=2\.0w=2\.0as the topological Pareto knee point\[[12](https://arxiv.org/html/2609.11937#bib.bib12)\]\. At this equilibrium state, the system achieves a zero\-sum escape: it reduces minority loss significantly \(from 0\.857 to 0\.340\) while maintaining majority loss at a comparable level \(0\.981 vs\. 0\.985\)\. This confirms the TPC mechanism successfully decouples the optimization trajectory from the volume dominance of the hubs\.

Figure 4:Sensitivity analysis on cost of fairness\. Sweeping the minority weightwusw\_\{us\}reveals the intersection where the marginal gain in fairness no longer justifies the marginal cost in global utility\.
### III\-CSynergistic resilience validation \(TPC\)
To quantify the specific impact of TPC, we benchmarked the framework against standard aggregation strategies, visualizing both the learning trajectory \(Fig\.[5](https://arxiv.org/html/2609.11937#S3.F5)\) and the final performance distribution \(Fig\.[6](https://arxiv.org/html/2609.11937#S3.F6)\)\.

Figure 5:A comparative performance evaluation\. Under standard FedAvg \(Mode B\), the minority nodes suffer from stagnation due to knowledge dominance\. In contrast, Fed\-Equilibrium \(Mode A\) accommodates the minority and achieves deep convergence\.In the baseline FedAvg\[[4](https://arxiv.org/html/2609.11937#bib.bib4)\]\(Mode B\) scenario, the global model was driven almost exclusively by the sheer volume of the Canadian hubs\. As illustrated by the trajectory in Fig\.[5](https://arxiv.org/html/2609.11937#S3.F5), the minority US spokes were effectively treated as statistical noise, stagnating at a high loss of 0\.857\. While the EqualAvg \(Mode C\) strategy offered a partial remedy \(lowering US loss to 0\.435\), it lacked the precision to fully exploit the minority’s feature space\.
By contrast, Fed\-Equilibrium \(Mode A\) actively modulated this imbalance by applying the derived Pareto weights \(wus=2\.0w\_\{us\}=2\.0\)\. This topological intervention forced the optimization trajectory to accommodate the distinct clinical patterns of the minority\. The final impact is quantified in Fig\.[6](https://arxiv.org/html/2609.11937#S3.F6), where the US spokes achieved a superior convergence depth of final loss 0\.340, significantly outperforming both baselines\. This reduction translates to a 60\.3% performance uplift for the minority cohort relative to the standard FedAvg\[[4](https://arxiv.org/html/2609.11937#bib.bib4)\]baseline \(final loss 0\.857\)\. More importantly, as shown in the right cluster of Fig\.[6](https://arxiv.org/html/2609.11937#S3.F6), this gain was achieved without degrading the utility of the majority CA hubs \(maintaining a robust loss of∼\\sim0\.9\)\. This confirms that TPC successfully navigates the Pareto frontier, delivering specialized precision for the minority without compromising general utility\[[13](https://arxiv.org/html/2609.11937#bib.bib13)\]\.

Figure 6:Final performance distribution quantified by loss \(lower is better\)\. Left Cluster \(US\): Fed\-Equilibrium \(Mode A\) effectively counters the marginalization effect seen in FedAvg \(Mode B\)\. Right Cluster \(CA\): The majority performance remains stable across all modes\.
### III\-DSystem stability and architectural synergy
Finally, we validated the system’s operational stability under cooperative conditions \(Mode A\)\. The GQA gatekeeper \(Stage I\) served as the initial integrity check, ensuring that disparate updates from CNODES and SyntheticMass shared a consistent direction, and confirming that all inputs were benign gradients\. Empirical logs recorded substantial alignment across the 13 nodes \(meancosθ=0\.99±0\.01\\cos\\theta=0\.99\\pm 0\.01\), confirming that the funnel successfully established a unified trust region without rejecting valid clinical insights\.
Crucially, however, geometric alignment alone does not prevent the majority from overwhelming the minority\. To address this, our TPC mechanism \(Stage II\) operated within this aligned pool of benign gradients to actively amplify the signal of the underrepresented US spokes\. This intervention effectively counteracted the “knowledge dominance” of the larger Canadian hubs\. As a result, the minority US nodes achieved superior convergence depth \(final loss 0\.3390\) without compromising the performance of the majority hubs \(final loss 0\.9926\)\. This demonstrates that Fed\-Equilibrium effectively fills the gap between simply accepting benign data \(Stage I\) and actively accommodating the underrepresented \(Stage II\) to ensure network fairness\.
## IVDiscussion
While prior geometric defenses successfully established a security baseline for federated clinical networks, they left the problem of “knowledge dominance” unresolved\. Fed\-Equilibrium bridges this critical gap by advancing the paradigm from simple defense to topological equilibrium\. The framework operates through three synergistic layers—semantic harmonization, geometric quality assurance, and topological Pareto control—proving that federated clinical networks can be simultaneously secure against adversarial contributions and equitable toward underrepresented participants\.
### IV\-AStrengths: A three\-layer synergistic architecture for clinical fairness
We identify three primary strengths, each corresponding to a distinct architectural layer of Fed\-Equilibrium:
1. 1\.Topological Pareto control—solving the knowledge dominance paradox:The TPC mechanism addresses the core failure of FedAvg: Pareto inefficiency that implicitly treats minority gradients as statistical noise\. By algorithmically identifying the Pareto knee point \(w=2\.0w=2\.0\) as the topological “free\-lunch region,” Fed\-Equilibrium achieves a zero\-sum escape—minority loss drops from 0\.857 to 0\.340 without degrading the majority baseline\. This decouples convergence fairness from volume dominance, a limitation that geometric defense alone cannot resolve\. While this study utilizes a static parameter sweep to identify the optimal frontier, it provides the necessary empirical baseline for future dynamic weighting mechanisms that could adaptively recalibrate influence during real\-time training\.
2. 2\.Geometric quality assurance—establishing a safe trust region:The GQA gatekeeper \(meancosθ=0\.99±0\.01\\cos\\theta=0\.99\\pm 0\.01across all 13 nodes\) creates the stabilized manifold upon which the TPC mechanism safely operates\. This sequential dependency—geometric integrity before topological rebalancing—is the foundational design principle of Fed\-Equilibrium\. As demonstrated by Byzantine\-robustness literature\[[23](https://arxiv.org/html/2609.11937#bib.bib23)\], blindly amplifying unchecked gradients without prior quality assurance can introduce adversarial bias; the Stage I gate ensures that only directionally consistent minority updates are amplified\.
3. 3\.Semantic harmonization—enabling cross\-registry alignment:The OMOP\-CDM pipeline unified 100% of heterogeneous variables from structured Canadian ATC codes and unstructured U\.S\. free\-text clinical narratives into a shared instruction\-tuning space\. This confirms that the semantic layer can bridge extreme interoperability gaps, establishing a true “knowledge commons” as the prerequisite for all downstream geometric and topological operations\.
### IV\-BLimitations and future directions
Despite these contributions, Fed\-Equilibrium has specific boundaries that motivate the following research directions:
- •Extension to multimodal and real\-world clinical data:The current framework operates on structured EHR and administrative claims datasets\. Future work will extend the semantic harmonization layer to multimodal fusion, stitching epidemiological registries \(NHANES/SEER\) with medical imaging datasets to enable context\-conditioned clinical prediction\. This will advance the framework from synthetic proof\-of\-concept to real\-world deployment\. Anticipated challenges, including missing data, label noise, and site\-specific coding, will necessitate adaptive extensions to the TPC pipeline\.
- •Dynamic and computationally efficient TPC:The current offline sensitivity sweep \(∼\\sim1\.8 GPU\-hours\) yields a fixed Pareto\-alignment coefficientλk\\lambda\_\{k\}\. Future work will leverage graph Laplacian regularization to embed client\-graph topology directly into the Pareto objective, enabling online recalibration without full re\-sweeps\. Bayesian hyperparameter search will further reduce overhead for larger\-scale deployments\.
- •Robustness under adversarial conditions:Fed\-Equilibrium has been validated under cooperative conditions to resolve hub\-spoke imbalance\. However, the system’s robustness boundaries require further stress\-testing\. Future work will evaluate the Stage I–Stage II cascade under adaptive Byzantine attacks \(e\.g\., sophisticated gradient collusion or targeted label\-flipping\) to establish formal guarantees across heterogeneous real\-world federated deployments\.
## VConclusion
This work validates Fed\-Equilibrium, a synergistic gradient control cascade that reconciles the tension between robust security and equitable convergence\. We demonstrate that while geometric defenses \(Stage I\) provide a necessary security baseline, they alone cannot counteract “knowledge dominance” in imbalanced clinical networks\. By deploying Topological Pareto Control \(TPC\) in Stage II, our system actively accommodates underrepresented spokes, achieving deep convergence \(loss: 0\.340\) for minority nodes without degrading majority utility \(loss: 0\.985\)\. This framework proves that global generalizability can coexist with local representation, effectively resolving the efficiency\-fairness dilemma in collaborative healthcare\. Source code will be released on GitHub following publication\.
## References
- \[1\]D\. M\. E\. Hoque, V\. Kumari, M\. Hoque, R\. Ruseckaite, L\. Romero, and S\. M\. Evans, ”Impact of clinical registries on quality of patient care and clinical outcomes: A systematic review,”PLoS One, vol\. 12, no\. 9, p\. e0183667, 2017\.
- \[2\]R\. E\. Sherman et al\., ”Real\-world evidence—what is it and what can it tell us?,”N\. Engl\. J\. Med\., vol\. 375, no\. 23, pp\. 2293\-2297, 2016\.
- \[3\]G\. A\. Kaissis, M\. R\. Makowski, D\. Rückert, and R\. F\. Braren, ”Secure, privacy\-preserving and federated machine learning in medical imaging,”Nat\. Mach\. Intell\., vol\. 2, pp\. 305\-311, 2020\.
- \[4\]H\. B\. McMahan, E\. Moore, D\. Ramage, S\. Hampson, and B\. Agüera y Arcas, ”Communication\-efficient learning of deep networks from decentralized data,”Proc\. 20th Int\. Conf\. Artif\. Intell\. Statist\. \(AISTATS\), vol\. 54, 2017\.
- \[5\]P\. Blanchard, E\. M\. El Mhamdi, R\. Guerraoui, and J\. Stainer, ”Machine learning with adversaries: Byzantine tolerant gradient descent,”Adv\. Neural Inf\. Process\. Syst\. \(NeurIPS\), 2017\.
- \[6\]G\. Chen et al\., ”RobustPFL: robust personalized federated learning,”IEEE Trans\. Dependable Secure Comput\., vol\. 22, no\. 4, pp\. 3224\-3239, 2025\.
- \[7\]K\. Pillutla, S\. M\. Kakade, and Z\. Harchaoui, ”Robust aggregation for federated learning,”IEEE Trans\. Signal Process\., vol\. 70, pp\. 1142\-1154, 2022\.
- \[8\]R\. L\. Fleurence, L\. H\. Curtis, R\. M\. Califf, R\. Platt, J\. V\. Selby, and J\. S\. Brown, ”Launching PCORnet, a national patient\-centered clinical research network,”J\. Am\. Med\. Inform\. Assoc\., vol\. 21, no\. 4, pp\. 578\-582, 2014\.
- \[9\]G\. K\. Hripcsak et al\., ”Observational health data sciences and informatics \(OHDSI\): Opportunities for observational researchers,”Stud\. Health Technol\. Inform\., vol\. 216, p\. 574, 2015\.
- \[10\]T\. Li, A\. K\. Sahu, M\. Zaheer, M\. Sanjabi, A\. Talwalkar, and V\. Smith, ”Federated optimization in heterogeneous networks,”Proc\. Mach\. Learn\. Syst\. \(MLSys\), 2020\.
- \[11\]M\. Mohri, G\. Sivek, and A\. T\. Suresh, ”Agnostic federated learning,”Proc\. 36th Int\. Conf\. Mach\. Learn\. \(ICML\), vol\. 97, pp\. 4615\-4625, 2019\.
- \[12\]Z\. Hu, K\. Shaloudegi, G\. Zhang, and Y\. Yu, ”Federated learning with multi\-objective optimization,”Adv\. Neural Inf\. Process\. Syst\. \(NeurIPS\), vol\. 35, pp\. 23502\-23514, 2022\.
- \[13\]T\. Li, S\. Hu, A\. Beirami, and V\. Smith, ”Ditto: Fair and robust federated learning through personalization,”Proc\. 38th Int\. Conf\. Mach\. Learn\. \(ICML\), vol\. 139, pp\. 6358\-6368, 2021\.
- \[14\]T\. Dettmers, A\. Pagnoni, T\. Holtzman, and L\. Zettlemoyer, ”QLoRA: Efficient finetuning of quantized LLMs,”Adv\. Neural Inf\. Process\. Syst\. \(NeurIPS\), 2023\.
- \[15\]E\. J\. Hu et al\., ”LoRA: Low\-rank adaptation of large language models,”Proc\. 10th Int\. Conf\. Learn\. Represent\. \(ICLR\), 2022\.
- \[16\]J\. Walonoski et al\., ”Synthea: An approach, method, and software mechanism for generating synthetic patients and the synthetic electronic health care record,”J\. Am\. Med\. Inform\. Assoc\., vol\. 25, no\. 3, pp\. 230\-238, 2018\.
- \[17\]A\. Yazdinejad and J\. D\. Kong, ”Breaking interprovincial data silos: How federated learning can unlock Canada’s public health potential,”Available at SSRN 5247328, 2025\.
- \[18\]M\. Garza, G\. Del Fiol, J\. Tenenbaum, A\. Walden, and M\. N\. Zozus, ”Evaluating common data models for use with a longitudinal community registry,”J\. Biomed\. Inform\., vol\. 64, pp\. 333\-341, 2016\.
- \[19\]P\. Zhang, G\. Zeng, T\. Wang, and W\. Lu, ”TinyLlama: An open\-source small language model,”arXiv preprint arXiv:2401\.02385, 2024\.
- \[20\]N\. Rieke et al\., ”The future of digital health with federated learning,”NPJ Digit\. Med\., vol\. 3, no\. 1, pp\. 1\-14, 2020\.
- \[21\]M\. Fang, X\. Cao, J\. Jia, and N\. Gong, ”Local model poisoning attacks to Byzantine\-robust federated learning,”Proc\. 29th USENIX Security Symp\. \(USENIX Security 20\), pp\. 1603\-1622, 2020\.
- \[22\]A\. Paszke et al\., ”PyTorch: An Imperative Style, High\-Performance Deep Learning Library,”Advances in Neural Information Processing Systems \(NeurIPS\), vol\. 32, pp\. 8024\-8035, 2019\.
- \[23\]D\. Yin, Y\. Chen, R\. Kannan, and P\. Bartlett, ”Byzantine\-robust distributed learning: Towards optimal statistical rates,”Proc\. 35th Int\. Conf\. Mach\. Learn\. \(ICML\), vol\. 80, pp\. 5650\-5659, 2018\.
- \[24\]K\. M\. Sameera, S\. Nicolazzo, A\. Nocera, P\. Vinod, and K\. A\. Rafidha Rehiman, “GShield: Mitigating poisoning attacks in federated learning,”arXiv preprint arXiv:2512\.19286, 2025\.Similar Articles
SCOPE-FL: A Strategy-proof Chain-based Optimal pareto efficient Federated Learning System
This paper introduces SCOPE-FL, a hierarchical federated learning framework that uses the Top Trading Cycle algorithm to ensure strategy-proofness and Pareto efficiency in client selection, with reward distribution via Shapley value approximation and blockchain-based execution.
PAFO: Pareto Fairness Optimization for Personalized Reward Modeling
This paper proposes PAFO, a Pareto fairness optimization framework to mitigate personalized reward bias in reward models for LLMs, improving accuracy for minority user groups without harming majority groups.
Towards Effective Federated Multimodal Graph Learning via Navigating Multifaceted Heterogeneity
Proposes FedTCR, the first systematic federated multimodal graph learning algorithm that handles task, modality, and topology heterogeneity via topology-aware cross-modal routing and tri-level contrastive learning, outperforming baselines across 7 domains.
On the Push-Based Asynchronous Federated Learning: A Bias-Correction Aggregation Approach
This paper presents PushCen-ADFL, a communication-efficient asynchronous decentralized federated learning framework that uses centroid-based messaging and bias-correction to improve accuracy and reduce communication overhead under heterogeneous conditions.
FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift
The paper introduces FedeRage, a risk-averse federated learning method that uses conditional value-at-risk to address unknown client participation and heterogeneity, demonstrating enhanced accuracy, fairness, and convergence in experiments.