{"url":"/task/mutual-information-estimation","name":"Mutual Information Estimation","slug":"mutual-information-estimation","description_markdown":"To estimate mutual information from samples, specially for high-dimensional variables.","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":91,"papers_with_code":43,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":43,"tagged_in_all":91,"items":[{"url":"/paper/learning-deep-representations-by-mutual","title":"Learning deep representations by mutual information estimation and maximization","date":"2018-08-20","arxiv_id":"1808.06670","repositories_listed":8,"syntology":{"n":6,"n_ran":5,"n_unverified":1,"n_pointer_only":2}},{"url":"/paper/on-recoverability-of-graph-neural-network","title":"Graph Representation Learning via Aggregation Enhancement","date":"2022-01-30","arxiv_id":"2201.12843","repositories_listed":2,"syntology":null},{"url":"/paper/density-ratio-estimation-via-infinitesimal","title":"Density Ratio Estimation via Infinitesimal Classification","date":"2021-11-22","arxiv_id":"2111.11010","repositories_listed":2,"syntology":null},{"url":"/paper/closed-form-information-capacity-of-canonical","title":"Closed-Form Information Capacity of Canonical Signaling Models","date":"2025-05-13","arxiv_id":"2505.08365","repositories_listed":1,"syntology":null},{"url":"/paper/towards-tracing-trustworthiness-dynamics","title":"Towards Tracing Trustworthiness Dynamics: Revisiting Pre-training Period of Large Language Models","date":"2024-02-29","arxiv_id":"2402.19465","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/large-language-models-are-efficient-learners","title":"Large Language Models are Efficient Learners of Noise-Robust Speech Recognition","date":"2024-01-19","arxiv_id":"2401.10446","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/the-mixtures-and-the-neural-critics-on-the","title":"On the Properties and Estimation of Pointwise Mutual Information Profiles","date":"2023-10-16","arxiv_id":"2310.10240","repositories_listed":1,"syntology":null},{"url":"/paper/minde-mutual-information-neural-diffusion","title":"MINDE: Mutual Information Neural Diffusion Estimation","date":"2023-10-13","arxiv_id":"2310.09031","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_unverified":2,"n_pointer_only":17}},{"url":"/paper/rethinking-negative-pairs-in-code-search","title":"Rethinking Negative Pairs in Code Search","date":"2023-10-12","arxiv_id":"2310.08069","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-skeleton-based-action-recognition","title":"Zero-shot Skeleton-based Action Recognition via Mutual Information Estimation and Maximization","date":"2023-08-07","arxiv_id":"2308.03950","repositories_listed":1,"syntology":null},{"url":"/paper/variational-f-divergence-and-derangements-for","title":"Mutual Information Estimation via $f$-Divergence and Data Derangements","date":"2023-05-31","arxiv_id":"2305.20025","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/assessing-neural-network-representations","title":"Assessing Neural Network Representations During Training Using Data Diffusion Spectra","date":"2023-05-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/q-malizing-flow-and-infinitesimal-density","title":"Computing high-dimensional optimal transport by flow neural networks","date":"2023-05-19","arxiv_id":"2305.11857","repositories_listed":1,"syntology":null},{"url":"/paper/improving-mutual-information-estimation-with-1","title":"Improving Mutual Information Estimation with Annealed and Energy-Based Bounds","date":"2023-03-13","arxiv_id":"2303.06992","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":7}},{"url":"/paper/frankensplit-saliency-guided-neural-feature","title":"FrankenSplit: Efficient Neural Feature Compression with Shallow Variational Bottleneck Injection for Mobile Edge Computing","date":"2023-02-21","arxiv_id":"2302.10681","repositories_listed":1,"syntology":null},{"url":"/paper/mutual-wasserstein-discrepancy-minimization","title":"Mutual Wasserstein Discrepancy Minimization for Sequential Recommendation","date":"2023-01-28","arxiv_id":"2301.12197","repositories_listed":1,"syntology":null},{"url":"/paper/dime-maximizing-mutual-information-by-a","title":"DiME: Maximizing Mutual Information by a Difference of Matrix-Based Entropies","date":"2023-01-19","arxiv_id":"2301.08164","repositories_listed":1,"syntology":null},{"url":"/paper/copula-density-neural-estimation","title":"Copula Density Neural Estimation","date":"2022-11-25","arxiv_id":"2211.15353","repositories_listed":1,"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/augmentation-free-graph-contrastive-learning-1","title":"Augmentation-Free Graph Contrastive Learning of Invariant-Discriminative Representations","date":"2022-10-15","arxiv_id":"2210.08345","repositories_listed":1,"syntology":null},{"url":"/paper/improving-adversarial-robustness-via-mutual","title":"Improving Adversarial Robustness via Mutual Information Estimation","date":"2022-07-25","arxiv_id":"2207.12203","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-domain-adaptation-for-cardiac","title":"Unsupervised Domain Adaptation for Cardiac Segmentation: Towards Structure Mutual Information Maximization","date":"2022-04-20","arxiv_id":"2204.09334","repositories_listed":1,"syntology":null},{"url":"/paper/featurized-density-ratio-estimation","title":"Featurized Density Ratio Estimation","date":"2021-07-05","arxiv_id":"2107.02212","repositories_listed":1,"syntology":null},{"url":"/paper/tight-mutual-information-estimation-with","title":"Tight Mutual Information Estimation With Contrastive Fenchel-Legendre Optimization","date":"2021-07-02","arxiv_id":"2107.01131","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-representation-learning-via","title":"Multimodal Representation Learning via Maximization of Local Mutual Information","date":"2021-03-08","arxiv_id":"2103.04537","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-mutual-information-estimation-a","title":"MIND: Inductive Mutual Information Estimation, A Convex Maximum-Entropy Copula Approach","date":"2021-02-25","arxiv_id":"2102.13182","repositories_listed":1,"syntology":null},{"url":"/paper/neural-joint-entropy-estimation","title":"Neural Joint Entropy Estimation","date":"2020-12-21","arxiv_id":"2012.11197","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-domain-adaptation-of-a","title":"Unsupervised Domain Adaptation of a Pretrained Cross-Lingual Language Model","date":"2020-11-23","arxiv_id":"2011.11499","repositories_listed":1,"syntology":null},{"url":"/paper/reducing-the-variance-of-variational","title":"Reducing the Variance of Variational Estimates of Mutual Information by Limiting the Critic's Hypothesis Space to RKHS","date":"2020-11-17","arxiv_id":"2011.08651","repositories_listed":1,"syntology":null},{"url":"/paper/telescoping-density-ratio-estimation","title":"Telescoping Density-Ratio Estimation","date":"2020-06-22","arxiv_id":"2006.12204","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/copent-estimating-copula-entropy-in-r","title":"copent: Estimating Copula Entropy and Transfer Entropy in R","date":"2020-05-27","arxiv_id":"2005.14025","repositories_listed":1,"syntology":null}],"syntology_records":8,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}