Pith. sign in

REVIEW 4 major objections 5 minor 25 references

RadioTrace: Transmitter-Aware Diffusion for Radio Map Estimation without Deployment-Time Fine-Tuning

T0 review · 4 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read Radio maps can be rebuilt from sparse sensors by refining transmitter locations inside a frozen diffusion loop.

desk verdict RadioTrace is a genuinely new integration of Tx-coordinate refinement into the reverse diffusion loop for radio map estimation; empirically solid on single-Tx and linearly superposed multi-Tx scenes, but the linear-superposition assumption for multi-Tx validation needs a direct test. read the letter →

arxiv 2607.20909 v1 pith:JXXVBFGM submitted 2026-07-23 eess.SP cs.LG

Liu Yang , Qiang Li , Zhuo Cao , Weijie Xiong , Guomin Sun , Jingran Lin This is my paper · ORCID
classification eess.SPcs.LG
keywords radiomapestimationdiffusionpriortransmitterlocalizationsparseRSSmeasurementsinverseproblemstraight-throughestimatorrestricted-areasamplingpropagation-guidedK-means
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

RadioTrace claims that a radio map can be reconstructed from very few received-signal-strength measurements, without retraining or fine-tuning any network, by using a frozen diffusion model as the map generator and treating the unknown transmitter locations as latent variables that are refined inside the denoising loop. The reason this matters is that real deployments face nonuniform and restricted-area sampling, where supervised estimators trained for one sampling pattern degrade; a method that adapts its own physical conditioning variables at inference could generalize without deployment-time data. On the RadioMapSeer and BART-Lab test scenes the paper reports that this loop stays competitive with learned methods under random sampling and maintains strong reconstruction quality when entire regions are unmeasured, while also shrinking transmitter localization error. The paper's central device is an alternating loop: generate a map conditioned on current transmitter positions, then back-propagate the mismatch between the generated map and the sparse observations into those positions, and repeat.

What carries the argument

The load-bearing object is the joint RM-generation and Tx-update loop defined by Eq. (7). The frozen diffusion generator $f_\theta$ maps $(x_t, t, B, C_t)$ to a clean estimate $\hat{x}_t^0$; the transmitter coordinates $\Omega_t$ are optimized so that $\hat{x}_t^0$ matches the masked observations $O$ at sampled cells, while a linearly scheduled proximal term $\frac{\kappa_t}{2}\|\Omega_t - \Omega_t^\star\|_F^2$ pulls the iterates toward the best anchor found so far, suppressing oscillation as the noise level falls. The binary map is relaxed to a sum of Gaussian heatmaps so that gradients with respect to coordinates can be computed via a straight-through estimator, and the whole loop is seeded by propagation-guided K-means, which maps each RSS value to a range circle and clusters back-projected candidate transmitter positions. The mechanism's work is to make the sparse measurements influence not only the reconstructed map but the physical conditioning variables of the generative prior itself.

What would settle it

Take a real measured multi-transmitter urban scene with known transmitter positions and strong correlated shadowing between transmitters, sample 1% of the map with a restricted-area mask covering one transmitter, run RadioTrace, and compare its reconstructed map and refined transmitter coordinates against the known ground truth; if the reconstruction error is no better than ordinary Kriging or the localized transmitter error exceeds the initialization error, the claim that the diffusion loop recovers geometry without fine-tuning is refuted. Alternatively, a synthetic experiment that breaks superposition, such as adding a non-linear interaction term between two transmitters' fields before sampling, and showing a sharp PSNR drop would isolate the weakness in the generative prior assumption.

Watch

Extended reading notes

Core claim

The central claim is that embedding transmitter-coordinate refinement inside the reverse diffusion process of a frozen pre-trained radio-map generator turns sparse RSS measurements into a joint radio-map and transmitter-recovery problem that needs no deployment-time fine-tuning. At each reverse step $t$ the generator produces a clean estimate $\hat{x}_t^0$ conditioned on a binary transmitter map built from continuous coordinates $\Omega_t$, and the coordinates are updated by gradient descent on $L_t(\Omega_t) = \|\hat{x}_t^0(\Omega_t)\odot M - O\|_F^2 + \frac{\kappa_t}{2}\|\Omega_t - \Omega_t^\star\|_F^2$, where $\Omega_t^\star$ is the best-anchor coordinate found so far. Because the soft transmitter map is a sum of Gaussian heatmaps, gradients flow through a straight-through estimator even though the conditioning map used by the generator is binary. A propagation-guided K-means initializer converts each measured RSS to a distance circle and clusters back-projected candidate positions to seed the loop. The stability analysis shows that, under bounded drift and perturbation assumptions, the expected squared gradient of the conditional-mean refinement loss tends to zero, so the refinement asymptotically enters a stationary regime.

Load-bearing premise

The load-bearing premise is that a generator trained on single-transmitter radio maps can faithfully represent multi-transmitter scenes by pixel-wise summing single-transmitter maps in linear power and conditioning on a multi-transmitter binary map; if real multi-transmitter propagation involves non-linear interactions or correlated shadowing that this prior cannot express, both the generated maps and the transmitter-coordinate gradients would be systematically biased.

Editorial extensions

If this is right

  • A pre-trained radio-map generator can be reused for new deployment areas and sampling patterns with no retraining, because adaptation happens through the transmitter coordinates at inference.
  • Under restricted-area sampling, where no measurements exist inside certain regions that may contain transmitters, reconstruction quality is maintained rather than collapsing as it does for sampling-pattern-mismatched supervised models.
  • The same loop returns transmitter locations as a by-product, reducing mean localization error compared with the initialization across sampling rates.
  • The stability theorem implies that the coordinate refinement does not diverge as denoising progresses, provided the drift and stochastic perturbation are summable as assumed.
  • Fewer reverse steps can be used; the paper reports that $T=50$ roughly doubles throughput with small quality loss, and $T=10$ keeps usable quality, so accuracy can be traded against runtime.

Reading between the lines

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

  • The same "refine the physical conditioning variable through the frozen generator" pattern could extend to other inverse problems where a generative prior is conditioned on an unknown geometric object, such as source positions in imaging, antenna orientations, or scatterer locations; the paper does not claim this.
  • The multi-transmitter test scenes are synthesized by summing single-transmitter maps in linear power, so the method's practical ceiling on real multi-transmitter channels depends on how well propagation obeys superposition; testing on measured multi-transmitter data with correlated shadowing is a natural next step.
  • The best-anchor proximal schedule suggests a design principle: early diffusion steps explore geometry, late steps lock it in; similar anchor schedules could stabilize other latent-variable-guided diffusion inversions.
  • Because the method requires only a rough site-calibrated path-loss model for initialization, its accuracy in cluttered indoor or dense-urban environments may hinge on that calibration; an adaptive or learned initializer could remove this dependency.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 5 minor

Summary. The paper proposes RadioTrace, a radio map (RM) estimation framework that reconstructs the full received-signal-strength (RSS) field from sparse measurements by embedding transmitter (Tx) coordinate refinement into the reverse denoising loop of a frozen, pre-trained diffusion prior. At each reverse step, the current Tx coordinates are converted into a binary Tx map, used to condition the frozen generator, and the masked reconstruction error between the generated clean estimate and the sparse observations is back-propagated through the soft Tx map to update the Tx coordinates. A propagation-guided K-means (PG-KMeans) initializer provides geometry-aware starting Tx positions, and a best-anchor proximal term stabilizes the refinement. The paper also provides a stochastic stability theorem for the Tx-coordinate update under time-varying objectives and reports experiments on RadioMapSeer and BART-Lab under random and restricted-area sampling, with ablations, noise robustness, localization accuracy, extreme sparsity, runtime, and scalability studies.

