Pith. sign in

REVIEW 2 major objections 4 minor 103 references

Scoring ISAC: Benchmarking Integrated Sensing and Communications via Score-Based Generative Modeling

T0 review · 2 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

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

Pith's one-line read Score-based generative models can estimate ISAC performance metrics—mutual information, MMSE, and Bayesian Cramér–Rao bound—directly from data, with proof-of-concept experiments matching analytical ground truth.

desk verdict A tutorial-style transfer of score-based metric estimation to ISAC with proof-of-concept checks; worth refereeing, but the text as delivered is unreadable and the error-propagation question is unaddressed in the abstract. read the letter →

arxiv 2508.02117 v1 pith:5KHG74II submitted 2025-08-04 eess.SP

Lin Chen , Chang Cai , Huiyuan Yang , Xiaojun Yuan , Ying-Jun Angela Zhang This is my paper · ORCID
classification eess.SP
keywords integratedsensingandcommunicationsscore-basedgenerativemodelsmutualinformationminimummeansquarederrorBayesianCramér-Raobounddata-drivenperformanceevaluationnon-Gaussiansignalprocessingtargetlocalization
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 is a tutorial-style proposal for scoring ISAC: use score-based generative models to evaluate integrated sensing and communication systems directly from data. The central claim is that three classical performance metrics—mutual information, minimum mean squared error, and the Bayesian Cramér–Rao bound—can be expressed in terms of score functions, so once a model learns the score of the relevant observation or posterior density, all three metrics become available even when the underlying distributions are nonlinear, multimodal, and non-Gaussian. Proof-of-concept experiments on target detection and localization compare the learned estimates with ground-truth analytical expressions and report agreement. If the claim holds, ISAC performance evaluation no longer requires closed-form statistical models and can follow the actual data distribution instead.

What carries the argument

The load-bearing object is the learned score function $\mathbf{s}_{\boldsymbol{\theta}}(\mathbf{x}) \approx \nabla_{\mathbf{x}}\log p(\mathbf{x})$, the gradient of the log-density of the data. The paper establishes score-based expressions for mutual information, MMSE, and the Bayesian Cramér–Rao bound, and uses denoising score matching to train the network so that the same learned score can be plugged into all three expressions. That shared score map is what carries the argument: once it is accurate, the classical metrics follow without any new analytic derivation.

What would settle it

Run the estimator on a synthetic ISAC observation model with known ground truth—for example, a Gaussian mixture or a nonlinear localization model whose mutual information and Bayesian Cramér–Rao bound can be computed numerically—and check whether the score-based estimates stay accurate as the dimension grows and the distribution becomes more multimodal; growing discrepancy would falsify the central claim.

Watch

Extended reading notes

Core claim

On its own terms, the paper claims that score functions carry enough statistical information to serve as a universal performance evaluator for ISAC systems. It argues that the score $\nabla_{\mathbf{x}}\log p(\mathbf{x})$ of the joint or conditional density encodes the same information that enters mutual information, MMSE, and the Bayesian Cramér–Rao bound, and that standard score-matching training therefore turns a generative model into a plugin estimator for all three metrics. The validation experiments show that this procedure reproduces closed-form baselines in detection and localization, which the paper presents as evidence that the mechanism extends to realistic regimes where analytical derivations are unavailable.

Load-bearing premise

The whole method rests on the learned score function being a close approximation to the true log-density gradient in exactly the non-Gaussian, multimodal settings where closed-form analysis fails; the paper validates this on proof-of-concept cases but states no general approximation guarantee.

Editorial extensions

If this is right

  • ISAC system evaluation becomes a data-driven procedure: collect samples from the noisy, impaired channel and estimate mutual information, MMSE, or the Bayesian Cramér–Rao bound from the learned score.
  • One trained score model supplies all three metrics at once, instead of requiring a separate analytical treatment for each.
  • Detection and localization limits can be quantified in non-Gaussian, multimodal scenes where closed-form Bayesian bounds do not exist.
  • The same estimated metrics can be used as objectives or constraints for ISAC algorithm design and system optimization.

Reading between the lines

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

  • A natural next stress test is dimensionality: in massive-antenna or multi-target settings, score estimation error will compound through the metric identities, and the paper does not characterize this degradation.
  • The framework implicitly separates score-learning error from plugin-evaluation error; isolating the two would clarify when the method can be trusted.
  • Because the metric estimates are differentiable functions of the learned score, they could be differentiated to guide waveform or beamforming optimization, an extension the paper gestures toward but does not develop.
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

2 major / 4 minor

Summary. The paper proposes a framework, called "scoring ISAC," in which score-based generative models are used to estimate classical ISAC performance metrics—mutual information (MI), minimum mean squared error (MMSE), and the Bayesian Cramér–Rao bound (BCRB)—from data, with the goal of handling nonlinear, multimodal, non-Gaussian settings where closed-form expressions are unavailable. The abstract claims a tutorial-style synthesis of recent advances, explicit connections between performance metrics and score functions, practical training techniques, and proof-of-concept experiments on target detection and localization that validate the score-based estimators against ground-truth analytical expressions. The delivered full text, however, is largely corrupted and unreadable, so the derivations, experimental details, and numerical results cannot be independently assessed.

