%0 Generic %1 citeulike:14628186 %A xxx, %D 2018 %K backbone classification gan loss regularization semisup %T Learning deep representations by mutual information estimation and maximization %U http://arxiv.org/abs/1808.06670 %X Many popular representation-learning algorithms use training objectives defined on the observed data space, which we call pixel-level. This may be detrimental when only a small fraction of the bits of signal actually matter at a semantic level. We hypothesize that representations should be learned and evaluated more directly in terms of their information content and statistical or structural constraints. To address the first quality, we consider learning unsupervised representations by maximizing mutual information between part or all of the input and a high-level feature vector. To address the second, we control characteristics of the representation by matching to a prior adversarially. Our method, which we call Deep INFOMAX (DIM), can be used to learn representations with desired characteristics and which empirically outperform a number of popular unsupervised learning methods on classification tasks. DIM opens new avenues for unsupervised learn-ing of representations and is an important step towards flexible formulations of representation learning objectives catered towards specific end-goals.

@misc{citeulike:14628186, abstract = {{Many popular representation-learning algorithms use training objectives defined on the observed data space, which we call pixel-level. This may be detrimental when only a small fraction of the bits of signal actually matter at a semantic level. We hypothesize that representations should be learned and evaluated more directly in terms of their information content and statistical or structural constraints. To address the first quality, we consider learning unsupervised representations by maximizing mutual information between part or all of the input and a high-level feature vector. To address the second, we control characteristics of the representation by matching to a prior adversarially. Our method, which we call Deep INFOMAX (DIM), can be used to learn representations with desired characteristics and which empirically outperform a number of popular unsupervised learning methods on classification tasks. DIM opens new avenues for unsupervised learn-ing of representations and is an important step towards flexible formulations of representation learning objectives catered towards specific end-goals.}}, added-at = {2019-02-27T22:23:29.000+0100}, archiveprefix = {arXiv}, author = {xxx}, biburl = {https://www.bibsonomy.org/bibtex/2ef1f168910ddd87fe5bfb79c48d7ff77/nmatsuk}, citeulike-article-id = {14628186}, citeulike-linkout-0 = {http://arxiv.org/abs/1808.06670}, citeulike-linkout-1 = {http://arxiv.org/pdf/1808.06670}, day = 24, eprint = {1808.06670}, interhash = {44ab8c2c3759e3d9743dfcca14f94882}, intrahash = {ef1f168910ddd87fe5bfb79c48d7ff77}, keywords = {backbone classification gan loss regularization semisup}, month = aug, posted-at = {2018-09-12 11:40:26}, priority = {2}, timestamp = {2019-02-27T22:23:29.000+0100}, title = {{Learning deep representations by mutual information estimation and maximization}}, url = {http://arxiv.org/abs/1808.06670}, year = 2018 }