Papers › Learning Representations by Maximizing Mutual Information Across Views

Learning Representations by Maximizing Mutual Information Across Views

3 Jun 2019NeurIPS 2019 12arXiv:1906.00910archive 2025-07-28

Philip Bachman, R. Devon Hjelm, William Buchwalter

We propose an approach to self-supervised representation learning based on maximizing mutual information between features extracted from multiple views of a shared context. For example, one could produce multiple views of a local spatio-temporal context by observing it from different locations (e.g., camera positions within a scene), and via different modalities (e.g., tactile, auditory, or visual). Or, an ImageNet image could provide a context from which one produces multiple views by repeatedly applying data augmentation. Maximizing mutual information between features extracted from these views requires capturing information about high-level factors whose influence spans multiple views -- e.g., presence of certain objects or occurrence of certain events. Following our proposed approach, we develop a model which learns image representations that significantly outperform prior methods on the tasks we consider. Most notably, using self-supervised learning, our model learns representations which achieve 68.1% accuracy on ImageNet using standard linear evaluation. This beats prior results by over 12% and concurrent results by 7%. When we extend our model to use mixture-based representations, segmentation behaviour emerges as a natural side-effect. Our code is available online: https://github.com/Philip-Bachman/amdim-public.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1906.00910")

Code

Syntology Ran 8 of 11 code samples harvested from 3 repositories linked to this paper; 3 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 7 ran with no contract checked.

By repository: community (archive-listed): 11 samples from 3 repositories, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Alibaba-AAIG/SSL-FEW-SHOT mentioned on GitHubpytorch report
cfld/amdim mentioned on GitHubpytorch report
philip-bachman/amdim-public mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 8 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
7ran
3unverified

Licence: 3 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Conv3x3 Alibaba-AAIG/SSL-FEW-SHOT/feat/networks/amdimnet.py community (archive-listed) ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · fd0c3fab3b60d3c1 · report
ConvResBlock Alibaba-AAIG/SSL-FEW-SHOT/feat/networks/amdimnet.py community (archive-listed) ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 033b4f1cc1d18de5 · report
ConvResNxN Alibaba-AAIG/SSL-FEW-SHOT/feat/networks/amdimnet.py community (archive-listed) ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 5cd380ad133ebedc · report
MaybeBatchNorm2d Alibaba-AAIG/SSL-FEW-SHOT/feat/networks/amdimnet.py community (archive-listed) ran · metamorphic tier: deterministic MIT (permissive) · 5212c46b5f2ab291 · report
NCE_MI_MULTI cfld/amdim/amdim/costs.py community (archive-listed) ran no licence file found · pointer only · ff3dd74ec75795e6 · report
NCE_MI_MULTI Philip-Bachman/amdim-public/costs.py community (archive-listed) ran MIT (permissive) · df7e2b94c623d6a1 · report
NopNet Alibaba-AAIG/SSL-FEW-SHOT/feat/networks/amdimnet.py community (archive-listed) ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 1ec03f92bbeb5aa5 · report
tanh_clip cfld/amdim/amdim/costs.py community (archive-listed) ran · our draft was wrong fingerprinted no licence file found · pointer only · 93154000bc1f766f · report
AmdimNet Alibaba-AAIG/SSL-FEW-SHOT/feat/networks/amdimnet.py community (archive-listed) unverified MIT (permissive) · f46b7bbcd154de3b · report
FakeRKHSConvNet Alibaba-AAIG/SSL-FEW-SHOT/feat/networks/amdimnet.py community (archive-listed) unverified MIT (permissive) · 5e82fbe775ab5a0e · report
LossMultiNCE cfld/amdim/amdim/costs.py community (archive-listed) unverified no licence file found · pointer only · e4ac668dd3286000 · report

Tasks

Data AugmentationImage ClassificationLinear evaluationRepresentation LearningSelf-Supervised Image ClassificationSelf-Supervised Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Image Classification STL-10 AMDIM Percentage correct 94.5 #21 of 117 Archive leaderboard report
Self-Supervised Image Classification ImageNet AMDIM (large) (arxiv v2) Number of Params 626M #106 of 144 Archive leaderboard report
Self-Supervised Image Classification ImageNet AMDIM (large) (arxiv v2) Top 1 Accuracy 68.1% #106 of 144 Archive leaderboard report
Self-Supervised Image Classification ImageNet AMDIM (small) (arxiv v2) Number of Params 194M #118 of 144 Archive leaderboard report
Self-Supervised Image Classification ImageNet AMDIM (small) (arxiv v2) Top 1 Accuracy 63.5% #118 of 144 Archive leaderboard report
Self-Supervised Image Classification ImageNet AMDIM (arxiv v1) Number of Params 337M #125 of 144 Archive leaderboard report
Self-Supervised Image Classification ImageNet AMDIM (arxiv v1) Top 1 Accuracy 60.2% #125 of 144 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections