Pith. sign in

REVIEW 3 major objections 3 minor 40 references

Coalition Formation for Heterogeneous Federated Learning Enabled Channel Estimation in RIS-assisted Cell-free MIMO

T0 review · 3 major / 3 minor · reviewed 2026-08-08 · deepseek-v4-flash

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

Pith's one-line read The paper argues that federated-learning user grouping for channel estimation in RIS-assisted cell-free MIMO should be treated as a coalition-formation game solved by distributed deep reinforcement learning, and reports that this approach…

desk verdict A solid engineering combination of game-theoretic FL grouping, QMIX, and transfer learning for RIS channel estimation, with a stability theorem that doesn't quite match the implemented algorithm. read the letter →

arxiv 2502.05538 v1 pith:72TEFO4M submitted 2025-02-08 cs.IT math.IT

Nan Qi , Haoxuan Liu , Theodoros A. Tsiftsis , Alexandros-Apostolos A. Boulogeorgos , Fuhui Zhou , Shi Jin , Qihui Wu This is my paper · ORCID
classification cs.ITmath.IT
keywords coalitionformationheterogeneousfederatedlearningdistributeddeepreinforcementQMIXchannelestimationreconfigurableintelligentsurfacecell-freeMIMOtransfer
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

The paper sets out to show that user grouping in federated channel estimation should be decided by the users themselves through coalition formation, rather than fixed in advance or handled by a central server. It claims that a coalition-formation game with altruistic preferences has at least one stable group structure, and that a distributed QMIX-based reinforcement learner can find it while training heterogeneous local models of different sizes. In the DeepMIMO-based simulation with 10 users, the reported result is an approximately 20% improvement in channel-estimation accuracy, a 16% reduction in end-user computational overhead, and a 15% reduction in per-epoch training time compared with the benchmarks, with better privacy because only part of each model is transmitted.

What carries the argument

The mechanism is a coalition formation game in which each coalition $S_j$ carries utility $U(S_j) = A - \sum_{p \in S_j} e_{j,p}$, where $e_{j,p}$ is the normalized mean-squared channel-estimation error of user $p$; the altruistic preference order says a user switches coalitions only when both the coalition it joins and the one it leaves improve. The stability proof identifies the game as an exact potential game with potential $\varphi = \sum_{j \in S_k, S_k \in \mathcal{S}} u(a_{k,j})$, so every unilateral move changes the utility and the potential by the same amount, guaranteeing a pure-strategy Nash equilibrium. To find such a partition in practice, each user runs a Q-network, with individual Q-values combined in a QMIX mixing network and reward $1 - e$, where $e$ is the average NMSE after one federated-learning epoch. Heterogeneous FL is realized by distilling a large global model into a smaller local model with a shared parameter part and a distillation part, and transfer learning initializes each user's local model from neighboring central models weighted by distance and RSRP similarity.

What would settle it

Freeze the local models between coalition moves and recompute the exact-potential-game stable partition; if the partition the QMIX algorithm converges to differs from that static partition, or if the algorithm's coalition choices cycle when retraining is allowed, the theorem's guarantee would not be governing the implemented system.

Watch

Extended reading notes

Core claim

The central claim is that partitioning users into coalitions whose members have correlated fading is the right organizational principle for federated cascaded-channel estimation in RIS-assisted cell-free MIMO, and that this partition can be discovered by distributed deep reinforcement learning instead of centralized optimization. The paper formalizes user grouping as a coalition formation game, defines an altruistic preference order, and proves in Theorem 1 that at least one stable coalition structure exists, identifying the optimal decomposition of the network utility maximization problem with a stable structure. It then augments heterogeneous federated learning with a transfer-learning initialization based on distance and received-signal-power similarity, and reports that the combined framework improves channel estimation accuracy by about 20% and cuts end-user computational overhead by about 16% relative to centralized DML, homogeneous FL, and MMSE baselines.

Load-bearing premise

The stability theorem assumes each coalition's utility is a fixed function of membership, but in the implemented algorithm the utility is the channel-estimation error measured after one round of retraining, which changes every time models update or users switch groups.

