Pith. sign in

REVIEW 4 major objections 6 minor 47 references

Gradient Compression and Correlation Driven Federated Learning for Wireless Traffic Prediction

T0 review · 4 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Federated traffic prediction can run with 40x less communication while keeping accuracy, this paper argues.

desk verdict A plausible engineering combination of known compression techniques, but the only novel piece—correlation-driven aggregation—is never isolated from the rest of the pipeline, so the central claim lacks the evidence it needs. read the letter →

arxiv 2501.00732 v1 pith:VEWFREIE submitted 2025-01-01 cs.DC

Chuanting Zhang , Haixia Zhang , Shuping Dang , Basem Shihada , Mohamed-Slim Alouini This is my paper · ORCID
classification cs.DC
keywords federatedlearninggradientcompressionsparsificationwirelesstrafficpredictioncorrelationpersonalizedaggregationcommunicationefficiencyspatial-temporaldependencies
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proposes a federated learning algorithm for wireless traffic prediction that combines gradient sparsification with error feedback and gradient tracking, plus three correlation-driven personalized aggregation strategies. The authors claim that on two real-world cellular traffic datasets (Milan and Trentino), their method outperforms state-of-the-art federated baselines in prediction accuracy while reducing communication between clients and server by up to two orders of magnitude. A sympathetic reader should care because it suggests that wireless traffic prediction at the edge can be both accurate and communication-efficient, addressing two major obstacles to practical deployment in 6G networks. The central claim is that capturing spatial dependencies among clients through gradient correlation is what allows the method to improve on simple averaging.

What carries the argument

The key machinery is a reformulation of the federated update rule as $w_{t+1} = w_t - \frac{\eta}{|\mathcal{M}_t|}\sum_{m\in\mathcal{M}_t} f_{\text{agg}}\{\phi(g_m^t)\}$, where $\phi$ is a gradient sparsification operator that keeps only the top $\gamma$ fraction of gradient elements by magnitude. To counteract the lossy nature of sparsification, each client maintains an error feedback vector $e_m^t$ (accumulating filtered-out gradient information) and a gradient tracking vector $h_m^t$ (the difference between local and global averaged gradients). The server then computes a Pearson correlation matrix $\rho$ from the compressed gradients and uses it in three personalized aggregation strategies: k-relevant (select the $k$ most correlated clients), $\delta$-threshold (select clients with correlation above a threshold), and all-correlated (weighted average with softmax-normalized correlations). These strategies are what the authors claim lets the model capture spatial dependencies between clients.

What would settle it

Run the proposed algorithm with its compression, error feedback, and gradient tracking but replace the correlation-based aggregation with simple uniform averaging of the same compressed gradients. If the prediction accuracy on Milan and Trentino is statistically indistinguishable from the full method, then the correlation mechanism adds no benefit and the gains come entirely from the compression-plus-error-feedback components.

Watch

Extended reading notes

Core claim

The paper's central discovery is that gradient compression, when compensated by error feedback and gradient tracking, can be paired with personalized aggregation based on the Pearson correlation of compressed gradients to yield both lower communication cost and better prediction than standard federated averaging. On the Milan dataset, the best proposed configuration achieves MAE 0.0788 and transfers about 3.15 MB, whereas FedAvg achieves MAE 0.0790 and transfers 126.27 MB. On the more heterogeneous Trentino dataset, the proposed k-relevant strategy achieves MAE 0.3621 versus 0.3849 for the best baseline, FedCOMGATE, while using fewer bytes. The authors interpret this as evidence that exploiting gradient correlation captures spatial dependencies among local clients, improving the global model beyond what uniform averaging can achieve.

Load-bearing premise

The claim rests on the assumption that the Pearson correlation between compressed gradients of two clients is a valid proxy for the similarity of their wireless traffic patterns, and that weighting or selecting gradients by this correlation improves the global model.

Editorial extensions

