Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.05496v2

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.05496v2 (cs)
[Submitted on 7 Oct 2025 (v1) , last revised 18 Oct 2025 (this version, v2)]

Title: Mutual Information Estimation via Score-to-Fisher Bridge for Nonlinear Gaussian Noise Channels

Title: 通过分数到费舍尔桥的互信息估计用于非线性高斯噪声信道

Authors:Tadashi Wadayama
Abstract: We present a numerical method to evaluate mutual information (MI) in nonlinear Gaussian noise channels by using denoising score matching (DSM) learning for estimating the score function of channel output. Via de Bruijn's identity, Fisher information estimated from the learned score function yields accurate estimates of MI through a Fisher integral representation for a variety of priors and channel nonlinearities. In this work, we propose a comprehensive theoretical foundation for the Score-to-Fisher bridge methodology, along with practical guidelines for its implementation. We also conduct extensive validation experiments, comparing our approach with closed-form solutions and a kernel density estimation baseline. The results of our numerical experiments demonstrate that the proposed method is both practical and efficient for MI estimation in nonlinear Gaussian noise channels.
Abstract: 我们提出了一种数值方法,通过使用去噪得分匹配(DSM)学习来估计信道输出的得分函数,从而评估非线性高斯噪声信道中的互信息(MI)。 通过 de Bruijn 的恒等式,从学习得到的得分函数中估计的费舍尔信息可通过费舍尔积分表示法对多种先验和信道非线性情况提供准确的 MI 估计。 在本工作中,我们提出了 Score-to-Fisher 桥接方法的全面理论基础,并提供了其实施的实用指南。 我们还进行了广泛的验证实验,将我们的方法与闭式解和核密度估计基线进行比较。 我们数值实验的结果表明,所提出的方法在非线性高斯噪声信道中的 MI 估计中既实用又高效。
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2510.05496 [cs.IT]
  (or arXiv:2510.05496v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.05496
arXiv-issued DOI via DataCite

Submission history

From: Tadashi Wadayama [view email]
[v1] Tue, 7 Oct 2025 01:27:28 UTC (69 KB)
[v2] Sat, 18 Oct 2025 04:26:52 UTC (55 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号