{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":91,"of":91,"of_with_code":43,"tagged_in_all":91,"counts":{"archive_papers_tagged":91,"with_a_code_link":43,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":91,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/learning-deep-representations-by-mutual","slug":"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_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-deep-representations-by-mutual#ran","syntology_url":"https://syntology.ai/paper/1808.06670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.06670"}},"official":{"repos":["rdevon/DIM"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/on-recoverability-of-graph-neural-network","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-tracing-trustworthiness-dynamics#ran","syntology_url":"https://syntology.ai/paper/2402.19465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.19465"}},"official":{"repos":["chnq/tracingllm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-are-efficient-learners","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-models-are-efficient-learners#ran","syntology_url":"https://syntology.ai/paper/2401.10446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10446"}},"official":{"repos":["yuchen005/robustger"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-mixtures-and-the-neural-critics-on-the","slug":"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","slug":"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_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":2,"n_honours":2,"n_violates":2,"n_no_contract":10,"n_pointer_only":17,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 2 honoured, 2 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/minde-mutual-information-neural-diffusion#ran","syntology_url":"https://syntology.ai/paper/2310.09031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09031"}},"official":{"repos":["MustaphaBounoua/minde"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-negative-pairs-in-code-search","slug":"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","slug":"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/assessing-neural-network-representations","slug":"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/variational-f-divergence-and-derangements-for","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/variational-f-divergence-and-derangements-for#ran","syntology_url":"https://syntology.ai/paper/2305.20025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.20025"}},"official":{"repos":["tonellolab/fdime"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/q-malizing-flow-and-infinitesimal-density","slug":"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","slug":"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_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/improving-mutual-information-estimation-with-1#ran","syntology_url":"https://syntology.ai/paper/2303.06992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06992"}},"official":{"repos":["huangsicong/ais_mi_estimation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/frankensplit-saliency-guided-neural-feature","slug":"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","slug":"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","slug":"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","slug":"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":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/copula-density-neural-estimation#ran","syntology_url":"https://syntology.ai/paper/2211.15353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.15353"}},"official":{"repos":["tonellolab/codine-copula-estimator"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/augmentation-free-graph-contrastive-learning-1","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/telescoping-density-ratio-estimation#ran","syntology_url":"https://syntology.ai/paper/2006.12204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12204"}},"official":null}},{"url":"/paper/copent-estimating-copula-entropy-in-r","slug":"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},{"url":"/paper/on-the-information-plane-of-autoencoders","slug":"on-the-information-plane-of-autoencoders","title":"On the Information Plane of Autoencoders","date":"2020-05-15","arxiv_id":"2005.07783","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-via-graphical","slug":"graph-representation-learning-via-graphical","title":"Graph Representation Learning via Graphical Mutual Information Maximization","date":"2020-02-04","arxiv_id":"2002.01169","repositories_listed":1,"syntology":null},{"url":"/paper/learning-disentangled-representations-via-1","slug":"learning-disentangled-representations-via-1","title":"Learning Disentangled Representations via Mutual Information Estimation","date":"2019-12-09","arxiv_id":"1912.03915","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-disentangled-representations-via-1#ran","syntology_url":"https://syntology.ai/paper/1912.03915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03915"}},"official":null}},{"url":"/paper/lsmi-sinkhorn-semi-supervised-squared-loss","slug":"lsmi-sinkhorn-semi-supervised-squared-loss","title":"LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport","date":"2019-09-05","arxiv_id":"1909.02373","repositories_listed":1,"syntology":null},{"url":"/paper/ccmi-classifier-based-conditional-mutual","slug":"ccmi-classifier-based-conditional-mutual","title":"CCMI : Classifier based Conditional Mutual Information Estimation","date":"2019-06-05","arxiv_id":"1906.01824","repositories_listed":1,"syntology":null},{"url":"/paper/neural-entropic-estimation-a-faster-path-to","slug":"neural-entropic-estimation-a-faster-path-to","title":"Neural Entropic Estimation: A faster path to mutual information estimation","date":"2019-05-30","arxiv_id":"1905.12957","repositories_listed":1,"syntology":null},{"url":"/paper/better-long-range-dependency-by-bootstrapping","slug":"better-long-range-dependency-by-bootstrapping","title":"Better Long-Range Dependency By Bootstrapping A Mutual Information Regularizer","date":"2019-05-28","arxiv_id":"1905.11978","repositories_listed":1,"syntology":null},{"url":"/paper/practical-and-consistent-estimation-of-f","slug":"practical-and-consistent-estimation-of-f","title":"Practical and Consistent Estimation of f-Divergences","date":"2019-05-27","arxiv_id":"1905.11112","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-for-channel-coding-via-neural","slug":"deep-learning-for-channel-coding-via-neural","title":"Deep Learning for Channel Coding via Neural Mutual Information Estimation","date":"2019-03-07","arxiv_id":"1903.02865","repositories_listed":1,"syntology":null},{"url":"/paper/empowerment-driven-exploration-using-mutual","slug":"empowerment-driven-exploration-using-mutual","title":"Empowerment-driven Exploration using Mutual Information Estimation","date":"2018-10-11","arxiv_id":"1810.05533","repositories_listed":1,"syntology":null},{"url":"/paper/mutual-information-neural-estimation","slug":"mutual-information-neural-estimation","title":"Mutual Information Neural Estimation","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-mutual-information-estimation-using","slug":"scalable-mutual-information-estimation-using","title":"Scalable Mutual Information Estimation using Dependence Graphs","date":"2018-01-27","arxiv_id":"1801.09125","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-mutual-information-for-discrete","slug":"estimating-mutual-information-for-discrete","title":"Estimating Mutual Information for Discrete-Continuous Mixtures","date":"2017-09-19","arxiv_id":"1709.06212","repositories_listed":1,"syntology":null},{"url":null,"slug":"distilling-transitional-pattern-to-large","title":"Distilling Transitional Pattern to Large Language Models for Multimodal Session-based Recommendation","date":"2025-04-13","arxiv_id":"2504.10538","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-bayesian-nonparametric-framework-for","title":"A Deep Bayesian Nonparametric Framework for Robust Mutual Information Estimation","date":"2025-03-11","arxiv_id":"2503.08902","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-statistical-learning-supervised-learning","title":"Meta-Statistical Learning: Supervised Learning of Statistical Inference","date":"2025-02-17","arxiv_id":"2502.12088","repositories_listed":0,"syntology":null},{"url":null,"slug":"infobridge-mutual-information-estimation-via","title":"InfoBridge: Mutual Information estimation via Bridge Matching","date":"2025-02-03","arxiv_id":"2502.01383","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-decoupling-concept-bottleneck-model","title":"The Decoupling Concept Bottleneck Model","date":"2024-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fasthdmi-fast-mutual-information-estimation","title":"fastHDMI: Fast Mutual Information Estimation for High-Dimensional Data","date":"2024-10-14","arxiv_id":"2410.10082","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangled-noisy-correspondence-learning","title":"Disentangled Noisy Correspondence Learning","date":"2024-08-10","arxiv_id":"2408.05503","repositories_listed":0,"syntology":null},{"url":null,"slug":"artifact-feature-purification-for-cross","title":"Artifact Feature Purification for Cross-domain Detection of AI-generated Images","date":"2024-03-17","arxiv_id":"2403.11172","repositories_listed":0,"syntology":null},{"url":null,"slug":"mutual-information-estimation-via-normalizing","title":"Mutual Information Estimation via Normalizing Flows","date":"2024-03-04","arxiv_id":"2403.02187","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-regularized-radon-nikodym-differentiation","title":"On regularized Radon-Nikodym differentiation","date":"2023-08-15","arxiv_id":"2308.07887","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgraph-networks-based-contrastive-learning","title":"Subgraph Networks Based Contrastive Learning","date":"2023-06-06","arxiv_id":"2306.03506","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-effectiveness-of-hybrid-mutual","title":"On the Effectiveness of Hybrid Mutual Information Estimation","date":"2023-06-01","arxiv_id":"2306.00608","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-the-density-ratio-between","title":"Estimating the Density Ratio between Distributions with High Discrepancy using Multinomial Logistic Regression","date":"2023-05-01","arxiv_id":"2305.00869","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-with-information","title":"Representation Learning with Information Theory for COVID-19 Detection","date":"2022-07-04","arxiv_id":"2207.01437","repositories_listed":0,"syntology":null},{"url":null,"slug":"mutual-information-estimation-for-graph","title":"Mutual information estimation for graph convolutional neural networks","date":"2022-03-31","arxiv_id":"2203.16887","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-perspective-on-neural-capacity-estimation","title":"A Perspective on Neural Capacity Estimation: Viability and Reliability","date":"2022-03-22","arxiv_id":"2203.11793","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-topic-modeling-with-deep-mutual","title":"Neural Topic Modeling with Deep Mutual Information Estimation","date":"2022-03-12","arxiv_id":"2203.06298","repositories_listed":0,"syntology":null},{"url":null,"slug":"cnn-aided-factor-graphs-with-estimated-mutual","title":"CNN-Aided Factor Graphs with Estimated Mutual Information Features for Seizure Detection","date":"2022-03-11","arxiv_id":"2203.05950","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-predictive-information-coding","title":"Compressed Predictive Information Coding","date":"2022-03-03","arxiv_id":"2203.02051","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-unsupervised-graph-representation","title":"Toward Enhanced Robustness in Unsupervised Graph Representation Learning: A Graph Information Bottleneck Perspective","date":"2022-01-21","arxiv_id":"2201.08557","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-reverse-jensen-inequality-result-with","title":"A Reverse Jensen Inequality Result with Application to Mutual Information Estimation","date":"2021-11-12","arxiv_id":"2111.06676","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-representations-for-testing","title":"Data-Driven Representations for Testing Independence: Modeling, Analysis and Connection with Mutual Information Estimation","date":"2021-10-27","arxiv_id":"2110.14122","repositories_listed":0,"syntology":null},{"url":null,"slug":"mutual-information-estimation-as-a-difference","title":"Mutual Information Estimation as a Difference of Entropies for Unsupervised Representation Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-bias-invariant-representation-by","title":"Learning Bias-Invariant Representation by Cross-Sample Mutual Information Minimization","date":"2021-08-11","arxiv_id":"2108.05449","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-order-identification-to-address","title":"Causal Order Identification to Address Confounding: Binary Variables","date":"2021-08-10","arxiv_id":"2108.04947","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-representation-learning-using","title":"Fair Representation Learning using Interpolation Enabled Disentanglement","date":"2021-07-31","arxiv_id":"2108.00295","repositories_listed":0,"syntology":null},{"url":null,"slug":"decomposed-mutual-information-estimation-for","title":"Decomposed Mutual Information Estimation for Contrastive Representation Learning","date":"2021-06-25","arxiv_id":"2106.13401","repositories_listed":0,"syntology":null},{"url":null,"slug":"novelty-detection-via-contrastive-learning","title":"Novelty Detection via Contrastive Learning with Negative Data Augmentation","date":"2021-06-18","arxiv_id":"2106.09958","repositories_listed":0,"syntology":null},{"url":null,"slug":"frustratingly-easy-transferability-estimation","title":"Frustratingly Easy Transferability Estimation","date":"2021-06-17","arxiv_id":"2106.09362","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforce-security-a-model-free-approach","title":"Reinforce Security: A Model-Free Approach Towards Secure Wiretap Coding","date":"2021-06-01","arxiv_id":"2106.00343","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-infonce-how-many-negative-samples","title":"Rethinking InfoNCE: How Many Negative Samples Do You Need?","date":"2021-05-27","arxiv_id":"2105.13003","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-quantitative-metric-for-privacy-leakage-in","title":"A Quantitative Metric for Privacy Leakage in Federated Learning","date":"2021-02-24","arxiv_id":"2102.13472","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-image-to-image-translation-via","title":"Multimodal Image-to-Image Translation via Mutual Information Estimation and Maximization","date":"2020-08-08","arxiv_id":"2008.03529","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-label-contrastive-predictive-coding","title":"Multi-label Contrastive Predictive Coding","date":"2020-07-20","arxiv_id":"2007.09852","repositories_listed":0,"syntology":null},{"url":null,"slug":"alleviating-the-incompatibility-between-cross","title":"Alleviating the Incompatibility between Cross Entropy Loss and Episode Training for Few-shot Skin Disease Classification","date":"2020-04-21","arxiv_id":"2004.09694","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-information-plane-analyses-of-neural","title":"On Information Plane Analyses of Neural Network Classifiers -- A Review","date":"2020-03-21","arxiv_id":"2003.09671","repositories_listed":0,"syntology":null},{"url":null,"slug":"matching-text-with-deep-mutual-information","title":"Matching Text with Deep Mutual Information Estimation","date":"2020-03-09","arxiv_id":"2003.11521","repositories_listed":0,"syntology":null},{"url":null,"slug":"style-based-variational-autoencoder-for-real","title":"Exploiting Style and Attention in Real-World Super-Resolution","date":"2019-12-21","arxiv_id":"1912.10227","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-mutual-information-estimation","title":"Improved Mutual Information Estimation","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-spectral-clustering-using-dual","title":"Deep Spectral Clustering using Dual Autoencoder Network","date":"2019-04-30","arxiv_id":"1904.13113","repositories_listed":0,"syntology":null},{"url":null,"slug":"biphasic-learning-of-gans-for-high-resolution","title":"Biphasic Learning of GANs for High-Resolution Image-to-Image Translation","date":"2019-04-14","arxiv_id":"1904.06624","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-estimators-show-information","title":"Adaptive Estimators Show Information Compression in Deep Neural Networks","date":"2019-02-24","arxiv_id":"1902.09037","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparanormal-information-estimation","title":"Nonparanormal Information Estimation","date":"2017-02-24","arxiv_id":"1702.07803","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-vine-copulas-as-joint-models-of-spike","title":"Mixed vine copulas as joint models of spike counts and local field potentials","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-evaluation-of-feature-selection","title":"Theoretical Evaluation of Feature Selection Methods based on Mutual Information","date":"2016-09-21","arxiv_id":"1609.06575","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-study-of-leading-measures-of","title":"An Empirical Study of Leading Measures of Dependence","date":"2015-05-09","arxiv_id":"1505.02214","repositories_listed":0,"syntology":null},{"url":null,"slug":"equitability-analysis-of-the-maximal","title":"Equitability Analysis of the Maximal Information Coefficient, with Comparisons","date":"2013-01-27","arxiv_id":"1301.6314","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-concentration-for-mutual","title":"Exponential Concentration for Mutual Information Estimation with Application to Forests","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":9,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/task/mutual-information-estimation/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/mutual-information-estimation/papers/ran/1","json":"/task/mutual-information-estimation/papers/ran/1.json","rows":9}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"974d1b0e6e669c97dfa75a8a4a6da876623c67d65d52bdeafbc9b192a73d4eca","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}