Significance. If the central claim holds, RadioTrace addresses a practically important limitation of prior-based RM estimation: it avoids deployment-time fine-tuning while explicitly incorporating the physical Tx geometry into the generative reconstruction process. The paper has clear strengths: it evaluates on two datasets across four sampling ratios, includes extensive ablations isolating the contributions of PG-KMeans, momentum GD, and the best-anchor mechanism, reports noise robustness and Tx localization accuracy, and provides the source code. The experimental trajectory of the refinement loss in Section V-L is a useful sanity check for the stability narrative. However, the significance is moderated by two weaknesses: the multi-Tx validation on RadioMapSeer is performed under a linear-superposition synthesis assumption that is exactly the assumption needing test, and the theoretical result is a lim-inf gradient bound for a time-varying objective whose relationship to the actual algorithm is only partially verified.

major comments (4)
  1. [V-A] The RadioMapSeer multi-Tx test scenes are generated by converting each single-Tx map to linear power, summing the maps pixel-wise, and converting back to dBm (Section V-A). This linear-superposition synthesis validates RadioTrace exactly under the assumption that a single-Tx-trained prior can represent multi-Tx fields by additive power composition; it does not test the prior's capacity under inter-Tx coupling, correlated shadowing, or building-dependent interactions. The only native multi-Tx evaluation, BART-Lab, simultaneously changes the solver, building representation, Tx heights, and Tx power and is reported only under restricted-area sampling, so it cannot isolate multi-Tx prior capacity from domain shift. I recommend adding a controlled native multi-Tx experiment (for example, varying R on a dataset with true multi-Tx fields while holding other factors fixed) or narrowing the paper's multi-Tx claims accordingly.
  2. [IV, Theorem 1] Theorem 1 establishes lim inf_{k to infinity} E[||grad Lbar_k(Omega_k)||^2] = 0 for a time-varying stochastic objective. Because Lbar_k itself changes with k and the drift sequence dbar_k is summable, the lim-inf statement can be satisfied even if the algorithm never approaches a stationary point of any fixed objective, for instance if the objective becomes flat over time. The interpretation in Section IV that the refinement 'asymptotically enters a stationary regime' and the claim of 'stability' therefore overstate the result. Please state precisely what is guaranteed: at most, the expected squared gradient of the conditional mean loss vanishes along a subsequence for a sequence of objectives whose drift tends to zero. A corollary for a fixed objective, or a bound on the stationarity gap with respect to the final objective Lbar_T, would make the theoretical contribution substantive.
  3. [IV, Assumption 2] The theorem is conditional on Assumption 2, which requires summable objective drift sum dbar_k, summable gradient bias sum eta_k delta_k, and summable fluctuation sum eta_k sigma_k^2. These conditions are not verified for the actual RadioTrace recursion: the straight-through estimator gradient bias, the rounding error in the binary Tx map, and the temporal variation of Lbar_k due to the diffusion noise schedule are not bounded a priori. Section V-L's empirical curves illustrate behavior on one representative sample only. As written, the analysis is a conditional statement about a generic recursion under assumptions that may not hold for the proposed algorithm; please either prove the conditions for a stylized version of the update, such as with a fixed generator and Gaussian noise, or explicitly frame the theorem as a conditional stability result for a generic stochastic proximal-gradient recursion.
  4. [III-C, Eq. (7); Algorithm 1] The best-anchor term in the objective is defined in Eq. (7) as Omega*_t = argmin over Omega_s, s >= t, of ||xhat_s0(Omega_s) circle M - O||_F^2, but Algorithm 1 updates the anchor only when the current loss improves (line 22). This online approximation makes the proximal target a function of the trajectory, which is not analyzed in the theory of Section IV, where Lbar_k is treated as an exogenous time-varying function. The mismatch should be flagged explicitly, and either the analysis should be extended to the online anchor or the definition in Eq. (7) revised to match the algorithm.
