activity
20172023
most citedREBAR: Low-variance, unbiased gradient estimates for discrete latent variable models

147 citations · 196 across the 11 of their papers we have counts for

collaborators

12 papers

cs.LG2023

NAS-X: Neural Adaptive Smoothing via Twisting

Dieterich Lawson, Michael Li, Scott Linderman

Sequential latent variable models (SLVMs) are essential tools in statistics and machine learning, with applications ranging from healthcare to neuroscience. As their flexibility in…

cs.LG2022★ 1 cited

SIXO: Smoothing Inference with Twisted Objectives

Dieterich Lawson, Allan Raventós, Andrew Warrington +1

Sequential Monte Carlo (SMC) is an inference algorithm for state space models that approximates the posterior by sampling from a sequence of target distributions. The target distri…

cs.LG2021★ 2 cited

The Neural Testbed: Evaluating Joint Predictions

Ian Osband, Zheng Wen, Seyed Mohammad Asghari +7

Predictive distributions quantify uncertainties ignored by point estimates. This paper introduces The Neural Testbed: an open-source benchmark for controlled and principled evaluat…

cs.LG2019★ 2 cited

Energy-Inspired Models: Learning with Sampler-Induced Distributions

Dieterich Lawson, George Tucker, Bo Dai +1

Energy-based models (EBMs) are powerful probabilistic models, but suffer from intractable sampling and density evaluation due to the partition function. As a result, inference in E…

cs.LG2018★ 12 cited

Doubly Reparameterized Gradient Estimators for Monte Carlo Objectives

George Tucker, Dieterich Lawson, Shixiang Gu +1

Deep latent variable models have become a popular model choice due to the scalable learning algorithms introduced by (Kingma & Welling, 2013; Rezende et al., 2014). These approache…

cs.CL2017★ 3 cited

An online sequence-to-sequence model for noisy speech recognition

Chung-Cheng Chiu, Dieterich Lawson, Yuping Luo +4

Generative models have long been the dominant approach for speech recognition. The success of these models however relies on the use of sophisticated recipes and complicated machin…

cs.LG2017★ 3 cited

Filtering Variational Objectives

Chris J. Maddison, Dieterich Lawson, George Tucker +5

When used as a surrogate objective for maximum likelihood estimation in latent variable models, the evidence lower bound (ELBO) produces state-of-the-art results. Inspired by this,…

cs.AI2017

Learning Hard Alignments with Variational Inference

Dieterich Lawson, Chung-Cheng Chiu, George Tucker +3

There has recently been significant interest in hard attention models for tasks such as object recognition, visual captioning and speech recognition. Hard attention can offer benef…

cs.LG2017★ 8 cited

Particle Value Functions

Chris J. Maddison, Dieterich Lawson, George Tucker +4

The policy gradients of the expected return objective can react slowly to rare rewards. Yet, in some cases agents may wish to emphasize the low or high returns regardless of their…

cs.LG2017★ 147 cited

REBAR: Low-variance, unbiased gradient estimates for discrete latent variable models

George Tucker, Andriy Mnih, Chris J. Maddison +2

Learning in models with discrete latent variables is challenging due to high variance gradient estimators. Generally, approaches have relied on control variates to reduce the varia…

stat.ML2017★ 18 cited

Changing Model Behavior at Test-Time Using Reinforcement Learning

Augustus Odena, Dieterich Lawson, Christopher Olah

Machine learning models are often used at test-time subject to constraints and trade-offs not present at training-time. For example, a computer vision model operating on an embedde…

cs.LG2017

Training a Subsampling Mechanism in Expectation

Colin Raffel, Dieterich Lawson

We describe a mechanism for subsampling sequences and show how to compute its expected output so that it can be trained with standard backpropagation. We test this approach on a si…