rebar
Model Discrete Parameters In Stan
view repo
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 variance of the REINFORCE estimator. Recent work (Jang et al. 2016, Maddison et al. 2016) has taken a different approach, introducing a continuous relaxation of discrete variables to produce low-variance, but biased, gradient estimates. In this work, we combine the two approaches through a novel control variate that produces low-variance, unbiased gradient estimates. Then, we introduce a modification to the continuous relaxation and show that the tightness of the relaxation can be adapted online, removing it as a hyperparameter. We show state-of-the-art variance reduction on several benchmark generative modeling tasks, generally leading to faster convergence to a better final log-likelihood.
READ FULL TEXT VIEW PDF
Training models with discrete latent variables is challenging due to the...
read it
Low-variance gradient estimation is crucial for learning directed graphi...
read it
Discrete latent-variable models, while applicable in a variety of settin...
read it
Training models with discrete latent variables is challenging due to the...
read it
Learning models with discrete latent variables using stochastic gradient...
read it
Deep latent variable models have become a popular model choice due to th...
read it
In many applications we seek to maximize an expectation with respect to ...
read it
Model Discrete Parameters In Stan
Models with discrete latent variables are ubiquitous in machine learning: mixture models, Markov Decision Processes in reinforcement learning (RL), generative models for structured prediction, and, recently, models with hard attention
(Mnih et al., 2014) and memory networks (Zaremba & Sutskever, 2015). However, when the discrete latent variables cannot be marginalized out analytically, maximizing objectives over these models using REINFORCE-like methods (Williams, 1992) is challenging due to high-variance gradient estimates obtained from sampling. Most approaches to reducing this variance have focused on developing clever control variates (Mnih & Gregor, 2014; Titsias & Lázaro-Gredilla, 2015; Gu et al., 2015; Mnih & Rezende, 2016). Recently, Jang et al. (2016) and Maddison et al. (2016) independently introduced a novel distribution, the Gumbel-Softmax or Concretedistribution, that continuously relaxes discrete random variables. Replacing every discrete random variable in a model with a Concrete random variable results in a continuous model where the reparameterization trick is applicable
(Kingma & Welling, 2013; Rezende et al., 2014). The gradients are biased with respect to the discrete model, but can be used effectively to optimize large models. The tightness of the relaxation is controlled by a temperature hyperparameter. In the low temperature limit, the gradient estimates become unbiased, but the variance of the gradient estimator diverges, so the temperature must be tuned to balance bias and variance. ^{†}^{†}Source code for experiments: github.com/tensorflow/models/tree/master/research/rebarWe sought an estimator that is low-variance, unbiased, and does not require tuning additional hyperparameters. To construct such an estimator, we introduce a simple control variate based on the difference between the REINFORCE and the reparameterization trick gradient estimators for the relaxed model. This reduces variance, but does not outperform state-of-the-art methods on its own. Our key contribution is to show that it is possible to conditionally marginalize the control variate to significantly improve its effectiveness. We call this the REBAR gradient estimator, because it combines REINFORCE gradients with gradients of the Concrete relaxation. Next, we show that a modification to the Concrete relaxation connects REBAR to MuProp in the high temperature limit. Finally, because REBAR is unbiased for all temperatures, we show that the temperature can be optimized online to reduce variance further and relieve the burden of setting an additional hyperparameter.
In our experiments, we illustrate the potential problems inherent with biased gradient estimators on a toy problem. Then, we use REBAR to train generative sigmoid belief networks (SBNs) on the MNIST and Omniglot datasets and to train conditional generative models on MNIST. Across tasks, we show that REBAR has state-of-the-art variance reduction which translates to faster convergence and better final log-likelihoods. Although we focus on binary variables for simplicity, this work is equally applicable to categorical variables (Appendix
LABEL:sec:reparameterizations).For clarity, we first consider a simplified scenario. Let
be a vector of independent binary random variables parameterized by
. We wish to maximizewhere is differentiable with respect to and , and we suppress the dependence of on to reduce notational clutter. This covers a wide range of discrete latent variable problems; for example, in variational inference would be the stochastic variational lower bound.
Typically, this problem has been approached by gradient ascent, which requires efficiently estimating
(1) |
In practice, the first term can be estimated effectively with a single Monte Carlo sample, however, a naïve single sample estimator of the second term has high variance. Because the dependence of on is straightforward to account for, to simplify exposition we assume that does not depend on and concentrate on the second term.
Paisley et al. (2012); Ranganath et al. (2014); Mnih & Gregor (2014); Gu et al. (2015) show that carefully designed control variates can reduce the variance of the second term significantly. Control variates seek to reduce the variance of such estimators using closed form expectations for closely related terms. We can subtract any (random or constant) as long as we can correct the bias (see Appendix LABEL:sec:cv and (Paisley et al., 2012) for a review of control variates in this context):
For example, NVIL (Mnih & Gregor, 2014) learns a that does not depend^{1}^{1}1In this case, depends on the implicit observation in variational inference. on and MuProp (Gu et al., 2015) uses a linear Taylor expansion of around . Unfortunately, even with a control variate, the term can still have high variance.
Alternatively, following Maddison et al. (2016), we can parameterize as , where is the element-wise hard threshold function^{2}^{2}2 if and if . and is a vector of independent Logistic random variables defined by
where . Notably, is differentiably reparameterizable (Kingma & Welling, 2013; Rezende et al., 2014), but the discontinuous hard threshold function prevents us from using the reparameterization trick directly. Replacing all occurrences of the hard threshold function with a continuous relaxation however results in a reparameterizable computational graph. Thus, we can compute low-variance gradient estimates for the relaxed model that approximate the gradient for the discrete model. In summary,
where can be thought of as a temperature that controls the tightness of the relaxation (at low temperatures, the relaxation is nearly tight). This generally results in a low-variance, but biased Monte Carlo estimator for the discrete model. As , the approximation becomes exact, but the variance of the Monte Carlo estimator diverges. Thus, in practice, must be tuned to balance bias and variance. See Appendix LABEL:sec:reparameterizations and Jang et al. (2016); Maddison et al. (2016) for the generalization to the categorical case.
We seek a low-variance, unbiased gradient estimator. Inspired by the Concrete relaxation, our strategy will be to construct a control variate (see Appendix LABEL:sec:cv for a review of control variates in this context) based on the difference between the REINFORCE gradient estimator for the relaxed model and the gradient estimator from the reparameterization trick. First, note that closely following Eq. 1
(2) |
The similar form of the REINFORCE gradient estimator for the relaxed model
(3) |
suggests it will be strongly correlated and thus be an effective control variate. Unfortunately, the Monte Carlo gradient estimator derived from the left hand side of Eq. 2 has much lower variance than the Monte Carlo gradient estimator derived from the right hand side. This is because the left hand side can be seen as analytically performing a conditional marginalization over given , which is noisily approximated by Monte Carlo samples on the right hand side (see Appendix LABEL:sec:cond_marg for details). Our key insight is that an analogous conditional marginalization can be performed for the control variate (Eq. 3),
where the first term on the right-hand side can be efficiently estimated with the reparameterization trick (see Appendix LABEL:sec:reparameterizations for the details)
where and is the differentiable reparameterization for (Appendix LABEL:sec:reparameterizations). Therefore,
Using this to form the control variate and correcting with the reparameterization trick gradient, we arrive at
(4) |
where , , , and is a scaling on the control variate. The REBAR estimator is the single sample Monte Carlo estimator of this expectation. To reduce computation and variance, we couple and using common random numbers (Appendix LABEL:sec:implementation, (Owen, 2013)). We estimate by minimizing the variance of the Monte Carlo estimator with SGD. In Appendix LABEL:sec:alternative_derivation, we present an alternative derivation of REBAR that is shorter, but less intuitive.
Because as , we consider an alternative relaxation
(5) |
where . As , the relaxation converges to the mean, , and still as , the relaxation becomes exact. Furthermore, as , the REBAR estimator converges to MuProp without the linear term (see Appendix LABEL:sec:rethinking). We refer to this estimator as SimpleMuProp in the results.
The REBAR gradient estimator is unbiased for any choice of , so we can optimize to minimize the variance of the estimator without affecting its unbiasedness (similar to optimizing the dispersion coefficients in Ruiz et al. (2016)). In particular, denoting the REBAR gradient estimator by , then
because does not depend on . The resulting expectation can be estimated with a single sample Monte Carlo estimator. This allows the tightness of the relaxation to be adapted online jointly with the optimization of the parameters and relieves the burden of choosing ahead of time.
Suppose we have multiple layers of stochastic units (i.e., ) where factorizes as
and similarly for the underlying Logistic random variables recalling that . We can define a relaxed distribution over where we replace the hard threshold function with a continuous relaxation . We refer to the relaxed distribution as .
We can take advantage of the structure of , by using the fact that the high variance REINFORCE term of the gradient also decomposes
Focusing on the term, we have
which suggests the following control variate
for the middle expectation. Similarly to the single layer case, we can debias the control variate with terms that are reparameterizable. Note that due to the switch between sampling from and sampling from , this approach requires passes through the network (one pass per layer). We discuss alternatives that do not require multiple passes through the network in Appendix LABEL:sec:multilayer_appendix.
Finally, we note that since the derivation of this control variate is independent of , the REBAR control variate can be generalized by replacing with a learned, differentiable -function. This suggests that the REBAR control variate is applicable to RL, where it would allow a “pseudo-action”-dependent baseline. In this case, the pseudo-action would be the relaxation of the discrete output from a policy network.
Most approaches to optimizing an expectation of a function w.r.t. a discrete distribution based on samples from the distribution can be seen as applications of the REINFORCE (Williams, 1992) gradient estimator, also known as the likelihood ratio (Glynn, 1990) or score-function estimator (Fu, 2006). Following the notation from Section 2, the basic form of an estimator of this type is where is a sample from the discrete distribution and is some quantity independent of , known as a baseline. Such estimators are unbiased, but without a carefully chosen baseline their variance tends to be too high for the estimator to be useful and much work has gone into finding effective baselines.
In the context of training latent variable models, REINFORCE-like methods have been used to implement sampling-based variational inference with either fully factorized (Wingate & Weber, 2013; Ranganath et al., 2014) or structured (Mnih & Gregor, 2014; Gu et al., 2015) variational distributions. All of these involve learned baselines: from simple scalar baselines (Wingate & Weber, 2013; Ranganath et al., 2014) to nonlinear input-dependent baselines (Mnih & Gregor, 2014). MuProp (Gu et al., 2015) combines an input-dependent baseline with a first-order Taylor approximation to the function based on the corresponding mean-field network to achieve further variance reduction. REBAR is similar to MuProp in that it also uses gradient information from a proxy model to reduce the variance of a REINFORCE-like estimator. The main difference is that in our approach the proxy model is essentially the relaxed (but still stochastic) version of the model we are interested in, whereas MuProp uses the mean field version of the model as a proxy, which can behave very differently from the original model due to being completely deterministic. The relaxation we use was proposed by (Maddison et al., 2016; Jang et al., 2016) as a way of making discrete latent variable models reparameterizable, resulting in a low-variance but biased gradient estimator for the original model. REBAR on the other hand, uses the relaxation in a control variate which results in an unbiased, low-variance estimator. Alternatively, Titsias & Lázaro-Gredilla (2015) introduced local expectation gradients, a general purpose unbiased gradient estimator for models with continuous and discrete latent variables. However, it typically requires substantially more computation than other methods. Recently, a specialized REINFORCE-like method was proposed for the tighter multi-sample version of the variational bound (Burda et al., 2015) which uses a leave-out-out technique to construct per-sample baselines (Mnih & Rezende, 2016). This approach is orthogonal to ours, and we expect it to benefit from incorporating the REBAR control variate.
As our goal was variance reduction to improve optimization, we compared our method to the state-of-the-art unbiased single-sample gradient estimators, NVIL (Mnih & Gregor, 2014) and MuProp (Gu et al., 2015), and the state-of-the-art biased single-sample gradient estimator Gumbel-Softmax/Concrete (Jang et al., 2016; Maddison et al., 2016) by measuring their progress on the training objective and the variance of the unbiased gradient estimators^{3}^{3}3Both MuProp and REBAR require twice as much computation per step as NVIL and Concrete. To present comparable results with previous work, we plot our results in steps. However, to offer a fair comparison, NVIL should use two samples and thus reduce its variance by half (or in our plots). . We start with an illustrative problem and then follow the experimental setup established in (Maddison et al., 2016) to evaluate the methods on generative modeling and structured prediction tasks.
To illustrate the potential ill-effects of biased gradient estimators, we evaluated the methods on a simple toy problem. We wish to minimize , where
is a continuous target value, and we have a single parameter controlling the Bernoulli distribution. Figure
1 shows the perils of biased gradient estimators. The optimal solution is deterministic (i.e.,), whereas the Concrete estimator converges to a stochastic one. All of the unbiased estimators correctly converge to the optimal loss, whereas the biased estimator fails to. For this simple problem, it is sufficient to reduce temperature of the relaxation to achieve an acceptable solution.
Next, we trained SBNs on several standard benchmark tasks. We follow the setup established in (Maddison et al., 2016)
. We used the statically binarized MNIST digits from
Salakhutdinov & Murray (2008) and a fixed binarization of the Omniglot character dataset. We used the standard splits into training, validation, and test sets. The network used several layers of 200 stochastic binary units interleaved with deterministic nonlinearities. In our experiments, we used either a linear deterministic layer (denoted linear) or 2 layers of 200 tanh units (denoted nonlinear).For generative modeling, we maximized a single-sample variational lower bound on the log-likelihood. We performed amortized inference (Kingma & Welling, 2013; Rezende et al., 2014) with an inference network with similar architecture in the reverse direction. In particular, denoting the image by and the hidden layer stochastic activations by , we have
which has the required form for REBAR.
To measure the variance of the gradient estimators, we follow a single optimization trajectory and use the same random numbers for all methods. This significantly reduces the variance in our measurements. We plot the log variance of the unbiased gradient estimators in Figure 2 for MNIST (Appendix Figure App.3 for Omniglot). REBAR produced the lowest variance across linear and nonlinear models for both tasks. The reduction in variance was especially large for the linear models. For the nonlinear model, REBAR (0.1) reduced variance at the beginning of training, but its performance degraded later in training. REBAR was able to adaptively change the temperature as optimization progressed and retained superior variance reduction. We also observed that SimpleMuProp was a surprisingly strong baseline that improved significantly over NVIL. It performed similarly to MuProp despite not explicitly using the gradient of .
Generally, lower variance gradient estimates led to faster optimization of the objective and convergence to a better final value (Figure 3, Table 1, Appendix Figures App.2 and App.4). For the nonlinear model, the Concrete estimator underperformed optimizing the training objective in both tasks.
Although our primary focus was optimization, for completeness, we include results on the test set in Appendix Table LABEL:tab:test computed with a -sample lower bound Burda et al. (2015). Improvements on the training variational lower bound do not directly translate into improved test log-likelihood. Previous work (Maddison et al., 2016) showed that regularizing the inference network alone was sufficient to prevent overfitting. This led us to hypothesize that the overfitting results was primarily due to overfitting in the inference network (). To test this, we trained a separate inference network on the validation and test sets, taking care not to affect the model parameters. This reduced overfitting (Appendix Figure LABEL:fig:app_train_q), but did not completely resolve the issue, suggesting that the generative and inference networks jointly overfit.
Log variance of the gradient estimator for the two layer linear model (left) and single layer nonlinear model (right) on the MNIST generative modeling task. All of the estimators are unbiased, so their variance is directly comparable. We estimated moments from exponential moving averages (with decay=0.999; we found that the results were robust to the exact value). The temperature is shown in parenthesis where relevant.
Structured prediction is a form of conditional density estimation that aims to model high dimensional observations given a context. We followed the structured prediction task described by Raiko et al. (2014), where we modeled the bottom half of an MNIST digit () conditional on the top half (). The conditional generative network takes as input and passes it through an SBN. We optimized a single sample lower bound on the log-likelihood
We measured the log variance of the gradient estimator (Figure 4) and found that REBAR significantly reduced variance. In some configurations, MuProp excelled, especially with the single layer linear model where the first order expansion that MuProp uses is most accurate. Again, the training objective performance generally mirrored the reduction in variance of the gradient estimator (Figure 5, Table 1).
Inspired by the Concrete relaxation, we introduced REBAR, a novel control variate for REINFORCE, and demonstrated that it greatly reduces the variance of the gradient estimator. We also showed that with a modification to the relaxation, REBAR and MuProp are closely related in the high temperature limit. Moreover, we showed that we can adapt the temperature online and that it further reduces variance.
Roeder et al. (2017) show that the reparameterization gradient includes a score function term which can adversely affect the gradient variance. Because the reparameterization gradient only enters the REBAR estimator through differences of reparameterization gradients, we implicitly implement the recommendation from (Roeder et al., 2017).
When optimizing the relaxation temperature, we require the derivative with respect to of the gradient of the parameters. Empirically, the temperature changes slowly relative to the parameters, so we might be able to amortize the cost of this operation over several parameter updates. We leave exploring these ideas to future work.
It would be natural to explore the extension to the multi-sample case (e.g., VIMCO (Mnih & Rezende, 2016)), to leverage the layered structure in our models using -functions, and to apply this approach to reinforcement learning.
We thank Ben Poole and Eric Jang for helpful discussions and assistance replicating their results.
Variational bayesian inference with stochastic search.
In Proceedings of the 29th International Coference on International Conference on Machine Learning, pp. 1363–1370, 2012.Stochastic backpropagation and approximate inference in deep generative models.
In Proceedings of The 31st International Conference on Machine Learning, pp. 1278–1286, 2014.Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence
, pp. 647–656. AUAI Press, 2016.On the quantitative analysis of deep belief networks.
In Proceedings of the 25th international conference on Machine learning, pp. 872–879. ACM, 2008.
Comments
There are no comments yet.