If this is right

  • If the claims hold, federated training of wireless traffic predictors can run with roughly 40x less data transfer on the Milan dataset (3.15 MB vs 126.27 MB) and even larger relative savings on larger models.
  • The proposed method reportedly improves prediction accuracy on heterogeneous data (Trentino) by at least 5.9% in MAE over the strongest baseline, suggesting correlation-aware aggregation helps when client data distributions differ.
  • The approach could make federated traffic prediction practical for energy-constrained edge nodes, since lower communication reduces both bandwidth and energy consumption.
  • The three aggregation strategies offer a tunable trade-off: increasing the number of aggregated clients $k$ or the threshold $\delta$ can degrade performance, implying the method needs careful parameter selection per deployment.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural but untested extension is whether the correlation-based aggregation also helps when the underlying predictor is a graph neural network or transformer rather than the MLP used here; the spatial dependency argument is model-agnostic in principle.
  • The paper does not ablate the correlation mechanism against uniform averaging with the same compression and error-feedback components, so a reader cannot yet tell whether the accuracy gain comes from the correlation weighting or merely from the compression + error feedback pipeline.
  • Sharing gradient indices and correlation coefficients may leak information about local data distributions; quantifying this privacy cost would be a useful follow-up.
  • The authors' interpretation that gradient correlation proxies traffic-pattern similarity could be tested directly by comparing the correlation matrix against geographic or handoff-based spatial proximity measures.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes FedGCC, a federated learning algorithm for wireless traffic prediction that combines gradient sparsification with error feedback and gradient tracking, and introduces three correlation-based personalized aggregation strategies (k-relevant, δ-threshold, all-correlated) intended to capture spatial dependencies among clients. The method is evaluated on the Telecom Italia Milan and Trentino CDR datasets against FedAvg, FedProx, FedAtt, FedDA, and FedCOMGATE, reporting MAE/RMSE/R² improvements and substantially reduced communication volume; the best configuration achieves MAE 0.0788 on Milan and 0.3621 on Trentino, versus best baselines of 0.0790 and 0.3849. The authors claim the method outperforms state-of-the-art and can increase communication efficiency by up to two orders of magnitude.

Significance. If fully validated, the paper would offer a practical recipe for communication-efficient federated traffic prediction, a relevant problem for edge intelligence in 5G/6G networks. The manuscript has strengths: it uses two real public datasets, compares against several relevant baselines including a compressed FL baseline, provides an algorithmic description complete enough to reimplement, and releases code. The main novelty, however, is the correlation-driven aggregation, and the current experimental design does not isolate this component from the compression/error-feedback/tracking pipeline. The reported accuracy gains over the strongest baseline on Milan are extremely small (0.0788 vs 0.0790 MAE) and no variance or significance analysis is provided. The communication-efficiency headline overstates the numbers in Table II. The idea is plausible and the topic is timely, but the evidence as presented does not yet support the central claim that correlation-driven aggregation is what drives the improvement.

major comments (4)
  1. [IV-C, Table II] The central novelty of the paper is the correlation-based aggregation in Eqs. (11)-(13), but no experiment isolates it from the other components. The paper never compares the three correlation strategies against the same pipeline (top-γ sparsification, error feedback in Eq. (6), gradient tracking in Eq. (7)) with uniform averaging. Without this ablation, the improvements over FedCOMGATE in Table II could be entirely due to error feedback and gradient tracking, and the claim that correlation captures spatial dependencies is unsupported. Please add an ablation that replaces fagg in Eq. (10) with plain averaging while keeping all other components and hyperparameters identical.
  2. [Table II, V-G] The Milan results are within what would typically be run-to-run noise: the best proposed MAE is 0.0788 versus FedDA's 0.0790, a relative difference of 0.25%, and the R² difference is 0.9501 versus 0.9493. No error bars, standard deviations, or repeated runs are reported. Moreover, hyperparameters such as γ, k, δ, τ, and batch size appear to be selected using the sensitivity scans in Fig. 8, which report test-set RMSE on the Trentino dataset; there is no validation split or nested procedure. This makes the claimed superiority statistically fragile. Please report multiple seeds with variance and use a validation-based selection protocol.
  3. [IV-C, Eq. (9)] The Pearson correlation in Eq. (9) is computed on compressed gradients ϕ(gᵐₜ). At the main compression ratio γ=0.01, only about 1% of each gradient vector is nonzero, so the correlation can be dominated by the sparsification mask and by common model state rather than by similarity of wireless traffic patterns. The assertion in Section IV-C that ρ 'reflects the similarities of wireless traffic patterns' is never tested. Please provide evidence that correlations of compressed gradients align with correlations of raw gradients or of the traffic time series themselves, or demonstrate in the ablation of the first comment that the correlation mechanism is responsible for the gains.
  4. [Abstract, V-E] The abstract and Section V-E claim that the method 'can increase the communication efficiency by up to two orders of magnitude'. The data in Table II show, for the main results, a communication reduction of 126.27 MB to 3.15 MB on Milan (about 40×) and 322.68 MB to 7.58 MB on Trentino (about 43×). Figure 6 shows roughly 10× reduction for the loss thresholds displayed. A factor of 100 is not demonstrated. Either revise the claim to state the actual observed factors, or provide a setting (e.g., lower target loss) where the two-orders-of-magnitude reduction is achieved.