Significance. If the claims are correct, the framework offers a genuinely useful data-driven route to performance evaluation in realistic ISAC scenarios, and the tutorial-style organization could benefit a broad audience. The paper also has the merit of connecting established information-theoretic identities to modern generative modeling in a new application domain. That said, the central claim—that plugin estimates from a learned score are accurate in exactly the multimodal, non-Gaussian regimes of interest—is not verifiable from the submitted manuscript, because the full text is unreadable. No machine-checkable proofs, reproducible code, or parameter-free derivations are visible in the delivered file. The significance can be evaluated only after a readable resubmission.

major comments (2)
  1. [Full text (as delivered); title page/header] The submitted text is almost entirely corrupted: most sentences are unreadable mojibake, the running header cites arXiv:2508.02120 rather than 2508.02117, and large blocks of the text, including the derivations and experimental sections, are indecipherable. This prevents verification of every load-bearing element of the paper—the score-to-metric identities, the training procedures, and the proof-of-concept validation. The authors must resubmit a readable manuscript (PDF or LaTeX source) before the scientific content can be reviewed.
  2. [Abstract, last sentence] The abstract states that proof-of-concept experiments "validate the accuracy of score-based performance estimators against ground-truth analytical expressions," but the experiments section is unreadable, so this validation cannot be checked. Moreover, the abstract does not clarify whether the training data are generated from the same statistical model that supplies the ground-truth analytical expressions; if that is the case, the agreement would largely be a self-consistency check and would not demonstrate accuracy in the target non-Gaussian, multimodal regimes. The resubmission should state the data-generation protocol explicitly and, if the same model is used, discuss why the test is not circular.
minor comments (4)
  1. [Abstract] The LaTeX macro "Cram\'{e}r--Rao bound" appears with a stray backslash; this should be cleaned up.
  2. [Header/title page] The arXiv identifier in the running header (2508.02120) does not match the submitted paper's identifier (2508.02117); this should be corrected.
  3. [Reference list] The reference list at the end of the document is garbled and appears to contain repeated or partial entries; it needs to be regenerated from the original source files.
  4. [Figures/tables (where readable)] The few readable fragments suggest the document contains figures and tables, but their captions and contents are not legible; the resubmission should ensure all figures and tables render properly.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: score-based metric estimation is validated against independent analytic ground truth.

full rationale

The paper is a tutorial-style summary that assembles exact identities connecting score functions to mutual information, MMSE, and Bayesian Cramér–Rao bound, then fits a score function from observed data and plugs that learned score into those identities. The proof-of-concept experiments compare the resulting estimates with ground-truth analytical expressions of the target metrics computed from the known generative model. Those analytical values are not functions of the fitted score; the learned score is an independently trained function approximator. Agreement therefore tests whether score matching recovers the true log-density gradient well enough for the plug-in metric estimates to be accurate. This is a controlled validation, not a result forced by construction. No fitted parameter is renamed as a prediction, no load-bearing premise is justified solely by a self-citation, and no metric is defined in terms of the estimator that is said to predict it. The name 'scoring ISAC' is presentational wordplay, not a definitional reduction. Consequently, no circular step is identified and the circularity score is 0.

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

No invented entities are introduced. The free-parameter list is empty because the abstract does not report any fitted constants; however, score-network hyperparameters and noise schedules, if any, would need to be counted once the full text is available.

assumptions (3)
  • domain assumption Learned score functions provide unbiased or consistent estimates of MI, MMSE, and BCRB through the claimed score-based formulas.
    The abstract asserts connections between classical metrics and score functions but does not show derivations or conditions for unbiasedness.
  • domain assumption The proof-of-concept scenarios use distributions for which the analytical ground-truth expressions are exact and computable.
    Validation against ground truth requires that the ground truth itself is not an approximation, otherwise agreement is ambiguous.
  • domain assumption Score-based generative models can be trained to approximate the score function sufficiently well in non-Gaussian and multimodal settings.
    The motivation of the paper rests on this capability, but the abstract provides no approximation guarantees or sample complexity bounds.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Scoring ISAC: Benchmarking Integrated Sensing and Communications via Score-Based Generative Modeling." pith.science (2026). https://pith.science/paper/5KHG74II

@misc{pith2026250802117,
  author       = {Pith},
  title        = {Pith review of: Scoring ISAC: Benchmarking Integrated Sensing and Communications via Score-Based Generative Modeling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5KHG74II}},
  note         = {Machine review of arXiv:2508.02117}
}
read the original abstract

