AI News HubLIVE
Original source2 min read

Neural Estimation of Pairwise Mutual Information in Masked Discrete Sequence Models

Researchers propose a neural framework to estimate pairwise conditional mutual information directly from hidden states of pretrained masked diffusion models, enabling MI-guided parallel decoding that achieves 3-5x speedup on Sudoku and protein sequence generation tasks while preserving quality.

SourcearXiv Machine LearningAuthor: Jai Sharma, Yifan Wang, Bryan Li

[2605.20187] Neural Estimation of Pairwise Mutual Information in Masked Discrete Sequence Models

[Submitted on 27 Jan 2026]

Title:Neural Estimation of Pairwise Mutual Information in Masked Discrete Sequence Models

View a PDF of the paper titled Neural Estimation of Pairwise Mutual Information in Masked Discrete Sequence Models, by Jai Sharma and 2 other authors

View PDF HTML (experimental)

Abstract:Understanding dependencies between variables is critical for interpretability and efficient generation in masked diffusion models (MDMs), yet these models primarily expose marginal conditional distributions and do not explicitly represent inter-variable dependence. We propose a neural framework for estimating pairwise conditional mutual information (MI) directly from the hidden states of a pretrained MDM, using ground-truth MI computed from the model's own conditional distributions for supervision. The resulting estimator captures the model's internal belief about dependency structure and predicts the full MI matrix in a single forward pass, enabling MI-guided parallel decoding by identifying conditionally independent subsets of variables. We evaluate our approach on Sudoku and protein sequence generation with ESM-C, where the MI maps recover known structural constraints and enable a 3-5x magnitude reduction in inference-time forward passes compared to sequential decoding, while preserving generative quality and outperforming entropy-based parallelization methods.

Comments: 6 pages, 3 figures; submitting to ICML 2026

Subjects:

Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Information Theory (cs.IT)

Cite as: arXiv:2605.20187 [cs.LG]

(or arXiv:2605.20187v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2605.20187

arXiv-issued DOI via DataCite

Submission history

From: Jai Sharma [view email] [v1] Tue, 27 Jan 2026 22:30:16 UTC (562 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Neural Estimation of Pairwise Mutual Information in Masked Discrete Sequence Models, by Jai Sharma and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-05

Change to browse by:

cs cs.AI cs.IT math math.IT

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

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?)