fed-plora-eval
Heterogeneous Federated Fine-Tuning with Parallel One-Rank Adaptation — Zhang et al. (2026) (arXiv:2602.16936, 2026)
What this evaluates
Evaluates the performance of heterogeneous federated fine-tuning methods across multiple NLP domains (instruction following, NLU, finance) under both IID and non-IID data partitioning settings. It probes the ability of LoRA-based federated learning algorithms to maintain model accuracy while accommodating resource-constrained clients with varying rank allocations.
Datasets
- Natural Instructions — total ?; splits: train (-1), test (-1)
- GLUE benchmark — total ?; splits: train (-1), test (-1)
- FPB — total ?; splits: train (-1), test (-1)
- FIQA — total ?; splits: train (-1), test (-1)
- TFNS — total ?; splits: train (-1), test (-1)
Metrics
Rouge-L (primary) — range: [0, 1]
- Standard Rouge-L score measuring the longest common subsequence between generated text and reference, normalized by reference length.
Accuracy (primary) — range: [0, 1]
- Proportion of correctly predicted class labels out of total instances. For GLUE, task-specific accuracy or macro-F1 is averaged across all sub-tasks.
Input / output format
Input: Instruction-response pairs or classification prompts, partitioned across clients using IID splits or pathological/Dirichlet non-IID distributions.
Output: Fine-tuned model predictions (text generations or class labels) aggregated into a global model for evaluation.
Scoring recipe
def evaluate(predictions, golds, metric='accuracy'):
if metric == 'rouge-l':
return rouge_l_score(predictions, golds)
elif metric == 'accuracy':
correct = sum(1 for p, g in zip(predictions, golds) if p == g)
return correct / len(golds)
# For multi-task benchmarks like GLUE, compute per-task metric then average
return sum(task_scores) / len(task_scores)
Common pitfalls
- Non-IID settings use pathological or Dirichlet data partitioning, not random splits.
- Heterogeneous baselines use uneven rank allocations (e.g., ranks 1, r_m, R) rather than uniform ranks.
- Results are averaged over three independent runs, with standard deviations reported as upper/lower bounds.
Evidence (verbatim from paper)
Table 1 reports averaged Rouge-L scores of the fine-tuned global model under both IID and non-IID settings... As shown in Table [2], our method, Fed-PLoRA, demonstrates substantial improvements over these baselines on IID GLUE benchmark... The main experimental results are reported as the average with upper and lower deviations over three repeat experiments.
Citation
@misc{zhang2026heterogeneous,
title={Heterogeneous Federated Fine-Tuning with Parallel One-Rank Adaptation},
author={Zhang et al. (2026)},
year={2026},
note={arXiv:2602.16936}
}
1---2name: fed-plora-eval3description: Evaluates the performance of heterogeneous federated fine-tuning methods across multiple NLP domains (instruction following, NLU, finance) under both IID and non-IID data partitioning settings. It probes the ability of LoRA-based federated learning algorithms to maintain model accuracy while accommodating resource-constrained clients with varying rank allocations. Use when the user wants to benchmark on Natural Instructions, GLUE benchmark, FPB, FIQA, TFNS, or asks about evaluating this task. Reports Rouge-L, Accuracy.4---56# fed-plora-eval78> Heterogeneous Federated Fine-Tuning with Parallel One-Rank Adaptation — Zhang et al. (2026) (arXiv:2602.16936, 2026)910## What this evaluates1112Evaluates the performance of heterogeneous federated fine-tuning methods across multiple NLP domains (instruction following, NLU, finance) under both IID and non-IID data partitioning settings. It probes the ability of LoRA-based federated learning algorithms to maintain model accuracy while accommodating resource-constrained clients with varying rank allocations.1314## Datasets1516- **Natural Instructions** — total ?; splits: train (-1), test (-1)17- **GLUE benchmark** — total ?; splits: train (-1), test (-1)18- **FPB** — total ?; splits: train (-1), test (-1)19- **FIQA** — total ?; splits: train (-1), test (-1)20- **TFNS** — total ?; splits: train (-1), test (-1)2122## Metrics2324- `Rouge-L` **(primary)** — range: [0, 1]25 - Standard Rouge-L score measuring the longest common subsequence between generated text and reference, normalized by reference length.26- `Accuracy` **(primary)** — range: [0, 1]27 - Proportion of correctly predicted class labels out of total instances. For GLUE, task-specific accuracy or macro-F1 is averaged across all sub-tasks.2829## Input / output format3031**Input**: Instruction-response pairs or classification prompts, partitioned across clients using IID splits or pathological/Dirichlet non-IID distributions.3233**Output**: Fine-tuned model predictions (text generations or class labels) aggregated into a global model for evaluation.3435## Scoring recipe3637```python38def evaluate(predictions, golds, metric='accuracy'):39 if metric == 'rouge-l':40 return rouge_l_score(predictions, golds)41 elif metric == 'accuracy':42 correct = sum(1 for p, g in zip(predictions, golds) if p == g)43 return correct / len(golds)44 # For multi-task benchmarks like GLUE, compute per-task metric then average45 return sum(task_scores) / len(task_scores)46```4748## Common pitfalls4950- Non-IID settings use pathological or Dirichlet data partitioning, not random splits.51- Heterogeneous baselines use uneven rank allocations (e.g., ranks 1, r_m, R) rather than uniform ranks.52- Results are averaged over three independent runs, with standard deviations reported as upper/lower bounds.5354## Evidence (verbatim from paper)5556> Table 1 reports averaged Rouge-L scores of the fine-tuned global model under both IID and non-IID settings... As shown in Table [2], our method, Fed-PLoRA, demonstrates substantial improvements over these baselines on IID GLUE benchmark... The main experimental results are reported as the average with upper and lower deviations over three repeat experiments.5758## Citation5960```bibtex61@misc{zhang2026heterogeneous,62 title={Heterogeneous Federated Fine-Tuning with Parallel One-Rank Adaptation},63 author={Zhang et al. (2026)},64 year={2026},65 note={arXiv:2602.16936}66}67```6869- arXiv: 2602.16936