Integrated sensing and communications (ISAC) is a key enabler for next-generation wireless systems, aiming to support both high-throughput communication and high-accuracy environmental sensing using shared spectrum and hardware. Theoretical performance metrics, such as mutual information (MI), minimum mean squared error (MMSE), and Bayesian Cram\'{e}r--Rao bound (BCRB), play a key role in evaluating ISAC system performance limits. However, in practice, hardware impairments, multipath propagation, interference, and scene constraints often result in nonlinear, multimodal, and non-Gaussian distributions, making it challenging to derive these metrics analytically. Recently, there has been a growing interest in applying score-based generative models to characterize these metrics from data, although not discussed for ISAC. This paper provides a tutorial-style summary of recent advances in score-based performance evaluation, with a focus on ISAC systems. We refer to the summarized framework as scoring ISAC, which not only reflects the core methodology based on score functions but also emphasizes the goal of scoring (i.e., evaluating) ISAC systems under realistic conditions. We present the connections between classical performance metrics and the score functions and provide the practical training techniques for learning score functions to estimate performance metrics. Proof-of-concept experiments on target detection and localization validate the accuracy of score-based performance estimators against ground-truth analytical expressions, illustrating their ability to replicate and extend traditional analyses in more complex, realistic settings. This framework demonstrates the great potential of score-based generative models in ISAC performance analysis, algorithm design, and system optimization.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

