paper-with-me

Papers

The Information Autoencoding Family: A Lagrangian Perspective on Latent Variable Generative Models

2018-06-18 · Shengjia Zhao, Jiaming Song, Stefano Ermon

A large number of objectives have been proposed to train latent variable generative models. We show that many of them are Lagrangian dual functions of the same primal optimization problem. The primal problem optimizes the mutual information between latent and visible variables, subject to the constraints of accurately modeling the data distribution and performing correct amortized inference. By choosing to maximize or minimize mutual information, and choosing different Lagrange multipliers, we obtain different objectives including InfoGAN, ALI/BiGAN, ALICE, CycleGAN, beta-VAE, adversarial autoencoders, AVB, AS-VAE and InfoVAE. Based on this observation, we provide an exhaustive characterization of the statistical and computational trade-offs made by all the training objectives in this class of Lagrangian duals. Next, we propose a dual optimization method where we optimize model parameters as well as the Lagrange multipliers. This method achieves Pareto optimal solutions in terms of optimizing information and satisfying the constraints.

📄 PDF Abstract BibTeX arXiv:1806.06514

Code (2)

ermongroup/lagvae 공식 구현 tf
BerenMillidge/LagrangianVAE.jl

Methods 이 논문이 사용한 방법론

Batch Normalization 설명 없음
Residual Connection 설명 없음
PatchGAN 설명 없음
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Tanh Activation 설명 없음
Residual Block Residual Blocks are skip-connection blocks that learn residual functions with reference to the layer inputs, instead of learning unreferenced functions. They were introduced…
Instance Normalization Instance Normalization (also known as contrast normalization) is a normalization layer where: $$ y_{tijk} = \frac{x_{tijk} - \mu_{ti}}{\sqrt{\sigma_{ti}^2 +…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

The Information-Autoencoding Family: A Lagrangian Perspective on Latent Variable Generative Modeling

2018-01-01 · ICLR 2018 1 · Shengjia Zhao, Jiaming Song, Stefano Ermon

A variety of learning objectives have been recently proposed for training generative models. We show that many of them, including InfoGAN, ALI/BiGAN, ALICE, CycleGAN, VAE, $\beta$-VAE, adversarial autoencoders, AVB, and …

A Variational Perspective on Accelerated Methods in Optimization

2016-03-14 · Andre Wibisono, Ashia C. Wilson, Michael. I. Jordan

Accelerated gradient methods play a central role in optimization, achieving optimal rates in many settings. While many generalizations and extensions of Nesterov's original acceleration method have been proposed, it is n…

Structured Neural Topic Models for Reviews

2018-12-12 · Babak Esmaeili, Hongyi Huang, Byron C. Wallace, Jan-Willem van de Meent

We present Variational Aspect-based Latent Topic Allocation (VALTA), a family of autoencoding topic models that learn aspect-based representations of reviews. VALTA defines a user-item encoder that maps bag-of-words vect…

SentenceTopic Models

Towards Deeper Understanding of Variational Autoencoding Models

2017-02-28 · Shengjia Zhao, Jiaming Song, Stefano Ermon

We propose a new family of optimization criteria for variational auto-encoding models, generalizing the standard evidence lower bound. We provide conditions under which they recover the data distribution and learn latent…

Semi-supervised Autoencoding Projective Dependency Parsing

2020-11-02 · COLING 2020 8 · Xiao Zhang, Dan Goldwasser

We describe two end-to-end autoencoding models for semi-supervised graph-based projective dependency parsing. The first model is a Locally Autoencoding Parser (LAP) encoding the input using continuous latent variables in…

DecoderDependency Parsing