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.

Sumedh Ghaisas

dblp:229/4732 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 2

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
2 papers
Trustworthy machine learning · 55% Representation and self-supervised learning · 30% Generative modeling · 15%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
robust representations
0.922020
The Autoencoding Variational Autoencoder · NeurIPS 2020
Adversarially Robust Representations with Smooth Encoders · ICLR 2020
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.412020
Adversarially Robust Representations with Smooth Encoders · ICLR 2020
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
self-supervised representation learning
0.412020
The Autoencoding Variational Autoencoder · NeurIPS 2020
Machine learning › Generative modeling
variational autoencoder
0.412020
The Autoencoding Variational Autoencoder · NeurIPS 2020
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.112020
The Autoencoding Variational Autoencoder · NeurIPS 2020
Machine learning › Trustworthy machine learning
robustness
0.112020
The Autoencoding Variational Autoencoder · NeurIPS 2020

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

variational inference · 0.4smooth encoders · 0.4self-supervised post-processing · 0.4markov chain alternating encoder-decoder · 0.4adversarial training · 0.4
YearPublicationVenuePosition
2020 Adversarially Robust Representations with Smooth Encoders
A. Taylan Cemgil, Sumedh Ghaisas, Krishnamurthy Dvijotham, Pushmeet Kohli
ICLR2
2020 The Autoencoding Variational Autoencoder
abstract
Does a Variational AutoEncoder (VAE) consistently encode typical samples generated from its decoder? This paper shows that the perhaps surprising answer to this question is `No'; a (nominally trained) VAE does not necessarily amortize inference for typical samples that it is capable of generating. We study the implications of this behaviour on the learned representations and also the consequences of fixing it by introducing a notion of self consistency. Our approach hinges on an alternative construction of the variational approximation distribution to the true posterior of an extended VAE model with a Markov chain alternating between the encoder and the decoder. The method can be used to train a VAE model from scratch or given an already trained VAE, it can be run as a post processing step in an entirely self supervised way without access to the original training data. Our experimental analysis reveals that encoders trained with our self-consistency approach lead to representations that are robust (insensitive) to perturbations in the input introduced by adversarial attacks. We provide experimental results on the ColorMnist and CelebA benchmark datasets that quantify the properties of the learned representations and compare the approach with a baseline that is specifically trained for the desired property.
A. Taylan Cemgil, Sumedh Ghaisas, Krishnamurthy Dvijotham, Sven Gowal, Pushmeet Kohli
NeurIPS2