FedHV: Low-Overhead Hypervolume Weighting for Federated Multi-Objective Optimization
Organizations: Independent Researcher · Chalmers University of Technology · Purdue University
Abstract
Task-wise federated multi-objective optimization (FedMOO) trains a shared model for competing prediction objectives under heterogeneous data, partial participation, and communication constraints. Existing methods commonly derive task weights from gradient or update geometry. This requires task-specific information or iterative server-side optimization. We introduce FedHV, which maps reference-relative objective slacks to closed-form inverse-slack weights. Each client optimizes one weighted loss and returns objective estimates with its model update. The protocol adds exactly 2m auxiliary scalars per participating client, yielding Theta(d + m) total per-client communication, compared with the Theta(md) task-specific communication of FSMGDA, and requires no additional synchronization stage. We analyze the resulting one-round-delayed weights under client heterogeneity, multi-step local updates, partial participation, and finite-sample objective reports. Under a fixed-horizon positive-slack reference condition, with the prescribed horizon-dependent step size and vanishing report error, FedHV achieves an O(T^(-1/2)) rate for the average squared log-hypervolume gradient norm; persistent report error determines the resulting stationarity neighborhood. The same bound controls the squared Pareto-stationarity residual. Across six Dirichlet-partitioned non-IID settings from four vision benchmark families and three training seeds, FedHV exceeds FSMGDA and FedCMOO in mean accuracy in five settings. Among these methods and uniform scalarization, it achieves the highest worst-task accuracy in four settings and improves the difficult CIFAR-10 objective in both CIFAR10-MNIST settings.
Figures & tables
| Uniform | FSMGDA | FedCMOO | FedHV | |||||
| Setting | Mean | Worst | Mean | Worst | Mean | Worst | Mean | Worst |
| MultiMNIST | ||||||||
| MNIST–FMNIST | ||||||||
| CelebA5 -A | ||||||||
| CelebA5 -B | ||||||||
| CIFAR10–MNIST -A | ||||||||
Appendix figures & tables29 assets
Supplementary material from the paper’s appendix.
Appendix
| Objective | Attributes |
|---|---|
| 5-o’Clock Shadow, Blond Hair, Bags Under Eyes, Eyeglasses, Mustache, Wavy Hair, Oval Face, Rosy Cheeks | |
| Arched Eyebrows, Black Hair, Big Nose, Blurry, Goatee, Straight Hair, Pale Skin, Wearing Earrings | |
| Attractive, Brown Hair, Bushy Eyebrows, Double Chin, Mouth Slightly Open, Receding Hairline, Wearing Hat, Young | |
| Bald, Big Lips, Chubby, Heavy Makeup, High Cheekbones, Male, Sideburns, Smiling | |
| Bangs, Gray Hair, Narrow Eyes, No Beard, Pointy Nose, Wearing Lipstick, Wearing Necklace, Wearing Necktie |
| Setting | Samples/client | Partition rule | |||
|---|---|---|---|---|---|
| MultiMNIST | 30 | 20 | 600 | 0.15 | all-label Dirichlet |
| MNIST–FMNIST | 30 | 10 | 500 | 0.30 | all-label Dirichlet |
| CelebA5 -A | 30 | 10 | 500 | 0.15 | all-label Dirichlet |
| CelebA5 -B | 30 | 10 | 500 | 0.30 | first-label Dirichlet |
| CIFAR10–MNIST -A | 30 | 10 | 500 | 0.10 | all-label Dirichlet |
| CIFAR10–MNIST -B | 30 | 10 | 500 | 0.30 | all-label Dirichlet |
| Setting | Adaptive rounds | Batch size | Momentum | Test period | |
|---|---|---|---|---|---|
| MultiMNIST | 200 | 32 | 10 | 0 | 3 |
| MNIST–FMNIST | 500 | 128 | 10 | 0 | 3 |
| CelebA5 | 300 | 64 | 5 | 0.9 | 5 |
| CelebA5 | 300 | 64 | 5 | 0.9 | 5 |
| CIFAR10–MNIST | 500 | 128 | 10 | 0 | 3 |
| CIFAR10–MNIST | 500 | 128 | 10 | 0 | 3 |
| Setting | Uniform | FSMGDA | FedCMOO | FedHV |
|---|---|---|---|---|
| MultiMNIST | ||||
| MNIST–FMNIST | ||||
| CelebA5 | ||||
| CelebA5 | ||||
| CIFAR10–MNIST | ||||
| CIFAR10–MNIST |
| Benchmark family | |
|---|---|
| MultiMNIST | |
| MNIST–FMNIST | |
| CIFAR10–MNIST | |
| CelebA5 |
| Setting | Minimum report slack | Floor activation |
|---|---|---|
| MultiMNIST | ||
| MNIST–FMNIST | ||
| CelebA5 -A | ||
| CelebA5 -B | ||
| CIFAR10–MNIST -A | ||
| CIFAR10–MNIST -B |
| Setting | Method | MeanLoss | HV |
|---|---|---|---|
| MultiMNIST | Uniform | ||
| FSMGDA | |||
| FedCMOO | |||
| FedHV | |||
| MNIST–FMNIST | Uniform | ||
| FSMGDA |
| Setting | Method | Task 1 Acc. | Task 2 Acc. | Task 1 Loss | Task 2 Loss |
|---|---|---|---|---|---|
| MultiMNIST | FSMGDA | ||||
| FedCMOO | |||||
| FedHV | |||||
| MNIST–FMNIST | FSMGDA | ||||
| FedCMOO | |||||
| FedHV |
| Ablation | Variant | MeanAcc | MeanLoss |
|---|---|---|---|
| Report budget | |||
| Participation | |||
| Setting | FSMGDA | FedCMOO | FedHV |
|---|---|---|---|
| MultiMNIST | |||
| MNIST–FMNIST | |||
| CelebA5 | |||
| CelebA5 | |||
| CIFAR10–MNIST | |||
| CIFAR10–MNIST |
| Method | Client-side procedure | Per-client communication | Additional server-side procedure |
|---|---|---|---|
| FSMGDA | Separate objective-specific local updates | (Empirical: MB) | Task-update geometry and multi-gradient optimization |
| Uniform | One uniformly weighted local trajectory | (Empirical: MB) | None beyond model aggregation |
| FedCMOO | Task-gradient estimation and weighted local training | (Empirical: MB) | Approximate Gram matrix construction and iterative weight updates |
| FedHV | Objective estimation and one weighted local trajectory | (Empirical: MB) | objective aggregation and closed-form inverse-slack weighting |
| Method | Total Wall-Clock Time (s) | Downlink / Uplink per Client (MB) |
|---|---|---|
| FSMGDA | / | |
| FedCMOO | / | |
| FedHV (Ours) | / |
Multi-Objective Optimization
Multi-objective optimization studies how to find and choose solutions that balance competing goals, constraints, and preferences.
See all 270 papers