- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This work introduce AutoFed, which is a personalized federated learning framework for traffic prediction to handle clients with non-uniform data distributions and varying graph sizes.
The main contribution of this paper is an input-dependent prompt mechanism. The mechanism shares only feature-level auto-encoder and adapter parameters while keeping graph-dependent components and predictors local. It aim at making per-client communication independent of graph size. Experimental results claim competitive accuracy and reduced communication compared to baselines.
Critical strengths
Two main critical strengths.
The first one is an effective personalized sharing mechanism (AutoFed). It uses input-dependent prompts to connect shared modules with private predictors. It enables cross-client collaboration while preserving adaptation to local traffic patterns.
The second one is it provides support for heterogeneous graph sizes with low communication overhead. The shared parameters are independent of the number of nodes. It allows different-sized clients can collaborate.
Critical weaknesses
The benefit of federated sharing should be clearly isolated. It is suspected that the improvements may come from the additional local prompt-generation pathway rather than the cross-client collaboration. In the experiments, it would be better to include a complete AutoFed model trained without sharing (under the same training budget); this would help distinguish these effects.
Also, the baseline fairness needs clarification. It feels like the fixed configurations do not necessarily suit all methods equally. The paper should also explain hyperparameter selection, validation budgets, and the impact of modifying training procedure.
Questions for authors
-
Is that possible to report a no-sharing control using the complete AutoFed architecture (including the representor, adapter, and reconstruction objective) under the same training budget?
-
What are the exact input-feature and latent dimensions of the AE for each task?
-
Please clarify some important setting involved in the experimental protocol; for example the history/prediction lengths, client node counts, PEMS partitioning, aggregation weights..
4 comments
Response Part 2
Q3: History, partitions, client sizes, and aggregation.
Thank you for your insightful comment. We consolidated these settings in Appendix A.1, including task dimensions in Table 4, exact PEMS client node counts in Table 5, and split sizes in Table 6. Both tasks use 12-step histories and forecasts with stride one; PEMS uses fixed FedTPS METIS partitions, with full participation and node-count-weighted aggregation. Appendix B gives the algorithm.
TDP S0 has one city-wide client per operator; S1 has five Uber borough clients, S2 five Lyft clients, and S3 all ten regional clients. Per operator, the Bronx, Brooklyn, Manhattan, Queens, and Staten Island contain 43, 61, 69, 67, and 20 nodes. S0 combines these into 260 nodes per client.
PEMS03/04/08 have 358/307/170 sensors, respectively. The FedTPS loader partitions each dataset into 2, 4, 6, 8, or 10 disjoint METIS parts and caches the assignment for reuse across runs. Table 5 lists every partition's client sizes; the fixed-partition protocol is marked in blue. Appendix A.1 also gives the time splits, preprocessing, and evaluation convention.
Shared updates use , giving larger local graphs proportionally more weight. Graph modules, predictors, and BN remain private. Evaluation averages clients equally, measuring average client performance separately from the node-weighted training update.
Thanks for the clarification and additional experiments. My concerns have been partially addressed. However, while I appreciate the methodology design, I remain uncertain with the technical contribution beyond existing Fed-sharing framework is sufficient to meet the expectation of this venue. Therefore, I will maintain my current rating. Thanks for your understanding.
Thank you for your further comments. We fully understand your final decision and appreciate your suggestions for improving our manuscript.
We would like to clarify the contribution beyond generic federated parameter sharing. AutoFed does not claim novelty from AGCRN, auto-encoders, FedBN, or prompt conditioning in isolation. The technical contribution is a traffic-specific sharing interface for heterogeneous graph predictors: each client uses its private adaptive graph encoder to transform the current node and history window into an input-dependent prompt, while only the node-count-independent auto-encoder and adapter mappings are shared. Local normalization and private graph predictors preserve client-specific spatial and statistical variation.
This design addresses three constraints jointly: clients have different node sets and graph structures, useful traffic knowledge should be transferred across clients, and the shared information must remain compatible with each private predictor. Generic partial model sharing specifies which layers are shared, but does not provide this graph-dependent, node- and window-conditioned interface or the corresponding reconstruction–prediction training objective.
The added controls and analyses support this interpretation. The complete w/o FL model performs similarly to local AGCRN, while federation improves the same architecture, separating the benefit of cross-client learning from the mere addition of local modules. Prompt interventions and probes show that the learned prompt retains input-window information and that its node/window correspondence matters for forecasting; the BN ablation shows the role of local statistical calibration. The paper also provides a conditional analysis of the detached reconstruction–prediction weighting. These results evaluate the proposed sharing mechanism and its behavior, rather than only reporting the effect of combining standard components.
Response Part 1
Thank you for your careful review and constructive comments. We have added experiments and clarified the method, analysis, and experimental protocol. Our point-by-point responses follow.
W1 / Q1: Complete-model local control under the same training budget.
Thank you for your insightful comment. We added the complete AutoFed model trained locally without sharing (w/o FL) to Section 4.2, Tables 1–2. Its performance is similar to the original local AGCRN baseline, whereas federation lowers MAE in every reported setting. This supports cross-client learning as the main source of the improvement.
Here we show one setting from each task, S3 and PEMS08; the complete results are in Table 1 for TDP and Table 2 for TFP. Local AGCRN is the original baseline, and w/o FL retains the complete AutoFed architecture and objective. Entries follow the mean ± standard deviation convention in those tables.
The local prompt pathway transforms the same observed history and provides little additional forecasting benefit on its own. The gain emerges when its mappings learn from other clients through federation. Appendix A.3 defines the control; the sharing analysis in Section 4.2 is marked in blue.
W2: Baseline settings, selection budget, and training procedures.
Thank you for your insightful comment. We used each baseline's best-performing configuration reported in its paper, following the official implementation for method-specific settings. No method, including AutoFed, received additional hyperparameter tuning in our experiments. We removed the optional curriculum-learning schedule from the FedTPS implementation to compare the core methods without additional training enhancements.
Curriculum learning is an optional, general-purpose training heuristic included in the official FedTPS repository, rather than a component of the traffic-pattern-sharing method proposed in the paper. Such heuristics can also be applied to AutoFed and other compatible models to improve training. Combining multiple enhancements makes it difficult to distinguish gains from the proposed method from gains due to its training recipe. We therefore use a clean comparison without adding curriculum learning or stacking extra performance-enhancement heuristics, while retaining each method's core algorithm and method-specific hyperparameters.
Section 4.1 and Appendix A.2 specify the configuration sources and the curriculum-learning choice. Every method reports the test result from its best-validation round, and results are mean ± standard deviation over three runs. The common checkpoint-selection rule is marked in blue in Appendix A.2.
Q2: Exact AE input and latent dimensions.
Thank you for your insightful comment. We added the exact AE dimensions to Appendix A.1, Table 4, and clarified the whole-window mapping in Section 3.4. The AE is 108 → 768 → 108 for TDP and 12 → 768 → 12 for PEMS. It expands each node's observed history before reconstruction in both tasks.
The map is T × K → T × k → T × K; the latent is reshaped into a 12-step sequence with 64 features per node for graph encoding. Its adapter output is then concatenated with the predictor encoder state to initialize the decoder. Reconstruction learns a temporal-feature representation that supplies this additional forecasting condition. The whole-window explanation in Section 3.4 and the initialization in Section 3.2 are marked in blue.