Editorial extensions

If this is right

  • If the framework is correct, grouping users with similar channel fading into coalitions is what yields most of the reported gain: at 5 dB SNR, CFFL is reported to outperform a single-group FL baseline by 18% and the FL+Dis transfer-learning baseline by 28% in NMSE.
  • Distributed QMIX decision-making should reach about 97.5% of the centralized DQN reward while eliminating the exchange of other users' coalition choices, so its communication advantage grows as the number of users increases.
  • Heterogeneous FL should reduce end-user FLOPs by about 16% and per-epoch training time by about 15% at a roughly 3% NMSE cost relative to homogeneous FL, which is the trade that makes the method usable on devices with limited computation.
  • Transfer learning that uses both distance and received-signal-power similarity should accelerate convergence and improve NMSE by 33–50% over DML, conventional FL, MMSE, and DCE baselines.
  • Because HFL transmits only the shared part of local model parameters, the paper's privacy claim is that less user data is exposed than in homogeneous FL or centralized learning.

Reading between the lines

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

  • A reader who wants to rely on the stability guarantee should check whether the learned coalition sequence converges to the static-utility stable partition; the paper reports convergence of rewards but not this comparison.
  • The same coalition-formation-guided grouping could be applied to other wireless federated learning tasks where a similarity metric plays the role of channel correlation, such as beam prediction, CSI feedback, or localization, since the game-theoretic machinery does not depend on the specific DNN.
  • The reported 20% accuracy gain and 16% compute saving are for a single 10-user DeepMIMO scenario; scaling to hundreds of users or moving users would test whether QMIX's local-observation design remains stable and whether the transfer-learning initialization still pays off.
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

3 major / 3 minor

Summary. The paper proposes a coalition-formation-guided heterogeneous federated learning (CFFL+HFL) framework for downlink channel estimation in RIS-assisted cell-free MIMO systems. Users are grouped into coalitions via distributed DRL (DQN or QMIX), each coalition trains a local FL model with heterogeneous model sizes via knowledge distillation, and transfer learning based on distance and RSRP similarity initializes the models. The authors claim a 20% improvement in channel estimation accuracy, a 16% reduction in end-user computational overhead, and improved privacy compared with centralized and homogeneous FL baselines. The paper also states Theorem 1, asserting the existence of a stable coalition structure under an altruistic criterion via an exact potential game proof in Appendix A.

Significance. If the stated gains are statistically robust and the stability theorem actually applied to the implemented algorithm, the framework would be a useful integrative contribution to FL-based channel estimation in RIS-assisted cell-free networks, with a plausible combination of coalition games, DRL, HFL, and transfer learning. The simulation study includes several baselines (MMSE, DML, FL, DCE, DQN+FL) and the reported NMSE/complexity trends are internally consistent. However, the theoretical guarantee is not currently connected to the implemented reward mechanism, the empirical claims lack multiple-seed statistics, and the privacy contribution is both qualitatively and quantitatively under-supported. These issues are fixable, but they are load-bearing for the paper's main claims.

