Papers › Learning deep representations by mutual information estimation and maximization

Learning deep representations by mutual information estimation and maximization

20 Aug 2018ICLR 2019 5arXiv:1808.06670archive 2025-07-28

R. Devon Hjelm, Alex Fedorov, Samuel Lavoie-Marchildon, Karan Grewal, Phil Bachman, Adam Trischler, Yoshua Bengio

In this work, we perform unsupervised learning of representations by maximizing mutual information between an input and the output of a deep neural network encoder. Importantly, we show that structure matters: incorporating knowledge about locality of the input to the objective can greatly influence a representation's suitability for downstream tasks. We further control characteristics of the representation by matching to a prior distribution adversarially. Our method, which we call Deep InfoMax (DIM), outperforms a number of popular unsupervised learning methods and competes with fully-supervised learning on several classification tasks. DIM opens new avenues for unsupervised learning of representations and is an important step towards flexible formulations of representation-learning objectives for specific end-goals.

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="1808.06670")

Code

Syntology Ran 5 of 6 code samples harvested from 3 repositories linked to this paper; 1 has no recorded run. Of those that ran: 1 ran · fixture could not drive it; 4 ran with no contract checked.

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

rdevon/DIM officialmentioned in papermentioned on GitHubpytorch report
DuaneNielsen/DeepInfomaxPytorch mentioned on GitHubpytorch report
HolenYHR/Deepinfo_pytorch mentioned on GitHubpytorch report
bojone/infomax mentioned on GitHubtf report
createamind/DIM_Commented mentioned on GitHubpytorch report
ifding/simple-Infomax-pytorch mentioned on GitHubpytorch report
jqhoogland/rgpy mentioned on GitHubtf 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

6 samples harvested; 5 ran; 0 honoured the contract we drafted; 1 has 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 · fixture could not drive it
4ran
1unverified

Licence: 2 of the 6 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.

DeepInfoMaxLoss ifding/simple-Infomax-pytorch/models.py community (archive-listed) ran · metamorphic tier: deterministic MIT (permissive) · fa2d8d0740b5f178 · report
Encoder HolenYHR/Deepinfo_pytorch/model.py community (archive-listed) ran no licence file found · pointer only · 34defba22049fee0 · report
LocalDiscriminator ifding/simple-Infomax-pytorch/models.py community (archive-listed) ran MIT (permissive) · 9294e9272cea78ad · report
PriorDiscriminator ifding/simple-Infomax-pytorch/models.py community (archive-listed) ran MIT (permissive) · 727245272a3c5183 · report
infonce_loss schzhu/learning-adversarially-robust-representations/robust_representations/functions/dim_losses.py community (archive-listed) ran · fixture could not drive it fingerprinted no licence file found · pointer only · 2ca8bbd852e6a9f2 · report
GlobalDiscriminator ifding/simple-Infomax-pytorch/models.py community (archive-listed) unverified MIT (permissive) · 2eade593e94bf4be · report

Tasks

General ClassificationMutual Information EstimationRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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