minor comments (6)
  1. [Eq. (11)] The indicator function in Eq. (11) is defined as I(·)=1 when ρ_{s,m} ≥ δ, but the argument of I is ρ_{m,s} ≥ max_k(ρ_m). This is inconsistent; the definition should refer to the k-th largest threshold used in the formula.
  2. [Algorithm 1] Line 12 of Algorithm 1 ('Update global model locally: w_{t+1} = w_t − η g_t') appears in the client-side block, but g_t is a server-side quantity that is only computed and broadcast at line 16. The placement and ordering are confusing and should be corrected.
  3. [IV-C] The sentence about outliers ('if a client has very small correlations with other clients, then it belongs to the category outliers...') is ambiguous, since under the δ-threshold strategy an outlier's own gradient is still used unchanged (as the paper itself notes for client D). Clarify how the strategies enhance or weaken a client's contribution to the global update.
  4. [V] The dataset is referred to as both 'Trentino' (e.g., Table I and Table II) and 'Trento' (e.g., Section V-G and Fig. 8). Use a single consistent name.
  5. [V-B, Table II] The compression ratio used for the FedCOMGATE baseline is not stated; its ΔC of 14.373/38.449 MB is higher than the proposed method's 3.1494/7.5843 MB, but it is unclear whether this is due to the control variable or to a different γ. Specify the hyperparameters of FedCOMGATE to ensure a fair comparison.
  6. [V-G, Fig. 8(a)] The text says that 'with the increase of compression ratio... the RMSE performance improves', which would mean RMSE decreases as γ grows, but Fig. 8(a) appears to show the opposite trend for at least some strategies. Please clarify the interpretation and, if useful, report numeric values at the plotted points.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: FedGCC's contribution is an empirical comparison against external baselines; the correlation heuristic is an unsupported assumption, not a derived result.

full rationale

The paper's central claims are empirical: prediction accuracy and transferred-byte counts are measured against FedAvg, FedProx, FedAtt, FedDA, and FedCOMGATE on the public Telecom Italia Milan/Trentino datasets (Table II and Section V-D). No equation in the method reduces a target result to an input by construction. Equations (11)-(13) define the three aggregation strategies from the Pearson correlation of compressed gradients (Eq. (9)); the assertion in Section IV-C that 'rho measures the distances of gradients among different local clients, it also reflects the similarities of wireless traffic patterns' is an unvalidated modeling assumption, and the absence of an ablation that isolates the correlation strategies against uniform averaging within the same compression, error feedback, and gradient tracking pipeline is an experimental-control gap, not a circular step. Self-citations such as [43], [12], [32], and [33] appear as background or baselines; no load-bearing argument depends on them, and [33], which already uses gradient-similarity aggregation for wireless traffic prediction, is cited only in a general FL enumeration, so any issue there is a prior-art or novelty concern, not circularity. The 'two orders of magnitude' communication saving reflects the chosen compression ratio gamma=0.01 and the measured transferred bytes; the nontrivial part of the claim, preservation of accuracy, is empirical. No fitted parameter is renamed as a prediction, no equation is equivalent to its own input, and no uniqueness or ansatz is imported from the authors' prior work. Therefore the paper is self-contained relative to the circularity criteria.

Assumptions & free parameters 8 free parameters · 3 assumptions · 0 invented entities

The central claim rests on the heuristic mapping from gradient correlation to spatial traffic-pattern similarity, on the unproved stability of the compressed optimization loop, and on the empirically chosen aggregation rules and hyperparameters. No new physical entities are introduced. The free parameters listed are the main degrees of freedom that determine the reported accuracy and communication numbers.