minor comments (5)
  1. [III-D, Eq. (13); Algorithm 1] Algorithm 1 line 5 assigns samples using the absolute deviation | ||s_k - omega_i|| - d_k |, while Eq. (13) defines the range-consistency distortion with the squared residual (||s_k - omega_i|| - d_k)^2. These are equivalent for the per-sample argmin with fixed centers, but the relation should be stated to avoid confusion.
  2. [III-D, Eq. (15)] The definition of the weight Otilde_k = log(1 + exp(O(m_k,n_k))) appears in Eq. (15), but the surrounding text refers to 'epsilon > 0 is a small constant' and the notation eOtilde_k is used without a clear definition. Please clean up the notation and define all symbols immediately after the equation.
  3. [V-F, Fig. 9] Section V-B2 reports the Gaussian width as sigma = 10, while Fig. 9(a) plots PSNR against sigma^2 on a logarithmic axis. State explicitly whether the tuning parameter is sigma or sigma^2 so that the reported range is unambiguous.
  4. [Tables II-IV] All results are reported as point estimates without variance. Since the metrics are averaged over test scenes and the baselines vary widely, especially at 1% restricted-area sampling, reporting standard deviations or compact box plots would substantially strengthen the comparison.
  5. [I, Footnote 1] The relationship between this journal paper and the preliminary MLSP version [1] is mentioned only as 'a preliminary version'; please state explicitly which components are new here (PG-KMeans, best-anchor mechanism, stability analysis, and the BART-Lab evaluation) so the incremental contribution is clear.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Tx-coordinate refinement is a standard latent-variable data-fidelity loop; the diffusion prior and baselines are external, and the one self-citation is not load-bearing.

full rationale

The paper's central claim is that a frozen pre-trained diffusion prior (RadioDiff) plus in-loop Tx-coordinate refinement can reconstruct radio maps from sparse RSS measurements without deployment-time fine-tuning. This is evaluated against held-out ground-truth maps and external baselines (Kriging, RME-GAN, LaPnP, RadioDiff-Inverse). The Tx coordinates are latent variables fitted to the same sparse measurements, but the RM reconstruction quality is measured on the complete maps, including unobserved cells; the unmeasured portion is therefore a genuine prediction rather than a refit of the evaluation target. The measurement-consistency loss in Eq. (7) is a standard data-fidelity term, not a renamed version of the evaluation metric. The pre-trained diffusion prior is external work (RadioDiff, reference [9]), and the RadioDiff-Inverse and LaPnP baselines are also external; no load-bearing result is imported from the authors' own prior publications. The only self-citation, reference [1], is an acknowledgment that a preliminary version appeared at MLSP, and it plays no role in the derivation or experiments. The stochastic stability analysis in Theorem 1 is a conventional Lyapunov argument for stochastic approximation under explicit regularity assumptions; it does not assume its own conclusion, and the bounded-drift condition is an assumption, not a hidden restatement of the result. The multi-Tx RadioMapSeer evaluation is synthesized by linear superposition of single-Tx maps, which is a domain-assumption limitation and a potential correctness risk if real multi-Tx propagation includes interactions the single-Tx-trained prior cannot express, but it is not a circular reduction: the synthesis is a test-data construction and does not feed back into the method's derivation or into the training of the prior. No quoted step of the paper reduces to its own inputs by construction, so the appropriate circularity score is 0.

Assumptions & free parameters 6 free parameters · 4 assumptions · 2 invented entities

The method's central claim rests mainly on the capacity of a frozen diffusion prior to represent multi-Tx scenes and on the heuristic Tx gradient (STE through a soft map). Free parameters are limited to standard hyperparameters, none of which is fitted to the evaluation metric in a way that would invalidate the comparison. The largest load-bearing assumption is the multi-Tx linear superposition and the prior's generalization to it.

