CTP-FL: Common-Trajectory Gradient Prediction for Federated Learning

Communication-efficient federated optimization commonly spends several gradient evaluations between server updates. Existing local-update methods use this computation to advance an independent model on each client. Under heterogeneous data, however, these models evaluate gradients at different locations, making the aggregated update difficult to interpret as a gradient of the global objective. We study an alternative use of the same computation budget: evaluate the global objective along a shared, predicted path. We propose Common-Trajectory Predictive Federated Learning (textttCTP-FL). At each round, all clients construct the same sequence of query points from the current global model and the previous aggregated direction, evaluate K stochastic gradients along this sequence, and upload their average. The server then performs a single global update. Thus, textttCTP-FL uses K mini-batch gradients per client and one model-sized vector in each communication direction, matching the per-round computation and communication of full-participation FedAvg-M. Shared query points make the aggregated direction an unbiased estimator of the average global gradient along the predicted path. The remaining discrepancy from the gradient at the current model is controlled by the path length, without assuming bounded client-gradient dissimilarity or bounded gradients. For smooth non-convex objectives, we establish an O!left( √LDeltaσ2/(NKR)+LDelta/R right) average-stationarity bound under full participation. The analysis isolates a testable trade-off: extending the prediction path provides more forward-looking gradient information but increases its displacement bias.