Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohamed Ishmael Belghazi

dblp:164/5662 · also Ishmael Belghazi, Mohamed Ishmael Diwan Belghazi · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Generative modeling · 37% Deep learning architectures and training · 25% Representation and self-supervised learning · 17%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 13 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training
0.412019
Learning about an exponential amount of conditional distributions · NeurIPS 2019
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › density estimation
conditional density estimation
0.412019
Learning about an exponential amount of conditional distributions · NeurIPS 2019
Machine learning › Generative modeling › diffusion model
conditional sampling
0.412019
Learning about an exponential amount of conditional distributions · NeurIPS 2019
Machine learning › Generative modeling
generative adversarial network
0.312018
Mutual Information Neural Estimation · ICML 2018
Machine learning › Representation and self-supervised learning › mutual information
mutual information estimation
0.312018
Mutual Information Neural Estimation · ICML 2018
Machine learning › Deep learning architectures and training
neural network estimator
0.312018
Mutual Information Neural Estimation · ICML 2018
Machine learning › Deep learning architectures and training
training objective
0.312018
Mutual Information Neural Estimation · ICML 2018
Machine learning › Generative modeling
adversarial generative modeling
0.312017
Adversarially Learned Inference · ICLR (Poster) 2017
Machine learning › Generative modeling › adversarial inference
adversarially learned inference
0.312017
Adversarially Learned Inference · ICLR (Poster) 2017
Machine learning › Representation and self-supervised learning › representation learning
latent representation learning
0.312017
Adversarially Learned Inference · ICLR (Poster) 2017
Machine learning › Deep learning architectures and training
autoencoder
0.212016
Conservativeness of Untied Auto-Encoders · AAAI 2016
Coding theory › source coding › rate-distortion theory
information bottleneck
0.112018
Mutual Information Neural Estimation · ICML 2018
Machine learning › Generative modeling
energy-based model
0.112016
Conservativeness of Untied Auto-Encoders · AAAI 2016

Methods — techniques the papers use, named apart from their topics

adversarial training · 0.7neural network estimation · 0.7gradient descent · 0.7self-supervised learning · 0.4variational inference · 0.3vector field decomposition · 0.2denoising criterion · 0.2
YearPublicationVenuePosition
2019 Learning about an exponential amount of conditional distributions
abstract
We introduce the Neural Conditioner (NC), a self-supervised machine able to learn about all the conditional distributions of a random vector X. The NC is a function NC(x⋅a,a,r) that leverages adversarial training to match each conditional distribution P(Xr|Xa=xa). After training, the NC generalizes to sample from conditional distributions never seen, including the joint distribution. The NC is also able to auto-encode examples, providing data representations useful for downstream classification tasks. In sum, the NC integrates different self-supervised tasks (each being the estimation of a conditional distribution) and levels of supervision (partially observed data) seamlessly into a single learning experience.
Mohamed Ishmael Belghazi, Maxime Oquab, David Lopez-Paz
NeurIPS1
2018 Mutual Information Neural Estimation
abstract
We argue that the estimation of mutual information between high dimensional continuous random variables can be achieved by gradient descent over neural networks. We present a Mutual Information Neural Estimator (MINE) that is linearly scalable in dimensionality as well as in sample size, trainable through back-prop, and strongly consistent. We present a handful of applications on which MINE can be used to minimize or maximize mutual information. We apply MINE to improve adversarially trained generative models. We also use MINE to implement the Information Bottleneck, applying it to supervised classification; our results demonstrate substantial improvement in flexibility and performance in these settings.
Mohamed Ishmael Belghazi, Aristide Baratin, Sai Rajeswar, Sherjil Ozair, Yoshua Bengio, R. Devon Hjelm, Aaron C. Courville
ICML1
2017 Adversarially Learned Inference
Vincent Dumoulin, Mohamed Ishmael Belghazi, Ben Poole, Alex Lamb, Martín Arjovsky, Olivier Mastropietro, Aaron C. Courville
ICLR (Poster)2
2016 Conservativeness of Untied Auto-Encoders
abstract
We discuss necessary and sufficient conditions for an auto-encoder to define a conservative vector field, in which case it is associated with anenergy function akin to the unnormalized log-probability of the data.We show that the conditions for conservativeness are more general than for encoder and decoder weights to be the same ("tied weights''), and thatthey also depend on the form of the hidden unit activation functions.Moreover, we show that contractive training criteria, such as denoising, enforces these conditions locally.Based on these observations, we show how we can use auto-encoders to extract the conservative component of a vector field.
Daniel Jiwoong Im, Mohamed Ishmael Belghazi, Roland Memisevic
AAAI2