free parameters (6)
  • Gaussian kernel width sigma = 10 (sensitivity study suggests sigma^2 in [10, 100])
    Controls the smooth approximation of the binary Tx map in Eq. (10). Chosen by hyperparameter search, affects gradient quality and final PSNR.
  • Tx GD learning rate eta = 300
    Step size for coordinate refinement in Eq. (8). Chosen by hand, not derived.
  • Momentum coefficient beta = 0.4
    Momentum in Eq. (8); sensitivity plot shows a shallow optimum around 0.4.
  • Anchor cap kappa = 0.8
    Upper bound of the linear scheduler in Eq. (7). Chosen by hand.
  • PG-KMeans iterations Lmax = 10
    Stopping cap for initialization, stated to typically converge within 10 iterations.
  • Site-calibrated path-loss parameters theta = Not enumerated
    PG-KMeans assumes known 'site-calibrated first-order path-loss model' parameters; these are fitted outside the paper and not specified.
assumptions (4)
  • domain assumption Multi-Tx RSS maps can be synthesized by summing single-Tx linear-power maps from the same building and converting back to dBm.
    Section V-A: the RadioMapSeer evaluation uses composites of single-Tx maps. Real multi-Tx propagation may include interference, shadowing correlations, and building interactions not captured by linear power summation.
  • domain assumption The pre-trained RadioDiff generator, trained on single-Tx measurement-free generation, generalizes to multi-Tx conditioning maps.
    The frozen prior f_theta is used with multi-Tx binary maps and building maps; no fine-tuning is performed. The paper does not verify that the prior can represent multi-Tx scenes beyond the synthetic composite experiments.
  • domain assumption Assumption 2 (bounded drift and perturbation) holds for the Tx refinement process under reverse diffusion.
    The stochastic stability theorem depends on finite sums of drift, bias, and variance. The paper argues this is 'aligned with practical denoising' and cites empirical curves, but does not bound these quantities from the model or data.
  • standard math The straight-through estimator gradient through the binary Tx map is a valid descent direction for the masked reconstruction loss.
    Eq. (11) approximates dC_t/da_t by differentiating the soft Gaussian map; this is a heuristic gradient approximation whose bias is uncontrolled.
invented entities (2)
  • Best-anchor mechanism Omega*_t
    purpose: Stabilizes Tx-coordinate refinement by pulling current coordinates toward the best historical coordinates found during reverse diffusion.
    It is an algorithmic construct, not a physical entity. Its benefit is demonstrated in ablation, but it has no falsifiable handle outside the paper.
  • Soft Tx map C_hat_t (sum of isotropic Gaussians)
    purpose: Provides a differentiable surrogate for the binary Tx map so gradients can flow into Tx coordinates.
    A mathematical relaxation used to define gradients; not a physical quantity.

how reviews work

0 comments
Cite this review

Pith. "Pith review of RadioTrace: Transmitter-Aware Diffusion for Radio Map Estimation without Deployment-Time Fine-Tuning." pith.science (2026). https://pith.science/paper/JXXVBFGM

@misc{pith2026260720909,
  author       = {Pith},
  title        = {Pith review of: RadioTrace: Transmitter-Aware Diffusion for Radio Map Estimation without Deployment-Time Fine-Tuning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JXXVBFGM}},
  note         = {Machine review of arXiv:2607.20909}
}
read the original abstract

Radio map (RM) estimation aims to reconstruct the spatial distribution of wireless signal characteristics, such as received signal strength (RSS), from sparse measurements, a task that is critical for spectrum management, interference mitigation, and localization in modern wireless networks. Traditional approaches, including interpolation and deep learning, either struggle to capture complex propagation effects or require large-scale retraining for each new sampling pattern, which limits their generalization. More recently, prior-based methods have combined pre-trained generative models with measurements to reduce the need for deployment-time model fine-tuning, but they typically treat the prior as a simple regularizer and lack explicit transmitter-aware integration. In this paper, we propose RadioTrace, a novel RM estimation framework without deployment-time fine-tuning that tightly integrates sparse RSS measurements with a frozen pre-trained diffusion prior. RadioTrace incorporates transmitter (Tx) location estimation directly into the denoising loop, iteratively refining Tx coordinates based on reconstruction quality to guide the generative process. To further enhance robustness, we introduce a propagation-guided K-means initialization that mitigates poor local minima in the Tx update and provides a geometry-consistent starting point. Moreover, we provide a stochastic stability analysis for the Tx-coordinate refinement component, showing that the Tx update remains stable under perturbations induced by diffusion sampling and Tx-map relaxation. Extensive experiments demonstrate that RadioTrace achieves competitive performance with state-of-the-art learning-based methods under random sampling, and maintains strong reconstruction quality under restricted-area sampling, highlighting its adaptability, robustness, and practical relevance.