103 extracted references · 74 canonical work pages

  1. [1]

    11em plus .33em minus .07em 4000 4000 100 4000 4000 500 `\.=1000 = #1 \@IEEEnotcompsoconly \@IEEEcompsoconly #1 * [1] 0pt [0pt][0pt] #1 * [1] 0pt [0pt][0pt] #1 * \| ** #1 \@IEEEauthorblockNstyle \@IEEEcompsocnotconfonly \@IEEEauthorblockAstyle \@IEEEcompsocnotconfonly \@IEEEcompsocconfonly \@IEEEauthordefaulttextstyle \@IEEEcompsocnotconfonly \@IEEEauthor...

  2. [2]

    A. Liu, Z. Huang, M. Li, Y. Wan, W. Li, T. X. Han, C. Liu, R. Du, D. K. P. Tan, J. Lu et al., ``A survey on fundamental limits of integrated sensing and communication,'' IEEE Communications Surveys & Tutorials, vol. 24, no. 2, pp. 994--1034, 2022

    2022

  3. [3]

    S. Lu, F. Liu, Y. Li, K. Zhang, H. Huang, J. Zou, X. Li, Y. Dong, F. Dong, J. Zhu et al., ``Integrated sensing and communications: Recent advances and ten open challenges,'' IEEE Internet of Things Journal, vol. 11, no. 11, pp. 19\,094--19\,120, 2024

    2024

  4. [4]

    F. Liu, Y. Cui, C. Masouros, J. Xu, T. X. Han, Y. C. Eldar, and S. Buzzi, ``Integrated sensing and communications: Toward dual-functional wireless networks for 6G and beyond,'' IEEE Journal on Selected Areas in Communications, vol. 40, no. 6, pp. 1728--1767, 2022

    2022

  5. [5]

    Yurtsever, J

    E. Yurtsever, J. Lambert, A. Carballo, and K. Takeda, ``A survey of autonomous driving: Common practices and emerging technologies,'' IEEE access, vol. 8, pp. 58\,443--58\,469, 2020

    2020

  6. [6]

    Gupta, R

    L. Gupta, R. Jain, and G. Vaszkun, ``Survey of important issues in UAV communication networks,'' IEEE communications surveys & tutorials, vol. 18, no. 2, pp. 1123--1152, 2015

    2015

  7. [7]

    D. C. Nguyen, M. Ding, P. N. Pathirana, A. Seneviratne, J. Li, D. Niyato, O. Dobre, and H. V. Poor, `` 6G internet of things: A comprehensive survey,'' IEEE Internet of Things Journal, vol. 9, no. 1, pp. 359--383, 2021

    2021

  8. [8]

    Ahmed, I

    E. Ahmed, I. Yaqoob, A. Gani, M. Imran, and M. Guizani, ``Internet-of-things-based smart environments: state of the art, taxonomy, and open research challenges,'' IEEE Wireless Communications, vol. 23, no. 5, pp. 10--16, 2016

    2016

Show all 103 references
  1. [9]

    Y. Cui, F. Liu, X. Jing, and J. Mu, ``Integrating sensing and communications for ubiquitous IoT : Applications, trends, and challenges,'' IEEE network, vol. 35, no. 5, pp. 158--167, 2021

    2021

  2. [10]

    J. A. Zhang, F. Liu, C. Masouros, R. W. Heath, Z. Feng, L. Zheng, and A. Petropulu, ``An overview of signal processing techniques for joint communication and radar sensing,'' IEEE Journal of Selected Topics in Signal Processing, vol. 15, no. 6, pp. 1295--1315, 2021

    2021

  3. [11]

    H. Li, K. Qu, C. Sun, S. Wang, X. Wang, Y. Zhang, B. Priyanto, and H. Zhang, ``Multi-node multi-band cooperative integrated sensing and communications: State-of-the-art, challenges and opportunities,'' IEEE Wireless Communications, 2025

    2025

  4. [12]

    X. Wang, L. Kong, F. Kong, F. Qiu, M. Xia, S. Arnon, and G. Chen, ``Millimeter wave communication: A comprehensive survey,'' IEEE Communications Surveys & Tutorials, vol. 20, no. 3, pp. 1616--1653, 2018

    2018

  5. [13]

    Z. Chen, X. Ma, B. Zhang, Y. Zhang, Z. Niu, N. Kuang, W. Chen, L. Li, and S. Li, ``A survey on terahertz communications,'' China communications, vol. 16, no. 2, pp. 1--35, 2019

    2019

  6. [14]

    Faisal, H

    A. Faisal, H. Sarieddeen, H. Dahrouj, T. Y. Al-Naffouri, and M.-S. Alouini, ``Ultramassive mimo systems at terahertz bands: Prospects and challenges,'' IEEE Vehicular Technology Magazine, vol. 15, no. 4, pp. 33--42, 2020

    2020

  7. [15]

    H. Chen, H. Sarieddeen, T. Ballal, H. Wymeersch, M.-S. Alouini, and T. Y. Al-Naffouri, ``A tutorial on terahertz-band localization for 6G communication systems,'' IEEE Communications Surveys & Tutorials, vol. 24, no. 3, pp. 1780--1815, 2022

    2022

  8. [16]

    Demirhan and A

    U. Demirhan and A. Alkhateeb, ``Cell-free ISAC MIMO systems: Joint sensing and communication beamforming,'' IEEE Transactions on Communications, vol. 73, no. 6, pp. 4454--4468, 2025

    2025

  9. [17]

    Z. Wang, X. Mu, and Y. Liu, ``Near-field integrated sensing and communications,'' IEEE Communications Letters, vol. 27, no. 8, pp. 2048--2052, 2023

    2023

  10. [18]

    Zhang, Y

    D. Zhang, Y. Cui, X. Cao, N. Su, F. Liu, X. Jing, J. A. Zhang, J. Xu, C. Masouros, D. Niyato et al., ``Integrated sensing and communications over the years: An evolution perspective,'' 2025. [Online]. Available: https://arxiv.org/abs/2504.06830

    2025

  11. [19]

    [Online]

    3rd Generation Partnership Project (3GPP) , ``Study on integrated sensing and communication ( ISAC ) for 6G ,'' 3GPP, Technical Report TR 38.889, 2022. [Online]. Available: https://www.3gpp.org/ftp/Specs/archive/38\_series/38.889/

    2022

  12. [20]

    [Online]

    International Telecommunication Union , `` IMT -2030 6G vision,'' 2021, accessed: 2025-07-18. [Online]. Available: https://www.itu.int/en/publications/Pages/default.aspx

    2021

  13. [21]

    S. Wang, L. Chen, J. Zhou, Y. Chen, K. Han, and C. You, ``Unified ISAC Pareto boundary based on mutual information and minimum mean-square error estimation,'' IEEE Transactions on Communications, vol. 72, no. 11, pp. 6783--6795, 2024

    2024

  14. [22]

    H. Wang, Z. Xiao, and Y. Zeng, ``Cram \'e r- R ao bounds for near-field sensing with extremely large-scale MIMO ,'' IEEE Transactions on Signal Processing, vol. 72, pp. 701--717, 2024

    2024

  15. [23]

    Xiong, F

    Y. Xiong, F. Liu, Y. Cui, W. Yuan, T. X. Han, and G. Caire, ``On the fundamental tradeoff of integrated sensing and communications under Gaussian channels,'' IEEE Transactions on Information Theory, vol. 69, no. 9, pp. 5723--5751, 2023

    2023

  16. [24]

    C. E. Shannon, ``A mathematical theory of communication,'' The Bell system technical journal, vol. 27, no. 3, pp. 379--423, 1948

    1948

  17. [25]

    Boyer, ``Performance bounds and angular resolution limit for the moving colocated MIMO radar,'' IEEE Transactions on Signal Processing, vol

    R. Boyer, ``Performance bounds and angular resolution limit for the moving colocated MIMO radar,'' IEEE Transactions on Signal Processing, vol. 59, no. 4, pp. 1539--1552, 2010

    2010

  18. [26]

    Chen and R

    Y. Chen and R. S. Blum, ``On the impact of unknown signals on delay, Doppler , amplitude, and phase parameter estimation,'' IEEE Transactions on Signal Processing, vol. 67, no. 2, pp. 431--443, 2018

    2018

  19. [27]

    Ray and P

    P. Ray and P. K. Varshney, ``Radar target detection framework based on false discovery rate,'' IEEE Transactions on Aerospace and Electronic Systems, vol. 47, no. 2, pp. 1277--1292, 2011

    2011

  20. [28]

    S. D. Sandberg, S. Del Marco, K. Jagler, and M. A. Tzannes, ``Some alternatives in transform-domain suppression of narrow-band interference for signal detection and demodulation,'' IEEE Transactions on Communications, vol. 43, no. 12, pp. 3025--3036, 1995

    1995

  21. [29]

    u rg \"u no g lu, A. Kosasih, P. Ramezani, \

    D. G \"u rg \"u no g lu, A. Kosasih, P. Ramezani, \"O . T. Demir, E. Bj \"o rnson, and G. Fodor, ``Performance analysis of a 2D-MUSIC algorithm for parametric near-field channel estimation,'' IEEE Wireless Communications Letters, 2025

    2025

  22. [30]

    T. Lin, J. Cong, Y. Zhu, J. Zhang, and K. B. Letaief, ``Hybrid beamforming for millimeter wave systems using the MMSE criterion,'' IEEE Transactions on Communications, vol. 67, no. 5, pp. 3693--3708, 2019

    2019

  23. [31]

    El Ayach, S

    O. El Ayach, S. Rajagopal, S. Abu-Surra, Z. Pi, and R. W. Heath, ``Spatially sparse precoding in millimeter wave MIMO systems,'' IEEE Transactions on Wireless Communications, vol. 13, no. 3, pp. 1499--1513, 2014

    2014

  24. [32]

    H. Li, Z. Wang, X. Mu, P. Zhiwen, and Y. Liu, ``Near-field integrated sensing, positioning, and communication: A downlink and uplink framework,'' IEEE Journal on Selected Areas in Communications, vol. 42, no. 9, pp. 2196--2212, 2024

    2024

  25. [33]

    Liu, Y.-F

    F. Liu, Y.-F. Liu, A. Li, C. Masouros, and Y. C. Eldar, ``Cram \'e r- R ao bound optimization for joint radar-communication beamforming,'' IEEE Transactions on Signal Processing, vol. 70, pp. 240--253, 2021

    2021

  26. [34]

    C. B. Barneto, T. Riihonen, M. Turunen, L. Anttila, M. Fleischer, K. Stadius, J. Ryyn \"a nen, and M. Valkama, ``Full-duplex OFDM radar with LTE and 5G NR waveforms: Challenges, solutions, and measurements,'' IEEE Transactions on Microwave Theory and Techniques, vol. 67, no. 1...

    2019

  27. [35]

    Koivunen, M

    V. Koivunen, M. F. Keskin, H. Wymeersch, M. Valkama, and N. Gonz \'a lez-Prelcic, ``Multicarrier ISAC : Advances in waveform design, signal processing, and learning under nonidealities [special issue on signal processing for the integrated sensing and communications revolution...

    2024

  28. [36]

    Wu, Y.-F

    Z. Wu, Y.-F. Liu, W.-K. Chen, and C. Masouros, ``Quantized constant-envelope waveform design for massive MIMO DFRC systems,'' IEEE Journal on Selected Areas in Communications, 2025

    2025

  29. [37]

    De Lima, D

    C. De Lima, D. Belot, R. Berkvens, A. Bourdoux, D. Dardari, M. Guillaud, M. Isomursu, E.-S. Lohan, Y. Miao, A. N. Barreto et al., ``Convergent communication, sensing and localization in 6G systems: An overview of technologies, opportunities and challenges,'' IEEE Access, vol. ...

    2021

  30. [38]

    Feintuch, H

    S. Feintuch, H. H. Permuter, I. Bilik, and J. Tabrikian, ``Neural network-based multitarget detection within correlated heavy-tailed clutter,'' IEEE Transactions on Aerospace and Electronic Systems, vol. 59, no. 5, pp. 5684--5698, 2023

    2023

  31. [39]

    Haenggi, R

    M. Haenggi, R. K. Ganti et al., ``Interference in large wireless networks,'' Foundations and Trends in Networking , vol. 3, no. 2, pp. 127--248, 2009

    2009

  32. [40]

    Bae, J.-H

    I. Bae, J.-H. Park, and H.-G. Jeon, ``Non-probability sampling network for stochastic human trajectory prediction,'' in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022, pp. 6477--6487

    2022

  33. [41]

    Song and S

    Y. Song and S. Ermon, ``Generative modeling by estimating gradients of the data distribution,'' Advances in Neural Information Processing Systems, vol. 32, 2019

    2019

  34. [42]

    Y. Song, J. Sohl-Dickstein, D. P. Kingma, A. Kumar, S. Ermon, and B. Poole, ``Score-based generative modeling through stochastic differential equations,'' 2020. [Online]. Available: https://arxiv.org/abs/2011.13456

    2020 arXiv

  35. [43]

    J. Ho, A. Jain, and P. Abbeel, ``Denoising diffusion probabilistic models,'' Advances in Neural Information Processing Systems, vol. 33, pp. 6840--6851, 2020

    2020

  36. [44]

    Dhariwal and A

    P. Dhariwal and A. Nichol, ``Diffusion models beat GANs on image synthesis,'' Advances in Neural Information Processing Systems, vol. 34, pp. 8780--8794, 2021

    2021

  37. [45]

    J. Ho, T. Salimans, A. Gritsenko, W. Chan, M. Norouzi, and D. J. Fleet, ``Video diffusion models,'' Advances in Neural Information Processing Systems, vol. 35, pp. 8633--8646, 2022

    2022

  38. [46]

    J. Song, A. Vahdat, M. Mardani, and J. Kautz, ``Pseudoinverse-guided diffusion models for inverse problems,'' in International Conference on Learning Representations, 2023

    2023

  39. [47]

    Chung, S

    H. Chung, S. Lee, and J. C. Ye, ``Decomposed diffusion sampler for accelerating large-scale inverse problems,'' in The Twelfth International Conference on Learning Representations, 2024

    2024

  40. [48]

    Daras, H

    G. Daras, H. Chung, C.-H. Lai, Y. Mitsufuji, J. C. Ye, P. Milanfar, A. G. Dimakis, and M. Delbracio, ``A survey on diffusion models for inverse problems,'' 2024. [Online]. Available: https://arxiv.org/abs/2410.00083

    2024 arXiv

  41. [49]

    Y. Wang, J. Yu, and J. Zhang, ``Zero-shot image restoration using denoising diffusion null-space model,'' The Eleventh International Conference on Learning Representations, 2023

    2023

  42. [50]

    Y. Zhu, K. Zhang, J. Liang, J. Cao, B. Wen, R. Timofte, and L. Van Gool, ``Denoising diffusion models for plug-and-play image restoration,'' in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023, pp. 1219--1229

    2023

  43. [51]

    Franzese, M

    G. Franzese, M. BOUNOUA, and P. Michiardi, `` MINDE : Mutual information neural diffusion estimation,'' in The Twelfth International Conference on Learning Representations, 2024

    2024

  44. [52]

    X. Kong, R. Brekelmans, and G. V. Steeg, ``Information-theoretic diffusion,'' in The Eleventh International Conference on Learning Representations, 2023

    2023

  45. [53]

    X. Kong, O. Liu, H. Li, D. Yogatama, and G. V. Steeg, ``Interpretable diffusion via information decomposition,'' in The Twelfth International Conference on Learning Representations, 2024

    2024

  46. [54]

    C. Cai, X. Yuan, and Y.-J. A. Zhang, ``Score-based turbo message passing for plug-and-play compressive image recovery,'' 2025. [Online]. Available: https://arxiv.org/abs/2503.22140

    2025

  47. [55]

    C. Cai, W. Jiang, X. Yuan, and Y.-J. A. Zhang, ``Joint activity detection and channel estimation for massive connectivity: Where message passing meets score-based generative priors,'' 2025. [Online]. Available: https://arxiv.org/abs/2506.00581

    2025

  48. [56]

    Z. Xue, P. Cai, X. Yuan, and X. Gao, ``Score-based variational inference for inverse problems,'' 2024. [Online]. Available: https://arxiv.org/abs/2410.05646

    2024 arXiv

  49. [57]

    Y. Wang, S. Bi, Y.-J. A. Zhang, and X. Yuan, ``Traversing distortion-perception tradeoff using a single score-based generative model,'' in Proceedings of the Computer Vision and Pattern Recognition Conference, 2025, pp. 2377--2386

    2025

  50. [58]

    E. S. Crafts, X. Zhang, and B. Zhao, `` Bayesian Cram \'e r-Rao bound estimation with score-based models,'' IEEE Transactions on Information Theory, vol. 71, no. 3, pp. 2007--2027, 2025

    2007

  51. [59]

    H. V. Habi, H. Messer, and Y. Bresler, ``Learned Bayesian Cram \'e r-Rao bound for unknown measurement models using score neural networks,'' 2025. [Online]. Available: https://arxiv.org/abs/2502.00724

    2025 arXiv

  52. [60]

    Goldsmith, Wireless communications

    A. Goldsmith, Wireless communications. 1em plus 0.5em minus 0.4em Cambridge university press, 2005

    2005

  53. [61]

    Kailath, ``The divergence and Bhattacharyya distance measures in signal selection,'' IEEE Transactions on Communication Technology, vol

    T. Kailath, ``The divergence and Bhattacharyya distance measures in signal selection,'' IEEE Transactions on Communication Technology, vol. 15, no. 1, pp. 52--60, 1967

    1967

  54. [62]

    Yang and R

    Y. Yang and R. S. Blum, `` MIMO radar waveform design based on mutual information and minimum mean-square error estimation,'' IEEE Transactions on Aerospace and Electronic Systems, vol. 43, no. 1, pp. 330--343, 2007

    2007

  55. [63]

    S. M. Kay, Fundamentals of statistical signal processing: estimation theory. 1em plus 0.5em minus 0.4em Prentice-Hall, Inc., 1993

    1993

  56. [64]

    C. R. Rao, ``Information and the accuracy attainable in the estimation of statistical parameters,'' in Breakthroughs in Statistics: Foundations and basic theory. 1em plus 0.5em minus 0.4em Springer, 1992, pp. 235--247

    1992

  57. [65]

    H. L. V. Trees and K. L. Bell, Bayesian bounds for parameter estimation and nonlinear filtering/tracking. 1em plus 0.5em minus 0.4em Wiley-IEEE press, 2007

    2007

  58. [66]

    H. L. Van Trees, Detection, estimation, and modulation theory, part I : detection, estimation, and linear modulation theory . 1em plus 0.5em minus 0.4em John Wiley & Sons, 2004

    2004

  59. [67]

    Nitzberg, ``Constant-false-alarm-rate signal processors for several types of interference,'' IEEE Transactions on Aerospace and Electronic Systems, vol

    R. Nitzberg, ``Constant-false-alarm-rate signal processors for several types of interference,'' IEEE Transactions on Aerospace and Electronic Systems, vol. AES-8, no. 1, pp. 27--34, 1972

    1972

  60. [68]

    T. M. Cover, Elements of information theory. 1em plus 0.5em minus 0.4em John Wiley & Sons, 1999

    1999

  61. [69]

    Abramowitz and I

    M. Abramowitz and I. A. Stegun, Handbook of mathematical functions with formulas, graphs, and mathematical tables. 1em plus 0.5em minus 0.4em US Government printing office, 1948, vol. 55

    1948

  62. [70]

    D. Guo, S. Shamai, and S. Verdu, ``Mutual information and minimum mean-square error in Gaussian channels,'' IEEE Transactions on Information Theory, vol. 51, no. 4, pp. 1261--1282, 2005

    2005

  63. [71]

    Han and J

    G. Han and J. Song, ``Extensions of the I-MMSE relationship to Gaussian channels with feedback and memory,'' IEEE Transactions on Information Theory, vol. 62, no. 10, pp. 5422--5445, 2016

    2016

  64. [72]

    A. J. Stam, ``Some inequalities satisfied by the quantities of information of Fisher and Shannon ,'' Information and Control, vol. 2, no. 2, pp. 101--112, 1959

    1959

  65. [73]

    Costa, ``A new entropy power inequality,'' IEEE Transactions on Information Theory, vol

    M. Costa, ``A new entropy power inequality,'' IEEE Transactions on Information Theory, vol. 31, no. 6, pp. 751--760, 1985

    1985

  66. [74]

    W. Cao, A. Dytso, M. Fau , H. V. Poor, and G. Feng, ``On nonparametric estimation of the Fisher information,'' in 2020 IEEE International Symposium on Information Theory (ISIT). 1em plus 0.5em minus 0.4em IEEE, 2020, pp. 2216--2221

    2020

  67. [75]

    L. D. Brown, ``Admissible estimators, recurrent diffusions, and insoluble boundary value problems,'' The Annals of Mathematical Statistics, vol. 42, no. 3, pp. 855--903, 1971

    1971

  68. [76]

    Kullback, Information theory and statistics

    S. Kullback, Information theory and statistics. 1em plus 0.5em minus 0.4em Courier Corporation, 1997

    1997

  69. [77]

    Kadambi, K

    P. Kadambi, K. N. Ramamurthy, and V. Berisha, ``Comparing Fisher information regularization with distillation for DNN quantization,'' in NeurIPS 2020 Workshop: Deep Learning through Information Geometry, 2020

    2020

  70. [78]

    Q. Shi, M. Razaviyayn, Z.-Q. Luo, and C. He, ``An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel,'' IEEE Transactions on Signal Processing, vol. 59, no. 9, pp. 4331--4340, 2011

    2011

  71. [79]

    S. S. Christensen, R. Agarwal, E. De Carvalho, and J. M. Cioffi, ``Weighted sum-rate maximization using weighted MMSE for MIMO-BC beamforming design,'' IEEE Transactions on Wireless Communications, vol. 7, no. 12, pp. 4792--4799, 2008

    2008

  72. [80]

    Shen and W

    K. Shen and W. Yu, ``Fractional programming for communication systems-part II : Uplink scheduling via matching,'' IEEE Transactions on Signal Processing, vol. 66, no. 10, pp. 2631--2644, 2018

    2018

  73. [81]

    K. Bell, Y. Steinberg, Y. Ephraim, and H. Van Trees, ``Extended Ziv-Zakai lower bound for vector parameter estimation,'' IEEE Transactions on Information Theory, vol. 43, no. 2, pp. 624--637, 1997

    1997

  74. [82]

    Zhang, Z

    Z. Zhang, Z. Shi, C. Shao, J. Chen, M. S. Greco, and F. Gini, `` Ziv-Zakai bound for 2D-DOAs estimation,'' IEEE Transactions on Signal Processing, 2024

    2024

  75. [83]

    Gusi-Amig \'o , P

    A. Gusi-Amig \'o , P. Closas, A. Mallat, and L. Vandendorpe, `` Ziv-Zakai bound for direct position estimation,'' Navigation, vol. 65, no. 3, pp. 463--475, 2018

    2018

  76. [84]

    G. E. Hinton, ``Training products of experts by minimizing contrastive divergence,'' Neural computation, vol. 14, no. 8, pp. 1771--1800, 2002

    2002

  77. [85]

    Vincent, ``A connection between score matching and denoising autoencoders,'' Neural computation, vol

    P. Vincent, ``A connection between score matching and denoising autoencoders,'' Neural computation, vol. 23, no. 7, pp. 1661--1674, 2011

    2011

  78. [86]

    Hyv \"a rinen and P

    A. Hyv \"a rinen and P. Dayan, ``Estimation of non-normalized statistical models by score matching.'' Journal of Machine Learning Research, vol. 6, no. 4, 2005

    2005

  79. [87]

    Y. Song, S. Garg, J. Shi, and S. Ermon, ``Sliced score matching: A scalable approach to density and score estimation,'' in Uncertainty in artificial intelligence. 1em plus 0.5em minus 0.4em PMLR, 2020, pp. 574--584

    2020

  80. [88]

    M. F. Hutchinson, ``A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines,'' Communications in Statistics-Simulation and Computation, vol. 18, no. 3, pp. 1059--1076, 1989

    1989

  81. [89]

    Song and S

    Y. Song and S. Ermon, ``Improved techniques for training score-based generative models,'' Advances in Neural Information Processing Systems, vol. 33, pp. 12\,438--12\,448, 2020

    2020

  82. [90]

    Ho and T

    J. Ho and T. Salimans, ``Classifier-free diffusion guidance,'' in NeurIPS 2021 Workshop on Deep Generative Models and Downstream Applications

    2021

  83. [91]

    Chung, J

    H. Chung, J. Kim, M. T. Mccann, M. L. Klasky, and J. C. Ye, ``Diffusion posterior sampling for general noisy inverse problems,'' in The Eleventh International Conference on Learning Representations, 2023

    2023

  84. [92]

    H. E. Robbins, ``An empirical Bayes approach to statistics,'' in Breakthroughs in Statistics: Foundations and basic theory. 1em plus 0.5em minus 0.4em Springer, 1992, pp. 388--394

    1992

  85. [93]

    W. Yu, H. He, X. Yu, S. Song, J. Zhang, R. Murch, and K. B. Letaief, ``Bayes-optimal unsupervised learning for channel estimation in near-field holographic MIMO ,'' IEEE Journal of Selected Topics in Signal Processing, vol. 18, no. 4, pp. 714--729, 2024

    2024

  86. [94]

    J. Ma, X. Yuan, and L. Ping, ``Turbo compressed sensing with partial DFT sensing matrix,'' IEEE Signal Processing Letters, vol. 22, no. 2, pp. 158--161, 2014

    2014

  87. [95]

    T. P. Minka, ``Expectation propagation for approximate bayesian inference,'' in Proc. Conf. Uncertainty Artif. Intell. 1em plus 0.5em minus 0.4em Morgan Kaufmann, 2001, pp. 362--369

    2001

  88. [96]

    A. K. Fletcher, P. Pandit, S. Rangan, S. Sarkar, and P. Schniter, ``Plug-in estimation in high-dimensional linear inverse problems: A rigorous analysis,'' Advances in Neural Information Processing Systems, vol. 31, 2018

    2018

  89. [97]

    Efron, ``Tweedie's formula and selection bias,'' Journal of the American Statistical Association, vol

    B. Efron, ``Tweedie's formula and selection bias,'' Journal of the American Statistical Association, vol. 106, no. 496, pp. 1602--1614, 2011

    2011

  90. [98]

    J. P. Vila and P. Schniter, ``Expectation-maximization G aussian-mixture approximate message passing,'' IEEE Transactions on Signal Processing, vol. 61, no. 19, pp. 4658--4672, 2013

    2013

  91. [99]

    Masrani, T

    V. Masrani, T. A. Le, and F. Wood, ``The thermodynamic variational objective,'' Advances in Neural Information Processing Systems, vol. 32, 2019

    2019

  92. [100]

    Brekelmans, V

    R. Brekelmans, V. Masrani, F. Wood, G. Ver Steeg, and A. Galstyan, ``All in the exponential family: Bregman duality in thermodynamic variational inference,'' in International Conference on Machine Learning. 1em plus 0.5em minus 0.4em PMLR, 2020, pp. 1111--1122

    2020

  93. [101]

    Z. Wang, X. Mu, and Y. Liu, ``Near-field velocity sensing and predictive beamforming,'' IEEE Transactions on Vehicular Technology, vol. 74, no. 1, pp. 1806--1810, 2025

    2025

  94. [102]

    H. Luo, Y. Wang, D. Luo, J. Zhao, H. Wu, S. Ma, and F. Gao, ``Integrated sensing and communications in clutter environment,'' IEEE Transactions on Wireless Communications, vol. 23, no. 9, pp. 10\,941--10\,956, 2024

    2024

  95. [103]

    E. F. Knott, Radar cross section measurements. 1em plus 0.5em minus 0.4em Springer Science & Business Media, 2012

    2012

Pith tools

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