major comments (3)
  1. [Section III-D and Appendix A] The exact-potential-game proof in Appendix A assumes that the coalition utility U(S_j) = A - sum e_{j,p} is a static function of coalition membership, with fixed errors e_{j,p}. In the implemented CFFL loop, however, Section III-D defines the reward as R_t = 1 - e, where e is the average NMSE after one epoch of FL training, and those errors change whenever models are retrained (Steps 1-6 in Section III-C) or users switch coalitions. Thus the utility landscape is non-stationary during the DRL process, so Theorem 1's stable-partition guarantee does not transparently apply to the algorithm whose performance is evaluated in Section IV. Please either formulate a static coalition utility (e.g., based on channel correlation or data distribution) for which Theorem 1 holds and connect the DRL to that game, or explicitly restrict the theorem to the static setting and explain why the dynamic reward still yields the claimed stability.
  2. [Section IV] The central quantitative claims ("20% accuracy improvement," "16% computational overhead reduction") are reported without any error bars, multiple-seed trials, or scenario sensitivity analysis; Figures 12-16 show only single traces. It is therefore unclear whether the reported gains are within training or initialization noise. Please report means and variances over at least several independent runs and specify the exact benchmark and SNR at which the 20% figure is computed, since Section IV-C reports gains of 18% and 28% at SNR = 5 dB while Section IV-B reports a roughly 30% gain at 0-2 dB.
  3. [Section III-A, Section III-C Step 4, and Table III] The privacy-improvement claim is not supported and appears partially contradicted by the described method. Eq. (11) has each active UE train on raw data from Z neighboring UEs with a data-sharing ratio a, and Step 4 says the central server trains the distillation part using data collected by the edge server (uplink data), which are raw-data exchanges of the kind FL is intended to avoid. In addition, Table III shows that the HFL local model has 8,409,856 parameters versus 8,428,416 for homogeneous FL, a reduction of only 0.22%, so the assertion that HFL "transmits only a part of model parameters" does not amount to a meaningful privacy gain. Please specify the threat model, quantify the privacy improvement, and either justify or temper the abstract's privacy claim.
minor comments (3)
  1. [Throughout] There are numerous typographical errors, including "altruitic" for "altruistic" (Definition 1, Theorem 1, Appendix A), "for the shake of fairness" (Section IV), "Rewawrd" (Figure 14 caption), "outperfroms" (Section IV-B), and "Siganl" in reference [4]; a thorough copyedit is needed.
  2. [Eq. (12) and Eq. (14)] The symbol L is used for the reference distance in Eq. (12) and for the number of users in Eq. (14), and earlier as the number of paths in Eqs. (1) and (3); this overloading makes the notation hard to follow.
  3. [Definition 1] In Definition 1, the notation S1 ⊆ S and S2 ⊆ S is confusing because S is defined as a coalition structure (a set of coalitions); S1 and S2 should be elements of S rather than subsets, or the structure should be defined differently.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the stability theorem follows from a standard potential-game argument and the performance gains are measured against external benchmarks.

full rationale

The paper's central theoretical result, Theorem 1 (Appendix A), asserts existence of a stable coalition structure and is proved by constructing an exact potential game: the change in a user's altruistic utility under a unilateral coalition switch is shown equal to the change in the potential function phi (Eqs. (21)-(23)), and existence of a pure-strategy Nash equilibrium follows from Monderer and Shapley [40]. This proof is self-contained with respect to the paper's definitions and does not use the simulation results; the utilities U(S_j)=A - sum e_{j,p} are inputs defined from channel-estimation error, not fitted to the reported 20% accuracy improvement. The empirical claims of 20% NMSE improvement, 16% FLOPs reduction, and lower communication overhead are obtained by comparing the proposed framework against external benchmarks (MMSE, DML, centralized DCE, homogeneous FL, FL+RSRP+Dis) on the DeepMIMO dataset, so the reported gains are measured rather than imposed by construction. The only self-citation is to the authors' WCNC version [1], used to acknowledge partial prior publication; it is not load-bearing for the stability proof or the empirical comparison. A separate non-circularity concern is that the DRL reward in Section III-D is a one-epoch NMSE that changes as models are retrained, while the potential-game proof in Appendix A treats the errors e_{j,p} as static functions of coalition membership; this is a validity gap between the theorem's assumptions and the implemented algorithm, not a circular reduction. Overall, no derivation step reduces to its own inputs, so the circularity score is low.

Assumptions & free parameters 5 free parameters · 5 assumptions · 0 invented entities

The central empirical claims rely on the transfer-learning similarity heuristic and several hand-chosen parameters such as L, Delta, and a, but the existence theorem itself depends only on standard potential-game reasoning under a static-utility assumption. The main unverified load-bearing items are the channel-similarity heuristic and the static game abstraction.