free parameters (8)
  • Compression ratio gamma = 0.01 (0.05 and 0.1 explored in Fig. 6 and Fig. 8a)
    Fraction of gradient entries transmitted each round. Chosen by hand based on sensitivity analysis; the claimed communication-efficiency improvement depends critically on this value.
  • k (number of most-correlated clients in k-relevant strategy) = 4
    Default value set in Section V-C; Fig. 8b shows RMSE varies with k and the default is chosen from that empirical scan on the Trentino test set.
  • delta (correlation threshold in delta-threshold strategy) = 0.5
    Default value set in Section V-C; Fig. 8c shows RMSE varies with delta and the default is chosen from that empirical scan.
  • tau (number of local SGD updates) = 5
    Chosen in Section V-C; Fig. 8e shows accuracy depends on tau and degrades for tau larger than 6.
  • Local batch size b = 20
    Chosen in Section V-C; Fig. 8f shows accuracy depends on batch size.
  • Input window size p = 6
    Six 10-minute slots (one hour). Fig. 8d shows both shorter and longer windows degrade RMSE; the value is chosen empirically.
  • Local learning rate epsilon = 0.1 with 10x decay at rounds 100 and 150
    Standard SGD schedule adopted from prior FL works; not derived from the data.
  • Server learning rate eta = 1.0
    Standard choice from prior FL works; not derived from the data.
assumptions (3)
  • domain assumption The Pearson correlation between compressed gradients of two clients reflects the similarity of their wireless traffic patterns.
    Invoked in Section IV-C ('Intuitively, rho measures the distances of gradients among different local clients, it also reflects the similarities of wireless traffic patterns, i.e., the spatial dependencies of local clients') and is the basis for Eqs. (11)-(13).
  • domain assumption Gradient sparsification plus error feedback and gradient tracking preserves convergence and accuracy of the federated optimization.
    The paper relies on prior results (FedCOMGATE [26], EF21 [37]) but provides no convergence analysis for the combined algorithm; invoked in Section IV-B.
  • ad hoc to paper The three aggregation rules (k-relevant, delta-threshold, all-correlated) are good heuristics for the global objective.
    Eqs. (11)-(14) are introduced without derivation from an optimization objective or a convergence bound; the default parameters k=4 and delta=0.5 are chosen empirically.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Gradient Compression and Correlation Driven Federated Learning for Wireless Traffic Prediction." pith.science (2026). https://pith.science/paper/VEWFREIE

@misc{pith2026250100732,
  author       = {Pith},
  title        = {Pith review of: Gradient Compression and Correlation Driven Federated Learning for Wireless Traffic Prediction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VEWFREIE}},
  note         = {Machine review of arXiv:2501.00732}
}
read the original abstract

Wireless traffic prediction plays an indispensable role in cellular networks to achieve proactive adaptation for communication systems. Along this line, Federated Learning (FL)-based wireless traffic prediction at the edge attracts enormous attention because of the exemption from raw data transmission and enhanced privacy protection. However FL-based wireless traffic prediction methods still rely on heavy data transmissions between local clients and the server for local model updates. Besides, how to model the spatial dependencies of local clients under the framework of FL remains uncertain. To tackle this, we propose an innovative FL algorithm that employs gradient compression and correlation-driven techniques, effectively minimizing data transmission load while preserving prediction accuracy. Our approach begins with the introduction of gradient sparsification in wireless traffic prediction, allowing for significant data compression during model training. We then implement error feedback and gradient tracking methods to mitigate any performance degradation resulting from this compression. Moreover, we develop three tailored model aggregation strategies anchored in gradient correlation, enabling the capture of spatial dependencies across diverse clients. Experiments have been done with two real-world datasets and the results demonstrate that by capturing the spatio-temporal characteristics and correlation among local clients, the proposed algorithm outperforms the state-of-the-art algorithms and can increase the communication efficiency by up to two orders of magnitude without losing prediction accuracy. Code is available at https://github.com/chuanting/FedGCC.

Figures

Figures reproduced from arXiv: 2501.00732 by the authors.