Figures

Figures reproduced from arXiv: 2607.20909 by the authors.

Figure 1
Figure 1. Conceptual illustration of the loop interaction [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Overview of the proposed RadioTrace (black arrow: RM generation step, [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 4
Figure 4. Four-step visualization of the propagation-guided initialization. (a) Convert each sampled RSS to a distance [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figures from the paper (8 more)
Figure 5
Figure 5. Figure 5: The sampled RSS from different sampling mode [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Comparison of RM Estimation on RadioMapSeer dataset under random sampling (row 1, 2) and restricted-area sampling (row 3, 4) with low sampling ratios (1% and 5%). The red regions correspond to restricted areas where no measurements are available. D. Results of comparab…
Figure 7
Figure 7. Figure 7: Comparison of RM Estimation on different methods under restricted-area sampling with low sampling ratios (1% and 5%). The red regions correspond to restricted areas where no measurements are available. TABLE II: Results of random sampling on RadioMapSeer Sampling rate …
Figure 9
Figure 9. Figure 9: PSNR sensitivity at 1% sampling under restricted [PITH_FULL_IMAGE:figures/full_fig_p010_9.png]
Figure 8
Figure 8. Figure 8: Ablation under restricted-area sampling: metric– [PITH_FULL_IMAGE:figures/full_fig_p010_8.png]
Figure 10
Figure 10. Figure 10: Transmitter localization accuracy under restricted-area sampling. TABLE VII: Extreme low sampling rate results under restricted-area sampling on a 256×256 grid (65,536 pixels). Rate Points NMSE RMSE SSIM ↑ PSNR ↑ 0.10% ≈66 0.0435 0.0435 0.9307 29.84 0.05% ≈33 0.0675 0…
Figure 11
Figure 11. Figure 11: Scalability of number of transmitters. L. Empirical Behavior of Tx Refinement During Denoising We further record the Tx-coordinate refinement tra￾jectory of a representative test sample during reverse denoising. As shown in [PITH_FULL_IMAGE:figures/full_fig_p012_11.png]
Figure 12
Figure 12. Figure 12: Empirical behavior of Tx-coordinate refinement during reverse denoising. E[∥ ˜ζk∥ 2 | Fk] ≤ σ 2 k , and ζk = mk + ˜ζk. The update rule is reexpressed as vk+1 = βvk + (1 − β)(gk + mk + ˜ζk), Ωk+1 = Ωk − ηkvk+1. (21) By the Mk-smoothness of L¯ k and Ωk+1−Ωk = −ηkvk+1, L…

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

25 extracted references · 20 canonical work pages

  1. [1]

    RadioTrace: Bridging diffusion priors and rss measurements for accurate radio map estimation,

    L. Yang, Q. Li, Z. Cao, and J. Lin, “RadioTrace: Bridging diffusion priors and rss measurements for accurate radio map estimation,” in 2025 IEEE 35th International Workshop on Machine Learning for Signal Processing (MLSP), 2025

    work page 2025

  2. [2]

    Engineering radio maps for wireless resource management,

    S. Bi, J. Lyu, Z. Ding, and R. Zhang, “Engineering radio maps for wireless resource management,” IEEE Wireless Communi- cations, vol. 26, no. 2, pp. 133–141, 2019

    work page 2019

  3. [3]

    Optimal trajectory design for unmanned aerial vehicle cargo pickup and delivery system based on radio map,

    Y. Chen, D. Yang, L. Xiao, F. Wu, and Y. Xu, “Optimal trajectory design for unmanned aerial vehicle cargo pickup and delivery system based on radio map,” IEEE Transactions on Vehicular Technology, vol. 73, no. 8, pp. 11 706–11 718, 2024

    work page 2024

  4. [4]

    A tutorial on environment- aware communications via channel knowledge map for 6g,

    Y. Zeng, J. Chen, J. Xu, D. Wu, X. Xu, S. Jin, X. Gao, D. Gesbert, S. Cui, and R. Zhang, “A tutorial on environment- aware communications via channel knowledge map for 6g,” IEEE Communications Surveys & Tutorials, vol. 26, no. 3, pp. 1478–1519, 2024

    work page 2024

  5. [5]

    CKMDiff: A generative diffusion model for ckm construction via inverse problems with learned priors,

    S. Fu, Y. Zeng, Z. Wu, D. Wu, S. Jin, C.-X. Wang, and X. Gao, “CKMDiff: A generative diffusion model for ckm construction via inverse problems with learned priors,” arXiv preprint arXiv:2504.17323, 2025

    arXiv 2025

  6. [6]

    IMNet: Interference-aware channel knowledge map construc- tion and localization,

    L. Zhao, Z. Fei, X. Wang, J. Huang, Y. Li, and Y. Zhang, “IMNet: Interference-aware channel knowledge map construc- tion and localization,” IEEE Wireless Communications Letters, vol. 14, no. 3, pp. 856–860, 2025

    work page 2025

  7. [7]

    Ray tracing for radio propagation modeling: Principles and applications,

    Z. Yun and M. F. Iskander, “Ray tracing for radio propagation modeling: Principles and applications,” IEEE Access, vol. 3, pp. 1089–1100, 2015

    2015

  8. [8]

    RadioUNet: Fast radio map estimation with convolutional neural networks,

    R. Levie, C. Yapar, G. Kutyniok, and G. Caire, “RadioUNet: Fast radio map estimation with convolutional neural networks,” IEEE Transactions on Wireless Communications, vol. 20, no. 6, pp. 4001–4015, 2021

    work page 2021

Show all 25 references
  1. [9]

    RadioDiff: An effective generative diffusion model for sampling-free dynamic radio map construction,

    X. Wang, K. Tao, N. Cheng, Z. Yin, Z. Li, Y. Zhang, and X. Shen, “RadioDiff: An effective generative diffusion model for sampling-free dynamic radio map construction,” IEEE Transac- tions on Cognitive Communications and Networking, pp. 1–1, 2024

    2024

  2. [10]

    Voronoi tessellation based interpolation method for Wi-Fi radio map construction,

    M. Lee and D. Han, “Voronoi tessellation based interpolation method for Wi-Fi radio map construction,” IEEE Communica- tions Letters, vol. 16, no. 3, pp. 404–407, 2012

    2012

  3. [11]

    Radio map estimation: A data- driven approach to spectrum cartography,

    D. Romero and S.-J. Kim, “Radio map estimation: A data- driven approach to spectrum cartography,” IEEE Signal Pro- cessing Magazine, vol. 39, no. 6, pp. 53–72, 2022

    2022

  4. [12]

    Deep completion autoencoders for radio map estimation,

    Y. Teganya and D. Romero, “Deep completion autoencoders for radio map estimation,” IEEE Transactions on Wireless Communications, vol. 21, no. 3, pp. 1710–1724, 2022

    2022

  5. [13]

    RME-GAN: A learning framework for radio map estimation based on conditional gen- erative adversarial network,

    S. Zhang, A. Wijesinghe, and Z. Ding, “RME-GAN: A learning framework for radio map estimation based on conditional gen- erative adversarial network,” IEEE Internet of Things Journal, vol. 10, no. 20, pp. 18 016–18 027, 2023

    2023

  6. [14]

    Fast and accurate cooperative radio map estimation enabled by GAN,

    Z. Zhang, G. Zhu, J. Chen, and S. Cui, “Fast and accurate cooperative radio map estimation enabled by GAN,” in 2024 IEEE International Conference on Communications Workshops (ICC Workshops), 2024, pp. 1641–1646

    2024

  7. [15]

    RMDM: Radio map diffusion model with physics informed,

    H. Jia, W. Chen, Z. Huang, H. Xiao, N. Jia, K. Wu, S. Lai, and Y. Yue, “RMDM: Radio map diffusion model with physics informed,” arXiv preprint arXiv:2501.19160, 2025

    2025

  8. [16]

    Denoising diffusion probabilistic model for radio map estimation in gen- erative wireless networks,

    X. Luo, Z. Li, Z. Peng, M. Chen, and Y. Liu, “Denoising diffusion probabilistic model for radio map estimation in gen- erative wireless networks,” IEEE Transactions on Cognitive Communications and Networking, vol. 11, no. 2, pp. 751–763, 2025. 14

    2025

  9. [17]

    Radio map estimation via latent domain plug-and-play denoising,

    L. Xu, L. Cheng, J. Chen, W. Pu, and X. Fu, “Radio map estimation via latent domain plug-and-play denoising,” IEEE Transactions on Signal Processing, pp. 1–14, 2026

    2026

  10. [18]

    RadioDiff-Inverse: Diffusion enhanced bayesian inverse estimation for isac radio map construction,

    X. Wang, Z. Fang, N. Cheng, R. Sun, H. Zhou, Z. Su, Z. Li, and X. Shen, “RadioDiff-Inverse: Diffusion enhanced bayesian inverse estimation for isac radio map construction,” IEEE Transactions on Wireless Communications, vol. 25, pp. 14 611– 14 626, 2026

    2026

  11. [19]

    Estimating or prop- agating gradients through stochastic neurons for conditional computation,

    Y. Bengio, N. Léonard, and A. Courville, “Estimating or prop- agating gradients through stochastic neurons for conditional computation,” arXiv preprint arXiv:1308.3432, 2013

    2013 arXiv

  12. [20]

    Neural discrete representation learning,

    A. van den Oord, O. Vinyals, and k. kavukcuoglu, “Neural discrete representation learning,” in Advances in Neural Infor- mation Processing Systems, I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, Eds., vol. 30. Curran Associates, Inc., 2017

    2017

  13. [21]

    Physics-inspired machine learning for radiomap estimation: Integration of radio propagation models and artificial intelligence,

    S. Zhang, B. Choi, F. Ouyang, and Z. Ding, “Physics-inspired machine learning for radiomap estimation: Integration of radio propagation models and artificial intelligence,” IEEE Commu- nications Magazine, vol. 62, no. 8, pp. 155–161, 2024

    2024

  14. [22]

    U-net: Convolutional networks for biomedical image segmentation,

    O. Ronneberger, P. Fischer, and T. Brox, “U-net: Convolutional networks for biomedical image segmentation,” in International Conference on Medical image computing and computer-assisted intervention. Springer, 2015, pp. 234–241

    2015

  15. [23]

    Swin transformer: Hierarchical vision transformer using shifted windows,

    Z. Liu, Y. Lin, Y. Cao, H. Hu, Y. Wei, Z. Zhang, S. Lin, and B. Guo, “Swin transformer: Hierarchical vision transformer using shifted windows,” in Proceedings of the IEEE/CVF international conference on computer vision, 2021, pp. 10 012– 10 022. Liu Yang received the B.Eng deg...

    2021

  16. [1999]

    He received the B.S. degree in electronic information engineering from the University of Electronic Science and Technology of China (UESTC), Chengdu, China, in 2021, where he is currently pursuing the Ph.D. degree in infor- mation and communication engineering. His research in...

    2021

  17. [2020]

    Her re- search interests include deep learning and RF transmitter identification

    She is currently an Assistant Research Fellow with the School of Information and Communication Engineering, UESTC. Her re- search interests include deep learning and RF transmitter identification. Jingran Lin received the B.S. degree in Computer Communication from University o...

    2001

Pith tools

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