free parameters (5)
  • Reference distance L in transfer learning weight (eq. 12) = Not specified
    Predefined normalization distance for alpha'_m; no sensitivity analysis is provided, and the value affects how much neighbors contribute to transfer initialization.
  • Power window Delta and center power Pcenter (eq. 13) = Not specified
    Predefined range defining which neighboring users are considered power-similar; hand-chosen, with no sensitivity analysis or justification from data.
  • Data-sharing ratio a in eq. (11) = 0.1
    Empirical value taken from a transfer learning survey; controls how much neighboring user data is added to an active user's training set.
  • Positive constant A in coalition utility (eq. 16) = Not specified
    Added to keep utilities non-negative; because it is additive over all coalitions, it does not change the argmax of the coalition formation objective.
  • Maximum number of coalitions J = 3
    Simulation parameter in Table II that constrains the DRL action space; it is chosen by the authors, not optimized or justified.
assumptions (5)
  • domain assumption Saleh-Valenzuela channel model for BS-RIS and RIS-UE channels (Section II-A, eqs. 1-3)
    Standard multipath channel model used to define channels; the simulations use DeepMIMO rather than direct generation, but the formulation assumes this model.
  • domain assumption Direct BS-UE links are completely obstructed (Section II-A)
    The paper states that direct links are assumed obstructed and that the model can be extended to direct links; all simulated results rely on the no-direct-link assumption.
  • domain assumption Uplink-downlink channel reciprocity (Section III-C, Step 4)
    Used to convert uplink received data into downlink training samples for the distillation part; standard in TDD but not guaranteed in every deployment.
  • ad hoc to paper Users with similar distance and RSRP experience similar channel fading (Section III-B, eq. 13)
    Heuristic motivation for transfer learning weights; not empirically validated in the paper and load-bearing for the reported transfer-learning gains.
  • ad hoc to paper Static utility in the exact-potential-game proof (Appendix A, eq. 16)
    The theorem treats e_{j,p} as fixed coalition-dependent errors, whereas the implementation obtains them from stochastic FL training, so the static assumption is not stated and may not hold.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Coalition Formation for Heterogeneous Federated Learning Enabled Channel Estimation in RIS-assisted Cell-free MIMO." pith.science (2026). https://pith.science/paper/72TEFO4M

@misc{pith2026250205538,
  author       = {Pith},
  title        = {Pith review of: Coalition Formation for Heterogeneous Federated Learning Enabled Channel Estimation in RIS-assisted Cell-free MIMO},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/72TEFO4M}},
  note         = {Machine review of arXiv:2502.05538}
}
read the original abstract

Downlink channel estimation remains a significant bottleneck in reconfigurable intelligent surface-assisted cell-free multiple-input multiple-output communication systems. Conventional approaches primarily rely on centralized deep learning methods to estimate the high-dimensional and complex cascaded channels. These methods require data aggregation from all users for centralized model training, leading to excessive communication overhead and significant data privacy concerns. Additionally, the large size of local learning models imposes heavy computational demands on end users, necessitating strong computational capabilities that most commercial devices lack. To address the aforementioned challenges, a coalition-formation-guided heterogeneous federated learning (FL) framework is proposed. This framework leverages coalition formation to guide the formation of heterogeneous FL user groups for efficient channel estimation. Specifically, by utilizing a distributed deep reinforcement learning (DRL) approach, each FL user intelligently and independently decides whether to join or leave a coalition, aiming at improving channel estimation accuracy, while reducing local model size and computational costs for end users. Moreover, to accelerate the DRL-FL convergence process and reduce computational burdens on end users, a transfer learning method is introduced. This method incorporates both received reference signal power and distance similarity metrics, by considering that nodes with similar distances to the base station and comparable received signal power have a strong likelihood of experiencing similar channel fading. Massive experiments performed that reveal that, compared with the benchmarks, the proposed framework significantly reduces the computational overhead of end users by 16%, improves data privacy, and improves channel estimation accuracy by 20%.

Figures

Figures reproduced from arXiv: 2502.05538 by the authors.