Figure 1
Figure 1. An example on model aggregation using FedAvg algorithm: (a) Milan city boundary and three selected places; (b) [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Left: The architecture of distributed autonomous networks (DAN); Right: An abstract and simplified DAN for wireless [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. A demonstration of gradient sparsification. Original gradient vector [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: A toy example of our personalized aggregation strategies on client D. We set [PITH_FULL_IMAGE:figures/full_fig_p010_4.png]
Figure 5
Figure 5. Figure 5: Average traffic distribution of the two real-world datasets. (a) Milan; (b) Trentino. The darker the color, the larger the [PITH_FULL_IMAGE:figures/full_fig_p014_5.png]
Figure 6
Figure 6. Figure 6: Convergence and communications on the two datasets: (a) Loss versus communication rounds on the Milan dataset; (b) [PITH_FULL_IMAGE:figures/full_fig_p018_6.png]
Figure 7
Figure 7. Figure 7: Comparisons between the predicted and ground truth values: (a) Quintosole (upper) and Roserio (lower); (b) Prediction [PITH_FULL_IMAGE:figures/full_fig_p019_7.png]
Figure 8
Figure 8. Figure 8: Parameter sensitivity on the Trento dataset: (a) RMSE versus compression ratio; (b) The change of [PITH_FULL_IMAGE:figures/full_fig_p021_8.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

47 extracted references · 35 canonical work pages

  1. [32]

    Communication-efficient wireless traffic prediction with federated learning,

    F. Gao, C. Zhang, J. Qiao, K. Li, and Y . Cao, “Communication-efficient wireless traffic prediction with federated learning,” Mathematics, vol. 12, no. 16, p. 2539, 2024

    work page 2024

  2. [33]

    Wireless traffic prediction based on a gradient similarity federated aggregation algorithm,

    L. Li, Y . Zhao, J. Wang, and C. Zhang, “Wireless traffic prediction based on a gradient similarity federated aggregation algorithm,” Applied Sciences, vol. 13, no. 6, p. 4036, 2023

    work page 2023

  3. [1]

    Edge-native intelligence for 6g communications driven by federated learning: A survey of trends and challenges,

    M. Al-Quraan, L. Mohjazi, L. Bariah, A. Centeno, A. Zoha, K. Arshad, K. Assaleh, S. Muhaidat, M. Debbah, and M. A. Imran, “Edge-native intelligence for 6g communications driven by federated learning: A survey of trends and challenges,” IEEE Transactions on Emerging Topics in Computational Intelligence , vol. 7, no. 3, pp. 957–979, 2023

    2023

  4. [2]

    6G white paper on edge intelligence,

    E. Peltonen, M. Bennis, M. Capobianco, M. Debbah, A. Ding, F. Gil-Casti ˜neira, M. Jurmu, T. Karvonen, M. Kelanti, A. Kliks et al., “6G white paper on edge intelligence,” arXiv preprint arXiv:2004.14850 , 2020

    arXiv 2004

  5. [3]

    The roadmap to 6G: AI empowered wireless networks,

    K. B. Letaief, W. Chen, Y . Shi, J. Zhang, and Y . A. Zhang, “The roadmap to 6G: AI empowered wireless networks,” IEEE Communications Magazine, vol. 57, no. 8, pp. 84–90, 2019

    work page 2019

  6. [4]

    What should 6G be?

    S. Dang, O. Amin, B. Shihada, and M.-S. Alouini, “What should 6G be?” Nature Electronics, vol. 3, no. 1, pp. 20–29, 2020

    work page 2020

  7. [5]

    Federated learning for wireless communications: Motivation, opportunities, and challenges,

    S. Niknam, H. S. Dhillon, and J. H. Reed, “Federated learning for wireless communications: Motivation, opportunities, and challenges,” IEEE Communications Magazine , vol. 58, no. 6, pp. 46–51, 2020

    work page 2020

  8. [6]

    Joint ran slicing and computation offloading for autonomous vehicular networks: A learning-assisted hierarchical approach,

    Q. Ye, W. Shi, K. Qu, H. He, W. Zhuang, and X. Shen, “Joint ran slicing and computation offloading for autonomous vehicular networks: A learning-assisted hierarchical approach,” IEEE Open Journal of Vehicular Technology , vol. 2, pp. 272–288, 2021. JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2021 24

    work page 2021

Show all 47 references
  1. [7]

    Low-cost federated broad learning for privacy- preserved knowledge sharing in the ris-aided internet of vehicles,

    X. Yuan, J. Chen, N. Zhang, Q. J. Ye, C. Li, C. Zhu, and X. S. Shen, “Low-cost federated broad learning for privacy- preserved knowledge sharing in the ris-aided internet of vehicles,” Engineering, vol. 33, pp. 178–189, 2024

    2024

  2. [8]

    Detfed: Dynamic resource scheduling for deterministic federated learning over time-sensitive networks,

    D. Yang, W. Zhang, Q. Ye, C. Zhang, N. Zhang, C. Huang, H. Zhang, and X. Shen, “Detfed: Dynamic resource scheduling for deterministic federated learning over time-sensitive networks,” IEEE Transactions on Mobile Computing, vol. 23, no. 5, pp. 5162–5178, 2024

    2024

  3. [9]

    Transformer-based wireless traffic prediction and network optimization in o-ran,

    M. A. Habib, P. E. Iturria-Rivera, Y . Ozcan, M. Elsayed, M. Bavand, R. Gaigalas, and M. Erol-Kantarci, “Transformer-based wireless traffic prediction and network optimization in o-ran,” arXiv preprint arXiv:2403.10808 , 2024

    2024 arXiv

  4. [10]

    Core network traffic prediction based on vertical federated learning and split learning,

    P. Li, C. Guo, Y . Xing, Y . Shi, L. Feng, and F. Zhou, “Core network traffic prediction based on vertical federated learning and split learning,” Scientific Reports, vol. 14, no. 1, p. 4663, 2024

    2024

  5. [11]

    Wireless traffic prediction with scalable gaussian process: Framework, algorithms, and verification,

    Y . Xu, F. Yin, W. Xu, J. Lin, and S. Cui, “Wireless traffic prediction with scalable gaussian process: Framework, algorithms, and verification,” IEEE Journal on Selected Areas in Communications , vol. 37, no. 6, pp. 1291–1306, 2019

    2019

  6. [12]

    Efficient wireless traffic prediction at the edge: A federated meta-learning approach,

    L. Zhang, C. Zhang, and B. Shihada, “Efficient wireless traffic prediction at the edge: A federated meta-learning approach,” IEEE Communications Letters , vol. 26, no. 7, pp. 1573–1577, 2022

    2022

  7. [13]

    Big data driven mobile traffic understanding and forecasting: A time series approach,

    F. Xu, Y . Lin, J. Huang, D. Wu, H. Shi, J. Song, and Y . Li, “Big data driven mobile traffic understanding and forecasting: A time series approach,” IEEE Transactions on Services Computing , vol. 9, no. 5, pp. 796–805, 2016

    2016

  8. [14]

    Citywide cellular traffic prediction based on densely connected convolutional neural networks,

    C. Zhang, H. Zhang, D. Yuan, and M. Zhang, “Citywide cellular traffic prediction based on densely connected convolutional neural networks,” IEEE Communications Letters , vol. 22, no. 8, pp. 1656–1659, 2018

    2018

  9. [15]

    Deeptp: An end-to-end neural network for mobile cellular traffic prediction,

    J. Feng, X. Chen, R. Gao, M. Zeng, and Y . Li, “Deeptp: An end-to-end neural network for mobile cellular traffic prediction,” IEEE Network, vol. 32, no. 6, pp. 108–115, 2018

    2018

  10. [16]

    Deep transfer learning for intelligent cellular traffic prediction based on cross-domain big data,

    C. Zhang, H. Zhang, J. Qiao, D. Yuan, and M. Zhang, “Deep transfer learning for intelligent cellular traffic prediction based on cross-domain big data,” IEEE Journal on Selected Areas in Communications , vol. 37, no. 6, pp. 1389–1401, 2019

    2019

  11. [17]

    Spatial-temporal attention-convolution network for citywide cellular traffic prediction,

    N. Zhao, Z. Ye, Y . Pei, Y .-C. Liang, and D. Niyato, “Spatial-temporal attention-convolution network for citywide cellular traffic prediction,” IEEE Communications Letters , vol. 24, no. 11, pp. 2532–2536, 2020

    2020

  12. [18]

    Spatio-temporal analysis and prediction of cellular traffic in metropolis,

    X. Wang, Z. Zhou, F. Xiao, K. Xing, Z. Yang, Y . Liu, and C. Peng, “Spatio-temporal analysis and prediction of cellular traffic in metropolis,” IEEE Transactions on Mobile Computing , vol. 18, no. 9, pp. 2190–2202, 2019

    2019

  13. [19]

    Spatiotemporal modeling and prediction in cellular networks: A big data enabled deep learning approach,

    J. Wang, J. Tang, Z. Xu, Y . Wang, G. Xue, X. Zhang, and D. Yang, “Spatiotemporal modeling and prediction in cellular networks: A big data enabled deep learning approach,” in 2017 IEEE Conference on Computer Communications (INFOCOM), 2017, pp. 1–9

    2017

  14. [20]

    Spatio-temporal wireless traffic prediction with recurrent neural network,

    C. Qiu, Y . Zhang, Z. Feng, P. Zhang, and S. Cui, “Spatio-temporal wireless traffic prediction with recurrent neural network,” IEEE Wireless Communications Letters , vol. 7, no. 4, pp. 554–557, 2018

    2018

  15. [21]

    The learning and prediction of application-level traffic data in cellular networks,

    R. Li, Z. Zhao, J. Zheng, C. Mei, Y . Cai, and H. Zhang, “The learning and prediction of application-level traffic data in cellular networks,” IEEE Transactions on Wireless Communications , vol. 16, no. 6, pp. 3899–3912, 2017

    2017

  16. [22]

    The prediction analysis of cellular radio access network traffic: From entropy theory to networking practice,

    R. Li, Z. Zhao, X. Zhou, J. Palicot, and H. Zhang, “The prediction analysis of cellular radio access network traffic: From entropy theory to networking practice,” IEEE Communications Magazine , vol. 52, no. 6, pp. 234–240, 2014

    2014

  17. [23]

    Time-wise attention aided convolutional neural network for data-driven cellular traffic prediction,

    W. Shen, H. Zhang, S. Guo, and C. Zhang, “Time-wise attention aided convolutional neural network for data-driven cellular traffic prediction,” IEEE Wireless Communications Letters , vol. 10, no. 8, pp. 1747–1751, 2021

    2021

  18. [24]

    Federated learning: Challenges, methods, and future directions,

    T. Li, A. K. Sahu, A. Talwalkar, and V . Smith, “Federated learning: Challenges, methods, and future directions,” arXiv preprint arXiv:1908.07873, 2019

    1908 arXiv

  19. [25]

    Federated learning over wireless networks: Optimization model design and analysis,

    N. H. Tran, W. Bao, A. Zomaya, M. N. H. Nguyen, and C. S. Hong, “Federated learning over wireless networks: Optimization model design and analysis,” in 2019 IEEE Conference on Computer Communications (INFOCOM) , 2019, pp. 1387–1395. JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8...

    2019

  20. [26]

    Federated learning with compression: Unified analysis and sharp guarantees,

    F. Haddadpour, M. M. Kamani, A. Mokhtari, and M. Mahdavi, “Federated learning with compression: Unified analysis and sharp guarantees,” in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics , vol. 130, 13–15 Apr 2021, pp. 2350–2358

    2021

  21. [27]

    Federated learning with non-iid data,

    Y . Zhao, M. Li, L. Lai, N. Suda, D. Civin, and V . Chandra, “Federated learning with non-iid data,” arXiv preprint arXiv:1806.00582, 2018

    2018 arXiv

  22. [28]

    Federated optimization in heterogeneous networks,

    T. Li, A. K. Sahu, M. Zaheer, M. Sanjabi, A. Talwalkar, and V . Smith, “Federated optimization in heterogeneous networks,” in Proceedings of Machine Learning and Systems 2020 , 2020

    2020

  23. [29]

    Sparsified sgd with memory,

    S. U. Stich, J.-B. Cordonnier, and M. Jaggi, “Sparsified sgd with memory,” arXiv preprint arXiv:1809.07599 , 2018

    2018 arXiv

  24. [31]

    Federated learning cellular traffic prediction based on multi-time scale information,

    X. Gao, Y . Zhao, J. Wang, and C. Zhang, “Federated learning cellular traffic prediction based on multi-time scale information,” in International Conference on Intelligent Computing . Springer, 2024, pp. 276–289

    2024

  25. [34]

    Deep gradient compression: Reducing the communication bandwidth for distributed training,

    Y . Lin, S. Han, H. Mao, Y . Wang, and W. J. Dally, “Deep gradient compression: Reducing the communication bandwidth for distributed training,” arXiv preprint arXiv:1712.01887 , 2017

    2017 arXiv

  26. [35]

    Distributed stochastic optimization with gradient tracking over strongly- connected networks,

    R. Xin, A. K. Sahu, U. A. Khan, and S. Kar, “Distributed stochastic optimization with gradient tracking over strongly- connected networks,” in 2019 IEEE 58th Conference on Decision and Control (CDC) , 2019, pp. 8353–8358

    2019

  27. [36]

    Gnsd: a gradient-tracking based nonconvex stochastic algorithm for decentralized optimization,

    S. Lu, X. Zhang, H. Sun, and M. Hong, “Gnsd: a gradient-tracking based nonconvex stochastic algorithm for decentralized optimization,” in 2019 IEEE Data Science Workshop (DSW) , 2019, pp. 315–321

    2019

  28. [37]

    EF21: A new, simpler, theoretically better, and practically faster error feedback,

    P. Richt ´arik, I. Sokolov, and I. Fatkhullin, “EF21: A new, simpler, theoretically better, and practically faster error feedback,” Advances in Neural Information Processing Systems , vol. 34, pp. 4384–4396, 2021

    2021

  29. [38]

    Traffic predictability based on ARIMA-GARCH model,

    B. Zhou, D. He, and Z. Sun, “Traffic predictability based on ARIMA-GARCH model,” in 2006 2nd Conference on Next Generation Internet Design and Engineering , Apr. 2006, pp. 200–207

    2006

  30. [39]

    Wireless traffic modeling and prediction using seasonal arima models,

    Y . Shu, M. Yu, O. Yang, J. Liu, and H. Feng, “Wireless traffic modeling and prediction using seasonal arima models,” IEICE Transactions on Communications , vol. 88, no. 10, pp. 3992–3999, 2005

    2005

  31. [40]

    Network traffic prediction based on deep belief network in wireless mesh backbone networks,

    L. Nie, D. Jiang, S. Yu, and H. Song, “Network traffic prediction based on deep belief network in wireless mesh backbone networks,” in 2017 IEEE Wireless Communications and Networking Conference (WCNC) , 2017, pp. 1–5

    2017

  32. [41]

    Long-term mobile traffic forecasting using deep spatio-temporal neural networks,

    C. Zhang and P. Patras, “Long-term mobile traffic forecasting using deep spatio-temporal neural networks,” in Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing , 2018, pp. 231–240

    2018

  33. [42]

    Privacy-preserving traffic flow prediction: A federated learning approach,

    Y . Liu, J. J. Q. Yu, J. Kang, D. Niyato, and S. Zhang, “Privacy-preserving traffic flow prediction: A federated learning approach,” IEEE Internet of Things Journal , vol. 7, no. 8, pp. 7751–7763, 2020

    2020

  34. [43]

    Dual attention-based federated learning for wireless traffic prediction,

    C. Zhang, S. Dang, B. Shihada, and M.-S. Alouini, “Dual attention-based federated learning for wireless traffic prediction,” in IEEE INFOCOM 2021-IEEE conference on computer communications . IEEE, 2021, pp. 1–10

    2021

  35. [44]

    Communication-efficient learning of deep networks from decentralized data,

    B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017, pp. 1273–1282

    2017

  36. [45]

    Learning private neural language modeling with attentive aggregation,

    S. Ji, S. Pan, G. Long, X. Li, J. Jiang, and Z. Huang, “Learning private neural language modeling with attentive aggregation,” in 2019 International Joint Conference on Neural Networks (IJCNN) , 2019, pp. 1–8. JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2021 26

    2019

  37. [46]

    A multi-source dataset of urban life in the ity of Milan and the Province of Trentino,

    G. Barlacchi, M. D. Nadai, R. Larcher, A. Casella, C. Chitic, G. Torrisi, F. Antonelli, A. Vespignani, A. Pentland, and B. Lepri, “A multi-source dataset of urban life in the ity of Milan and the Province of Trentino,” Scientific Data, vol. 2, p. 150055, 2015

    2015

  38. [47]

    Pytorch: An imperative style, high-performance deep learning library,

    A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga et al. , “Pytorch: An imperative style, high-performance deep learning library,” Advances in neural information processing systems, vol. 32, pp. 8026–8037, 2019. Chuan...

    2019

  39. [1998]

    His current research interests include the modeling, design, and performance analysis of wireless communication systems

    He served as a faculty member in the University of Minnesota, Minneapolis, MN, USA, then in the Texas A& M University at Qatar, Education City, Doha, Qatar before joining King Abdullah University of Science and Technology (KAUST), Thuwal, Makkah Province, Saudi Arabia as a Pro...

    2009

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.