Figure 1
Figure 1. RIS-assisted cell-free MIMO network. II. SYSTEM MODEL AND PROBLEM FORMULATION An RIS-assisted cell-free MIMO wireless downlink com￾munication system is considered, as illustrated in [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. The concept of heterogeneous federated learning net [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Aggregation process of heterogeneous federated learn [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (10 more)
Figure 4
Figure 4. Figure 4: Composition of models [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: Coalition formation diagram for channel estimation in [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 7
Figure 7. Figure 7: Qmix-enabled coalitions formation. 2) Qmix-enabled CFFL DQN is a centralized algorithm that constructs a large joint action-value mapping function from global observa￾tions. However, it may lead to a rapid increase in complex￾ity as the number of users grows, while fai…
Figure 8
Figure 8. Figure 8: Sparse distribution scenario: two-dimensional geo [PITH_FULL_IMAGE:figures/full_fig_p009_8.png]
Figure 9
Figure 9. Figure 9: Channel correlation coefficient with 10 sparse users. [PITH_FULL_IMAGE:figures/full_fig_p009_9.png]
Figure 12
Figure 12. Figure 12: Note that to show the performance gains brought [PITH_FULL_IMAGE:figures/full_fig_p009_12.png]
Figure 13
Figure 13. Figure 13: The performance of DQN-based algorithm at different [PITH_FULL_IMAGE:figures/full_fig_p010_13.png]
Figure 12
Figure 12. Figure 12: NMSE versus SNR under different algorithms. [PITH_FULL_IMAGE:figures/full_fig_p010_12.png]
Figure 14
Figure 14. Figure 14: Rewawrd vs Epochs under different algorithms. [PITH_FULL_IMAGE:figures/full_fig_p011_14.png]
Figure 15
Figure 15. Figure 15: The performance of DQN-based algorithm at different [PITH_FULL_IMAGE:figures/full_fig_p011_15.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

40 extracted references · 37 canonical work pages

  1. [1]

    IRS channel estimation in cell-free MIMO network: A coalition formation guided federated learning approach,

    H. Liu, N. Qi, X. Li, A. A. A. Boulogeorgos, T. A. Tsiftsis, M. Xiao, and J. R ¨oning, “IRS channel estimation in cell-free MIMO network: A coalition formation guided federated learning approach,” IEEE Wireless Communications and Networking Conference(WCNC) , 2025

    work page 2025

  2. [2]

    Five disruptive technology directions for 5G,

    F. Boccardi, R. W. Heath, A. Lozano, T. L. Marzetta, and P. Popovski, “Five disruptive technology directions for 5G,” IEEE Communications Magazine, vol. 52, no. 2, pp. 74–80, 2014

    work page 2014

  3. [3]

    Massive MIMO for next generation wireless systems,

    E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta, “Massive MIMO for next generation wireless systems,” IEEE Communications Magazine, vol. 52, no. 2, pp. 186–195, 2014

    2014

  4. [4]

    Massive MIMO networks: Spectral, energy, and hardware efficiency,

    E. Bj ¨ornson, J. Hoydis, and L. Sanguinetti, “Massive MIMO networks: Spectral, energy, and hardware efficiency,” Found. Trends Siganl Pro- cess, vol. 11, no. 3, pp. 154–655, 2017

    work page 2017

  5. [5]

    Spectral efficiency improve- ment and power control optimization of massive mimo networks,

    X. Zhang, H. Qi, X. Zhang, and L. Han, “Spectral efficiency improve- ment and power control optimization of massive mimo networks,” IEEE Access, vol. 9, pp. 11 523–11 532, 2021

    work page 2021

  6. [6]

    Deep reinforcement learning-based intelligent reflecting surface for secure wireless communications,

    H. Yang, Z. Xiong, J. Zhao, D. Niyato, L. Xiao, and Q. Wu, “Deep reinforcement learning-based intelligent reflecting surface for secure wireless communications,” IEEE Transactions on Wireless Communi- cations, vol. 20, no. 1, pp. 375–388, 2021

    work page 2021

  7. [7]

    A programmable wireless world with reconfigurable intelligent surfaces,

    E. Bj ¨ornson, “A programmable wireless world with reconfigurable intelligent surfaces,” July. 2020. [Online]. Available: https://www. youtube.com/watch?v=9cBn5piI9Ms

    work page 2020

  8. [8]

    Reconfiguring wireless environments via intelligent surfaces for 6G: reflection, modulation, and security,

    X. Jindan, Y . Chau, H. Chongwen, H. Naveed Ul, G. C. Alexandropou- los, M. D. Renzo, and M. Debbah, “Reconfiguring wireless environments via intelligent surfaces for 6G: reflection, modulation, and security,” SCIENCE CHINA Information Sciences , vol. 66, no. 3, pp. 130 304–, 2023

    work page 2023

Show all 40 references
  1. [9]

    Two-timescale design for reconfigurable intelligent surface-aided massive MIMO systems with imperfect CSI,

    K. Zhi, C. Pan, H. Ren, K. Wang, M. Elkashlan, M. D. Renzo, R. Schober, H. V . Poor, J. Wang, and L. Hanzo, “Two-timescale design for reconfigurable intelligent surface-aided massive MIMO systems with imperfect CSI,” IEEE Transactions on Information Theory , vol. 69, no. 5, pp...

    2023

  2. [10]

    Achievable rate optimization for aerial intelligent reflecting surface-aided cell-free massive MIMO system,

    T. Zhou, K. Xu, X. Xia, W. Xie, and J. Xu, “Achievable rate optimization for aerial intelligent reflecting surface-aided cell-free massive MIMO system,” IEEE Access, vol. 9, pp. 3828–3837, 2021

    2021

  3. [11]

    Transmit/passive beamforming design for multi-IRS assisted cell-free MIMO networks,

    K. Wang, N. Qi, X. Guan, Q. Shi, M. Xiao, S. Jin, and K.-K. Wong, “Transmit/passive beamforming design for multi-IRS assisted cell-free MIMO networks,” IEEE Systems Journal, vol. 17, no. 4, pp. 6282–6291, 2023

    2023

  4. [12]

    Cell-free MIMO systems powered by intelligent reflecting surfaces,

    T. Noh and J. Choi, “Cell-free MIMO systems powered by intelligent reflecting surfaces,” IEEE Communications Letters , vol. 26, no. 5, pp. 1076–1080, 2022

    2022

  5. [13]

    Fairness-aware location and hybrid beamforming optimization in IRSs-aided cell- free MIMO system,

    K. Wang, N. Qi, M. Xiao, S. Hu, and B. Sihlbom, “Fairness-aware location and hybrid beamforming optimization in IRSs-aided cell- free MIMO system,” in 2023 IEEE/CIC International Conference on Communications in China (ICCC) , 2023, pp. 1–6

    2023

  6. [14]

    Network deployment with energy efficiency optimization in IRS-assisted cell-free MIMO system,

    H. Liu, N. Qi, K. Wang, T. A. Tsiftsis, W. Wang, and Y . Liu, “Network deployment with energy efficiency optimization in IRS-assisted cell-free MIMO system,” Physical Communication, vol. 63, p. 102287, 2024

    2024

  7. [15]

    Reconfigurable intelligent surfaces aided energy efficiency maximization in cell-free networks,

    K. Wang, N. Qi, H. Liu, A.-A. A. Boulogeorgos, T. A. Tsiftsis, M. Xiao, and K.-K. Wong, “Reconfigurable intelligent surfaces aided energy efficiency maximization in cell-free networks,” IEEE Wireless Communications Letters, vol. 13, no. 6, pp. 1596–1600, 2024

    2024

  8. [16]

    Channel estimation and low-complexity beamforming design for passive intelligent surface assisted MISO wire- less energy transfer,

    D. Mishra and H. Johansson, “Channel estimation and low-complexity beamforming design for passive intelligent surface assisted MISO wire- less energy transfer,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , 2019, pp. 4659–4663

    2019

  9. [17]

    Cascaded channel estimation for large intelligent metasurface assisted massive MIMO,

    Z.-Q. He and X. Yuan, “Cascaded channel estimation for large intelligent metasurface assisted massive MIMO,” IEEE Wireless Communications Letters, vol. 9, no. 2, pp. 210–214, 2020

    2020

  10. [18]

    Trice: A channel estimation framework for RIS-aided millimeter-wave MIMO systems,

    K. Ardah, S. Gherekhloo, A. L. F. de Almeida, and M. Haardt, “Trice: A channel estimation framework for RIS-aided millimeter-wave MIMO systems,” IEEE Signal Processing Letters , vol. 28, pp. 513–517, 2021

    2021

  11. [19]

    Deep learning-based joint channel estimation and csi feedback for RIS-assisted communications,

    H. Feng, Y . Xu, and Y . Zhao, “Deep learning-based joint channel estimation and csi feedback for RIS-assisted communications,” IEEE Communications Letters, vol. 28, no. 8, pp. 1860–1864, 2024

    2024

  12. [20]

    Pruning the pilots: Deep learning- based pilot design and channel estimation for MIMO-OFDM systems,

    M. B. Mashhadi and D. G ¨und¨uz, “Pruning the pilots: Deep learning- based pilot design and channel estimation for MIMO-OFDM systems,” IEEE Transactions on Wireless Communications , vol. 20, no. 10, pp. 6315–6328, 2021

    2021

  13. [21]

    Distributed machine learning for wireless communication networks: Techniques, ar- chitectures, and applications,

    S. Hu, X. Chen, W. Ni, E. Hossain, and X. Wang, “Distributed machine learning for wireless communication networks: Techniques, ar- chitectures, and applications,” IEEE Communications Surveys Tutorials, vol. 23, no. 3, pp. 1458–1493, 2021

    2021

  14. [22]

    Distributed machine learning based downlink channel estimation for RIS assisted wireless communications,

    L. Dai and X. Wei, “Distributed machine learning based downlink channel estimation for RIS assisted wireless communications,” IEEE Transactions on Communications, vol. 70, no. 7, pp. 4900–4909, 2022

    2022

  15. [23]

    Federated learning for channel estimation in conventional and RIS-assisted massive MIMO,

    A. M. Elbir and S. Coleri, “Federated learning for channel estimation in conventional and RIS-assisted massive MIMO,” IEEE Transactions on Wireless Communications, vol. 21, no. 6, pp. 4255–4268, 2022

    2022

  16. [24]

    Federated learning enabled channel estimation for RIS-aided multi-user wireless systems,

    W. Shen, Z. Qin, and A. Nallanathan, “Federated learning enabled channel estimation for RIS-aided multi-user wireless systems,” in 2022 IEEE International Conference on Communications Workshops (ICC Workshops), 2022, pp. 812–817

    2022

  17. [25]

    Federated learning- based channel estimation for RIS-aided communication systems,

    B. Qiu, X. Chang, X. Li, H. Xiao, and Z. Zhang, “Federated learning- based channel estimation for RIS-aided communication systems,” IEEE Wireless Communications Letters, vol. 13, no. 8, pp. 2130–2134, 2024

    2024

  18. [26]

    Heterogeneous federated learning,

    F. Yu, W. Zhang, Z. Qin, Z. Xu, D. Wang, C. Liu, Z. Tian, and X. Chen, “Heterogeneous federated learning,” 2022. [Online]. Available: https://arxiv.org/abs/2008.06767

    2022 arXiv

  19. [27]

    Data-free knowledge distillation for heterogeneous federated learning,

    Z. Zhu, J. Hong, and J. Zhou, “Data-free knowledge distillation for heterogeneous federated learning,” vol. 139, pp. 12 878–12 889, 18–24 Jul 2021. [Online]. Available: https://proceedings.mlr.press/v139/ zhu21b.html

    2021

  20. [28]

    A coalition formation game approach for personalized federated learning,

    L. Wu, S. Guo, Y .-X. Ding, Y . Zhan, and J. Zhang, “A coalition formation game approach for personalized federated learning,” ArXiv, vol. abs/2202.02502, 2022. [Online]. Available: https://api. semanticscholar.org/CorpusID:246634014

    2022 arXiv

  21. [29]

    Coalitional federated learning: Improving communication and training on non-iid data with selfish clients,

    S. Arisdakessian, O. A. Wahab, A. Mourad, and H. Otrok, “Coalitional federated learning: Improving communication and training on non-iid data with selfish clients,” IEEE Transactions on Services Computing , vol. 16, no. 4, pp. 2462–2476, 2023

    2023

  22. [30]

    Joint design of coalition formation and semi-blind channel estimation in fog radio access networks,

    Z. Wang, F. Yang, S. Yan, S. Memon, Z. Zhao, and C. Hu, “Joint design of coalition formation and semi-blind channel estimation in fog radio access networks,” China Communications , vol. 16, no. 11, pp. 1–15, 2019

    2019

  23. [31]

    Deep reinforcement learning based coalition formation for energy trading in smart grid,

    M. Sadeghi and M. Erol-Kantarci, “Deep reinforcement learning based coalition formation for energy trading in smart grid,” pp. 200–205, 2021

    2021

  24. [32]

    Dynamic coalition formation and routing for multirobot task allocation via reinforcement learning,

    W. Dai, A. Bidwai, and G. Sartoretti, “Dynamic coalition formation and routing for multirobot task allocation via reinforcement learning,” pp. 16 567–16 573, 2024

    2024

  25. [33]

    Coalition game of radar network for multitarget tracking via model-based multiagent re- inforcement learning,

    K. Xiong, T. Zhang, G. Cui, S. Wang, and L. Kong, “Coalition game of radar network for multitarget tracking via model-based multiagent re- inforcement learning,” IEEE Transactions on Aerospace and Electronic Systems, vol. 59, no. 3, pp. 2123–2140, 2023

    2023

  26. [34]

    Super-resolution channel estimation for mmwave massive MIMO with hybrid precoding,

    C. Hu, L. Dai, T. Mir, Z. Gao, and J. Fang, “Super-resolution channel estimation for mmwave massive MIMO with hybrid precoding,” IEEE Transactions on Vehicular Technology , vol. 67, no. 9, pp. 8954–8958, 2018

    2018

  27. [35]

    Communication-efficient learning of deep networks from decentralized data,

    H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in International Conference on Artificial Intelligence and Statistics, 2016

    2016

  28. [36]

    A survey on deep transfer learning,

    C. Tan, F. Sun, T. Kong, W. Zhang, C. Yang, and C. Liu, “A survey on deep transfer learning,” 2018. [Online]. Available: https://api.semanticscholar.org/CorpusID:51929263

    2018

  29. [37]

    5G Cell Selection Criteria,

    N. Gupta1, “5G Cell Selection Criteria,” https://www.telecomhall.net/t/ 5g-cell-selection-criteria/23860, Jun. 2023, (accessed Feb. 2024)

    2023

  30. [38]

    Semi-passive elements assisted chan- nel estimation for intelligent reflecting surface-aided communications,

    X. Hu, R. Zhang, and C. Zhong, “Semi-passive elements assisted chan- nel estimation for intelligent reflecting surface-aided communications,” IEEE Transactions on Wireless Communications , vol. 21, no. 2, pp. 1132–1142, 2022

    2022

  31. [39]

    Deepmimo: A generic deep learning dataset for mil- limeter wave and massive mimo applications,

    A. Alkhateeb, “Deepmimo: A generic deep learning dataset for mil- limeter wave and massive mimo applications,” in Proc. of Information Theory and Applications Workshop (ITA) , San Diego, CA, 02 2019, pp. 1–8

    2019

  32. [40]

    Potential games,

    D. Monderer and L. S. Shapley, “Potential games,” Games and Economic Behavior, vol. 14, no. 1, pp. 124–143, 1996

    1996

Pith tools

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