R ESIDUAL E NERGY -B ASED M ODELS FOR T EXT G ENERATION
A BSTRACT
Text generation is ubiquitous in many NLP tasks, from summarization, to dialogue and machine translation.
The dominant parametric approach is based on locally normalized models which predict one word at a time.
While these work remarkably well, they are plagued by exposure bias due to the greedy nature of the generation process.
In this work, we investigate un-normalized energy-based models (EBMs) which operate not at the token but at the sequence level.
In order to make training tractable, we ﬁrst work in the residual of a pretrained locally normalized language model and second we train using noise contrastive estimation.
Furthermore, since the EBM works at the sequence level, we can leverage pretrained bi-directional contextual representations, such as BERT and RoBERTa.
Our experiments on two large language modeling datasets show that residual EBMs yield lower perplexity compared to locally normalized baselines.
Moreover, generation via importance sampling is very efﬁcient and of higher quality than the baseline models according to human evaluation
I NTRODUCTION
The dominant approach to parametric text generation is based on large neural auto-regressive models (Radford et al., 2019).
These models can be trained efﬁciently via maximum likelihood and they can efﬁciently generate samples of remarkable quality.
Key to their success is local normalization , i.e. they are deﬁned in terms of a product of conditional distributions, one for each token in the sequence.
Such distributions are relatively cheap to compute with modern hardware given the limited vocabulary size of common sub-word units like BPE (Sennrich et al., 2015).
Unfortunately, local normalization also brings some drawbacks.
First, the designer of the model needs to specify the order in which tokens are generated.
Second, at training time the model is conditioned on ground truth context while at test time it is conditioned on its own generations, a discrepancy referred to as exposure bias (Ranzato et al., 2016).
Finally, while heuristics like beam search somewhat help rescore at the sequence level, generation generally lacks long-range coherency because it is produced by the greedy selection of one token at a time without lookahead.
Energy-based models (EBMs) (Hinton, 2002; LeCun et al., 2006; Ranzato et al., 2007) are a more general framework which potentially address all these issues, as they do not require any local normalization.
They only require the deﬁnition of an energy function deﬁned over the whole input sequence.
Training aims at shaping the energy function such that regions of high density of training data points have lower energy than elsewhere.
In principle, EBMs are ideal for modeling text as they can score the whole input at once, they are not prone to label bias (Bottou, 1991) and they may enable generation of large chunks of text, which should help improve coherency.
However, so far EBMs had limited application in text generation, because sampling from the model is intractable, and so is maximum likelihood training.
The problem is that shaping the energy function is accomplished by updating the model parameters such that the energy is decreased at the training data points (
a.k.a.
positive examples) and increased at other data points (a.k.a.
negative examples).
In maximum likelihood training negatives are generated from the model, but in text application we cannot use gradient-based MCMC methods (Teh et al., 2003; Du & Mordatch, 2019; Xie et al., 2016; 2017; 2019; 2018; Gao et al., 2018; Nijkamp et al., 2019) and Gibbs sampling (Welling et al., 2005) is too slow to be practical.
Generating negatives by local perturbations of the ground truth would be efﬁcient but hardly useful for generation purposes, when at test time the model needs to generate from scratch.
Recently, Bakhtin et al.
(2019) carefully studied the problem of training a discriminator to distinguish human written text from language model generations.
They experimented with different language model and discriminator architectures, training/test time corpora and concluded that the discriminator can generalize rather well to weaker language models when the training/test corpora match.
Bakhtin et al.
(2019) found that the learned discriminator is not robust to random perturbations, and argued that the discriminator operates in the “residual” space of the language model.
Concurrently, Grover et al.
(2019) proposed a general approach to “de-bias” a generator, by simply training a discriminator and using its output for importance sampling.
In this work, we build upon these two works.
First, we formalize the residual interpretation by Bakhtin et al.
and use a generative model of the form:
[Equation]
where P LM ( x ) is a locally normalized language model which is ﬁxed during training, and E θ is the energy function parameterized by θ .
The resulting model P θ ( x ) is globally normalized due to the energy term.
Note that the same residual formulation was also used in Rosenfeld et al.
; Wang & Ou (2018b); Parshakova et al.
This formulation has multi-fold beneﬁts.
First, by incorporating a locally normalized language model, we can leverage recent advancements in locally normalized language modeling.
Second, the language model provides a natural proposal distribution for training (Bakhtin et al., 2019), and training can be made efﬁcient by using the conditional noise contrastive estimation objective (Gutmann & Hyv ¨ arinen, 2010) as we shall see in § 3.
Lastly, this formulation enables efﬁcient evaluation and generation via importance sampling (Horvitz & Thompson, 1952; Grover et al., 2019).
In some sense, this last point is perhaps the central contribution of the paper, as it allows estimating perplexity of the residual EBM, and thus allows these EBMs to be compared in a standard way to other models.
Indeed, in § 4 we show that our joint model decreases perplexity on two large datasets, when compared to various auto-regressive language model baselines.
Finally, the EBM generations are signiﬁcantly preferred by humans according to our qualitative evaluation.
To the best of our knowledge, this is the ﬁrst time that an EBM has demonstrated improved generation ability against very strong auto-regressive baselines, both in terms of estimated perplexity and through human evaluation.
R ELATED W ORK
Energy-based models have a long history in machine learning (Hopﬁeld, 1982; Hinton, 2002; LeCun et al., 2006; Ranzato et al., 2007).
The key challenge of training is mining for good negatives.
This can be accomplished explicitly by fantasizing inputs where the energy should be increased or implicitly via global constraints such as sparsity (Ranzato et al., 2007).
Methods attempting at maximizing the likelihood of the data require to sample from the distribution induced by the model.
Unfortunately, gradient-based MCMC approaches like Hybrid Monte Carlo (Teh et al., 2003) and
Langevyn dynamics (Ranzato et al., 2007; Du & Mordatch, 2019; Xie et al., 2016; 2017; 2019; 2018; Gao et al., 2018; Nijkamp et al., 2019) are not applicable when the input is discrete like in text applications.
Other approaches like Gibbs sampling (Hinton, 2002) were applied to binary inputs but do not scale well to large dictionaries once the energy function is a large bidirectional transformer model like the one used in this work.
Several variants of auto-encoders have also been investigated for representing and generating text (Bowman et al., 2016; Zhao et al., 2018), but they have not shown signiﬁcant improvements in terms of perplexity and they have so far been applied to relatively small datasets only.
Our approach appears similar to discriminative reranking approaches used in the parsing and machine translation community (Shen et al., 2004).
However, our approach provides a generative model, and parameters/hyper-parameters are directly tuned to close the gap between the model distribution and the data distribution, rather than relying on surrogate ranking losses.
This approach is also related to other sequence level training objectives (Edunov et al., 2018), with the major differ- ence that in those works training aims at improving the baseline model, but generation at test time is still greedy.
Energy Networks have been used for sequence modeling (Rosenfeld et al., 2001;
Wang et al., 2015; 2017; Wang & Ou, 2017; 2018a; Parshakova et al., 2019).
In particular, our residual modeling form and the training algorithm is the same as in Wang & Ou (2018b), where they used an LSTM as the generator and a CNN-LSTM as the energy function, and showed signiﬁcant gains compared to LSTM baselines in speech recognition.
Our work builds on these prior works and develops new lower and upper bounds for the log-probability under the joint model, which makes it possible to show that the residual EBM approach gets better perplexity.
We also develop an importance weighting sampling scheme used at generation time, which is focused on conditional generation as opposed to rescoring in speech recognition (Wang & Ou, 2018b).
The residual EBM formalism makes it very natural to use BERT for language modeling, and we show that empirically this type of approach can outperform modern state-of-the-art language modeling baselines, both in terms of perplexity, and through human evaluation.
Generative Adversarial Networks (Goodfellow et al., 2014) also relate to EBMs, except that in
EBMs the generator is implicit and negatives samples are produced by the discriminator itself.
In our work, the pretrained locally normalized language model can be seen as a ﬁxed generator, like in
Bakhtin et al.
Azadi et al.
(2018) also share our same goal but their generator is not locally normalized and they propose to improve the sampling from the generator by using the discriminator for rejection sampling.
Similar to our work, Grover et al.
(2019) propose to use the discriminator to de-bias the pretrained generator using importance sampling.
We adapt this work to the application of text generation.
In particular, we adopt the conditional noise contrastive estimation (NCE) objective (Ma & Collins, 2018; Gutmann & Hyv¨arinen, 2010) to our residual model energy function and then sample from the joint model using importance sampling.
We want to note that the same formulation has been proposed in (Wang & Ou, 2018b; Parshakova et al., 2019).
While Ma & Collins (2018) used conditional NCE to predict the next word in a sequence, we apply it to produce a whole sequence at once with the pretrained auto-regressive language model as the noise distribution.
R ESIDUAL E NERGY -B ASED M ODELS
We study the problem of conditional generation of discrete sequences.
Given a preﬁx x 1 , · · · , x p with x j ∈ V where V is the vocabulary, we want to model the probabilities of generating a sequence of total length T > p 1 .
The generative model is:
[Equation]
where Z θ ( x 1 , · · · , x p ) is a normalizing factor known as partition function.
Computing the partition function is intractable in our case since it involves a sum over | V | T − p terms which grow exponentially with the sequence length: in our experiments the size of the vocabulary is 50,096 and the length of the generation is 40 tokens.
We call P θ the joint model, and E θ the residual energy function since P LM is ﬁxed throughout training.
The goal of training is to learn the parameters of the energy function such that the joint model distribution gets close to the data distribution.
For the sake of reducing clutter in the notation, we will drop the conditioning variables in the following discussion.
3. T RAINING
When the partition function is intractable, Maximum Likelihood Estimation (MLE) requires samples from the model distribution, which is usually approximated with Monte Carlo sampling or mean ﬁeld inference (Hinton, 2012; LeCun et al., 2006) for globally normalized models.
Unfortunately, both approaches are too expensive for text applications when using large bidirectional transformer models.
For instance, if we were to employ Gibbs sampling exactly, we would need to perform at every position as many forward passes as words in the dictionary to compute each conditional distribution.
On large datasets where training locally normalized models on multiple machines already takes days, having such additional overhead means that the model would learn from much less data for the same amount of time, and this is seldom a beneﬁcial strategy for learning models that generalize well.
Therefore, we do not use either MCMC nor mean ﬁeld methods, as the latter would introduce additional variational parameters or an inference network which anyway yields an approximation to MLE learning.
Instead, we train our residual energy function using Noise Contrastive Estimation (NCE) (Gutmann & Hyv¨arinen, 2010), and more speciﬁcally its conditional version (Ma & Collins, 2018).
NCE requires two distributions: The model distribution and a noise distribution.
In our case, the model distribution is the joint model of Eq.
2, P θ , while the noise distribution is the pretrained language model, P LM .
NCE then trains a binary classiﬁer on the difference of log-probability scores of these two models.
Since our joint model is the product of the energy function (whose parameters we want to learn) with P LM , the difference reduces to: log P θ − log P LM = − E θ .
Therefore, under these modeling assumptions of residual learning and noise model, the objective function becomes:
[Equation]
where x + is a positive sequence taken from the human generated training set, and x − is a negative sequence drawn from P LM (for a given ground truth preﬁx).
In other words, training the energy function reduces to training a binary classiﬁer to discriminate between real text and text generated by an auto-regressive language model.
The aim of training is to assign as negative energy as possible to real data, and as positive energy as possible to machine generated data.
Interestingly, the role of positive and negative samples is totally symmetric in this loss function, § 5 will discuss the consequences of this.
With the theoretical guarantee of NCE, we can show that the optimum of the above objective is reached at data distribution with inﬁnite amount of data and model with enough capacity, which is also proved in Ma & Collins (2018) 2 .
Theorem 1.
If P LM has the same support as P data , then the objective function in Eq.
3 reaches its maximum at log P LM ( x ) − E θ ( x ) = log P data , if there exists such θ .
Proof.
This theorem directly follows from the proof in Gutmann & Hyv ¨ arinen (2010).
Note that at optimum, P LM ( x ) exp( − E θ ( x )) is self-normalizing: instead of P θ ( x ) ∝ P LM ( x ) exp( − E θ ( x )) , we have P θ ( x )
=
P LM ( x ) exp( − E θ ( x )) .
However, we still need to estimate the partition function throughout the rest of this paper, since we cannot guarantee that this optimum can be reached.
3. E VALUATION
A commonly used protocol for evaluating generative sequence models, especially language models, is perplexity (PPL), which is equal to 2 − 1 T − p (cid:80)
Ti = p +1 log 2 P ( x i | x
i − 1 , ··· ,x 1 ) .
PPL can be interpreted as the average number of tokens the model is uncertain of at every time step.
Since the log-likelihood required by PPL relies on estimating the partition function Z θ = (cid:80) x P LM ( x ) exp( − E θ ( x )) =
E x ∼ P LM exp( − E θ ( x )) , we derive two estimators for the log-partition function log Z θ based on the work of Nowozin (2018).
Theorem 2.
Denote T n as the empirical estimate of log E x ∼ P LM exp( − E ( x )) with n samples x i ∼
P LM ( i = 1 , · · · , n ) : T n = log 1 n (cid:80) ni =1 exp( − E ( x i )) , then ∀ (cid:15) > 0 , ∃ N > 0 such that ∀ n > N we have
[Equation]
The proof is given in Appendix A.2.
We can use the above two estimators to estimate the lower and upper bounds of the partition function, but we want to emphasize that they are true only asymptotically (when n is sufﬁciently large).
We also want to note that to get lower variance estimates we use leave-one-out strategy to estimate T n − 1 .
See Nowozin (2018) for implementation details and methods to improve numeric stability.
Similarly to locally normalized models, we can also factorize the probabilities of an entire sequence step by step, as P ( x ) = (cid:81)
Tt =1 P ( x t | x <t ) , and evaluate the PPL for each generation step.
By
Input: number of samples n drawn from P LM , value of k in top-k // Get set samples from P sample n samples { x 1 , · · · , x n } from P LM with top-k sampling calculate energies s i =
E θ ( x i ) for each x i ∈ { x 1 , · · · , x n } // Resample from the set of LM samples sample x
= x i with probability
[Equation]
return x marginalizing over the future, we can derive the following per step probabilities:
[Equation]
The step-wise probabilities in Eq.
5 are an instance of importance sampling (Horvitz & Thompson, 1952).
The basic P LM distribution is adjusted by the probability assigned to token x t by the energy function (numerator is clamped at x t while denominator sums over all the possible values of the token at position t), with the additional marginalization over all subsequent tokens up to the horizon
T .
Since the summation involves exponentially many terms, unless t = T , this is approximated by samples drawn by P LM .
Since the log of both the numerator and the denominator take the same form as log partition function, we also use Eq.
4 to estimate the upper and lower bounds.
E.g., the lower bound of log P ( x t | x <t ) can be obtained by using the lower bound of the numerator and the upper bound of the denominator.
For t = T , we can calculate the log probability by exhaustive enumeration.
This gives us an idea of the true performance of our model at the last step, and it also provides a sanity-check of the tightness of our estimators.
3. G ENERATION
Generating from the joint model is a non-trivial task.
A naive way is to generate from the joint model auto-regressively, by marginalizing the future as in Eq.
5, which we term Top-k auto-regressive sampling .
However, doing so is expensive and impractical, and we only use this method for a qualitative analysis of the joint model in Appendix A.1.
In order to generate efﬁciently, we use self-normalizing importance sampling (Owen, 2013; Grover et al., 2019).
Under the assumptions that the model from which we wish to draw samples is the joint model, which is the product of the auto-regressive model and the energy function, and that the proposal distribution is the auto-regressive model itself, sampling proceeds simply by: a) sampling from the auto-regressive language model, followed by b) resampling according to the energy function.
The algorithm is shown in Algorithm 1, where we introduce an optional top-k constraint on the pretrained language model to improve the quality of samples in the set 3 .
Without the top-k constraint, as the number of samples goes to inﬁnity, we would recover exact samples from the joint model distribution.
E XPERIMENTS
In this section, we describe the experimental set up and the results we obtained by using the residual
EBM for text generation, both in terms of perplexity and generation quality.
4. E XPERIMENTAL S ETUP
Datasets We consider two datasets: the Toronto Book Corpus (Zhu et al., 2015; Kiros et al., 2015) and CC-News (Bakhtin et al., 2019).
The former dataset consists of ﬁction books in 16 different 3 Adapting to other types of local constraints such as nucleus sampling (Holtzman et al., 2019) is straightforward. genres, totaling about half a billion words.
The latter is a de-duplicated subset of the English portion of the CommonCrawl news dataset (Nagel, 2016), which totals around 16 Billion words.
The book corpus is more challenging because the range of style and topics is more diverse than CC-News.
Also, the book corpus is 30 times smaller than CC-News and may pose generalization challenges because of its smaller size.
In all our experiments we use a preﬁx of size 120 tokens and we generate the following 40 tokens; with the notation of Eq. 2, p = 120 and T = 160 .
For training the joint models, for efﬁciency we generated 16/128 samples per preﬁx for CC-News/Book Corpus ofﬂine, and sample uniformly from those samples at training time.
Baselines We consider as base language model (B ASE LM) used to generate negatives for the residual EBM, a transformer language model with 12 layers, h = 16 , d model = 1024 , d ff =(we refer to Vaswani et al.
(2017) for notations).
This is also our ﬁrst baseline model.
The joint model has as many parameters as the sum of the number of parameters in the base LM and the number of parameters in the energy network.
To make a fair comparison, we consider two additional baselines that have the same number of parameters as our joint model.
The ﬁrst baseline is a Residual Auto-regressive Language Model baseline (RALM):
[Equation]
where P φ takes the form of another auto-regressive language model.
The parameters of P φ are trained by exact maximum likelihood training of P RALM .
The second baseline is an auto-regressive language model of the same size of our joint model (sum of the base LM and energy function parameters), we dub this model Big Auto-regressive Language
Model (BALM).
BALM has 12 layers, h = 16 , d model = 1568 , d ff = 6272 , and is trained by standard token level cross-entropy loss.
Residual EBM Architecture We consider two architectures for our residual EBM, both of them are based on transformers (Vaswani et al., 2017; Devlin et al., 2018).
The ﬁrst version uses causal self-attention and is derived from the base LM, a unidirectional transformer (U NI T).
It is of the same architecture as B ASE LM, except that in the ﬁnal layer we project the mean-pooled hidden states to a scalar energy value.
We initialize its parameters with a language model trained on the same dataset.
The second version is instead bi-directional (B I T), and the energy function is computed by projecting the mean-pooled top hidden states down to a single scalar value.
We consider three variants, a
B I T-B ASE following the architecture of RoBERTa-Base, and a B I T-L ARGE ∗ following RoBERTaLarge (Liu et al., 2019), and a B I T-M ED with the same number of parameters as U NI T (such that
J OINT B I T-M ED has roughly the same number of parameters as BALM).
We initialize the parameters with a trained BERT, and we use ∗ to mark usage of external data (Liu et al., 2019), otherwise it means that BERT was trained on our training set.
Notice how our model can be interpreted as a natural way to ﬁnetune large bidirectional pretrained models for the text generation task.
While we expect B I T to yield better results because it can fully leverage context also for intermediate tokens, we also consider U NI T to compare to the RALM baseline, which uses the same architecture and only differs in the way parameters are trained and in the presence of local normalization.
We train our models on 8 DGX nodes, each with 8 Nvidia V100s.
We use the Adam optimizer, with cosine learning rate decay and learning rate warmup.
To stabilize training we used gradient norm clipping.
Detailed hyper-parameter settings can be found in Appendix A.3.
For generation, we use top-k sampling with k = 10 for all human evaluations.
We take 10, samples from B ASE LM for our joint sampling.
4. R ESULTS
Automatic Evaluation Our main result is reported in Table 1 where we compare models in terms of their perplexity.
We can see that on both datasets, residual EBMs with causal attention JOINT
U NI T RANSF outperforms the baseline RALM with approximately the same number of parameters.
The non-residual baseline BALM performs similarly to JOINT U NI T RANSF , which might [Table] be due to the limitation that P LM is not trained jointly with the residual model in both JOINT
U NI T RANSF and RALM.
However, by using our EBM approach, we can remove the causal attention mask and use bi-directional models, which achieves better performance than baselines and
JOINT U NI T RANSF : without external data, JOINT B I T RANSF -B ASE reaches a higher performance than JOINT U NI T RANSF with fewer parameters.
By initializing from the state-of-the-art pretrained bi-directional transformers RoBERTa-Base and RoBERTa-Large, JOINT B
I T RANSF -B ASE * and
J OINT B I T RANSF -L ARGE * reach even better performance than JOINT B I T RANSF -B ASE .
In the lower part of the table we show that if we make the big language model baseline BALM deeper (BALM-24L) (24 layers instead of 12, for the same number of parameters) we attain lower perplexity.
However, training the joint model J OINT B I T-B ASE on the residual of a deeper language model BASE LM-24L yields even lower perplexity, despite having fewer parameters. By using the
[Table]
same number of parameters as BALM-24L, J OINT B IT -M ED further decreases perplexity.
Finally, by initializing from RoBERTa-Large, JOINT B I T RANSF -B ASE * obtains the best results.
One caveat of our evaluation protocol is that the perplexity bounds are only estimates, which might not reﬂect the true value, particularly since the number of possible sequences grows exponentially with the number of words that are generated.
We therefore break down perplexity per position in the generated sequences as in Eq. [Table] and compare the estimated PPLs to the true enumerated PPLs at the last position, as shown in Figure 1.
We ﬁnd that at the ﬁnal generation step, the estimated bounds agree remarkably well with the exact values, proving that our method at least gets a reasonable PPL estimate at the last generation step, and that J OINT B I T-M ED outperforms baselines at the last generation step for sure.
Human Evaluation Better perplexity results do not necessarily imply better generations.
Besides, since generation from the residual EBM requires approximations as in Algorithm 1, the limited sample size might induce approximation errors compared to truly sampling from the joint distribution.
Therefore, we conducted human evaluations to compare generations from the residual EBM model to generations from the baseline language models.
For each preﬁx, we present one completion from each model, and ask humans to select the one that is a better continuation.
More details about human evaluation can be found in the Appendix A.4.
The preference rates reported in Table 2 conﬁrm that indeed the generation quality of J OINT B IT -B ASE and J OINT B IT -L ARGE ∗ is better than both language model baselines.
Depending on the model variant, our joint model (with bidirectional EBM) is preferred between 56% and almost 60% of the times; interestingly, the preference rate does not change much as we compare against base LM as opposed to BALM.
In fact, humans do not seem to have a strong preference for BALM over base LM, despite the former scores two perplexity points lower.
Similarly, J OINT U NIT is not strongly preferred over B ASE LM despite its lower perplexity score.
We surmise that unidirectional scoring functions and auto-regressive models exhibit generation artifacts which are easily detected by humans, and these may overshadow the improvements brought by perplexity gains.
4. A NALYSES
In this section, we analyze some of the results we obtained.
First, we check whether we used a sufﬁcient number of samples in our perplexity estimates.
Second, we assess whether the joint model produces fewer repetitions compared to the base language model, and ﬁnally we check how well some statistics of the model and data distributions match.
Number of samples.
In Figure 2, we vary the number of samples we take in order to estimate PPL upper and lower bounds.
Beyond 20,000 samples the upper estimate becomes very stable, although we have to emphasize that these estimates might be biased even though the gap between lower and upper bound closes as we take more samples.
Repetitions.
A typical artifact of auto-regressive language models is their tendency to repeat phrases.
It is then interesting to check whether the joint model is able to alleviate this artifact.
Fig.
2 shows that indeed the joint model has a slightly higher percentage of unique n-grams compared to the baseline language model with n = 2 , 3 , 4 , although still not as high as the original human generated text.
A necessary condition for the model to match the data distribution.
If the joint model p θ matches the data distribution p d , then statistics computed on a large population of samples from the two distributions should also match.
In particular, Fig.
3 show the density plots of log-likelihood scores of the baseline language model (left) and joint model (right) when fed with their own samples versus samples from the test set.
We observe that the histogram of samples from the joint model matches the real data distribution more closely: The difference of means in the LM B ASE case is 21.64 whereas the difference is 6.20 in the joint approach.
L IMITATIONS
In the previous sections we highlighted the strengths of residual EBMs, namely their simplicity, efﬁciency both at training and test time, and their improved perplexity scores against strong autoregressive language model baselines.
In this section, we comment on their limitations to caution the reader about when these methods are more likely to succeed and to inform other researchers about what future avenues of research may naturally derive from this work.
In order to make training efﬁcient and side step costly negative mining using the energy function itself, the current approach uses negatives generated from a pretrained auto-regressive language model.
Therefore, our model works as long as the base language model from which we draw samples is strong enough, and as long as the ground truth and other plausible sequences are reachable by the baseline language model.
If the base language model has poor quality, then generation from our joint model is going to be poor as well, as the joint model merely resamples generations from the original language model.
Moreover, training is going to be trivial if the base language model is poor, because the residual energy function merely needs to detect trivial generation artifacts from the base language model.
In fact, observe that the role of positive and negative samples is symmetric in the loss of Eq. 3.
This means that the energy function can choose to minimize the loss by either modeling the true data or the negative samples; since the latter have much simpler structure, it is going to model the negative samples.
Therefore, importance sampling amounts to mostly down-weighing the worst samples from the base language model.
The consequence of this is that search with a poor base language model is going to be catastrophically inefﬁcient, as we would need to sample an impractically large number of negatives in order to ﬁnd samples that are reasonably close to the true data manifold.
To summarize, this work makes a rather strong implicit assumption on the quality of the base language model, and it is expected to work well only when this is rather strong.
In our application, this assumption is met quite well in practice as large auto-regressive language models trained on large datasets have improved signiﬁcantly in recent years (Radford et al., 2019).
In general however, residual learning always carries liability to its base model.
C ONCLUSIONS AND F UTURE WORK
We investigated an EBM trained on the residual of a pretrained autoregressive language model (Wang & Ou, 2018b; Parshakova et al., 2019).
The resulting joint model scores sequences holistically, thanks to the energy function.
Training is very efﬁcient and consists of a binary classiﬁcation task between positives from the training set and pregenerated negatives from the ﬁxed language model.
Generation is also very efﬁcient as it amounts to resampling from the large set of negatives produced by the base language model.
Our estimates show that the resulting model has lower perplexity than the base language model.
Finally, this approach may be interpreted as a natural way to ﬁnetune a large bidirectional transformer like BERT for text generation applications.
In the future we plan to investigate other ways to generate negatives that may strike a better tradeoff between the amount of compute each negative requires and their closeness to the joint model distribution.
It would also be interesting to explore other loss functions and the generation of longer pieces of text by using this model auto-regressively at the chunk level, as opposed to the token level
A A PPENDIX A. T OP - K AUTO - REGRESSIVE SAMPLING
In this subsection, we factorize the joint model B I T-B ASE auto-regressively, and compare its differences with B ASE LM.
Since even estimating the per step probabilities according to Eq.
5 is too expensive, we further approximate it by only considering the top 128 words predicted by B ASE LM, where we sample 10,000 completions for each of them to estimate P ( x t | x <t ) .
Then we take the top 10 entries and re-normalize, and compare it to the top 10 probabilities of B ASE LM.
Our initial explorations suggested that the joint model tends to generate fewer repetitions.
Therefore we picked a few LM samples where there are repetitions at x t , and use the same context x <t to estimate P ( x t | x <t ) for the joint model.
Some examples of P ( x t | x <t ) of B ASE LM and B I T-B ASE are presented in Table 3.
Indeed B ASE LM usually assigns lower probabilities to repetitions even though the top k words remain the same, which is not surprising given that the existence of repetition is a strong indicator of coming from the LM, which would lead to a higher energy value hence lower joint probability.
Context x [Table]
Model
[Table]
... is aimed at setting common benchmarks for orderly migration practices, thereby reducing irregular ﬂows.
The Global Compact contains ten guiding principles, including that migrants cannot be settled by countries with better integration policies and a fair and sustainable development. ”
For the ﬁrst time in our history, a legally binding and
B ASE LM binding 0.
legally 0.
internationally 0.
comprehensive 0.
transparent 0.
B I T-B ASE binding 0.
legally 0.
internationally 0.
comprehensive 0.
transparent 0.
... companies that land their ﬁrst-choice candidates 90-100% of the time, 24% of them have ”thoroughly deﬁned” their high performer attitudes.
By contrast, only 1% of companies that struggle to land their ﬁrst-choice candidates ”thoroughly deﬁned” their high performer attitudes.
So it seems pretty clear that companies that land their top-choice candidates are not always as willing and
B ASE LM able 0.
willing 0.
eager 0.
ready 0.
well 0.
B I T-B ASE able 0.
willing 0.
eager 0.
ready 0.
well 0.
... it reveals a key skill needed to lead the
Fed. ”
You need to know what you don’t know.
And you need to be willing to listen when you don’t know something,” said
Karen Dynan, who as an assistant
Treasury Secretary in Barack Obama’s second administration would regularly meet Fed governors.
¡EOS¿
New Delhi
Dec 5 The following are mergers under review by India’s ﬁnancial services and
B ASE LM
[Table]
[Table]
[Table]
technology
[Table]
IT
[Table]
banking
[Table]
ﬁnancial
[Table]
insurance
[Table]
technology
[Table]
IT
[Table]
[Equation]
Theorem 2.
Denote T n as the empirical estimate of log E x ∼ P LM exp( − E ( x )) with n samples x i ∼
P LM ( i = 1 , · · · , n ) , and let T n = log 1 n (cid:80) ni =1 exp( − E ( x i )) , then ∀ (cid:15) > 0 , ∃ N > 0 such that
∀ n > N we have
[Equation]
Proof.
From Nowozin (2018)
Eq.
35, we can write E [ T n ] as
[Equation]
Where µ = E [ T n ] , µ k = E [( T n − µ ) k ] .
Equivalently,
[Equation]
Therefore, lim n →∞ E
[ T n ] =
Z θ .
So ∀ (cid:15) > 0 , ∃ N 1 >
such that when n > N 1 , E
[ T n ] > Z θ − (cid:15) .
On the other hand, lim n →∞ n ( Z [Equation] E [ T n ]) =
lim n →∞[-µ 2 2 µ 
-]
[Equation] 2 2 µ 2 + [Equation] 1) =
[Equation]
µ 2 > 0 , so ∃ N 2 > 0 such that when n > N 2 we have Z θ > E
[ T n ] .
Up to this point, we have proved that Z θ − (cid:15) <
E [ T n ] < Z θ .
For the other half part of the proof, using Eq.
8 we have
[Equation]
where c is a constant.
Therefore, E [(2 n − 1) T n − 2( n − 1) T n − 1 ]
= (2 n − 1) E
[ T n ] − 2( n − 1) E
[ T n − 1 ] =
Z θ + µ 2 2 µ
[Equation]
+ o ( n − 1 ) .
Therefore lim n →∞ E [(2 n − 1) T n − 2( n − 1) T n − 1 ] =
Z θ , hence ∀ (cid:15) > 0 , ∃ N 3 > 0 such that ∀ n > N 3 E
[(2 n − 1) T n − 2( n − 1) T n − 1 ] <
Z θ + (cid:15) .
Furthermore, lim n →∞ n ( E [(2 n − 1) T n − 2( n − 1) T n − 1 ] − Z θ )
=
lim n →∞ µ 2 2 µ
+ o (1) > 0 , so ∃ N 4 > 0 such that when n > N
we have E [(2 n − 1) T n − 2( n − 1) T n − 1 >
Z θ .
Putting the above together, ∀ (cid:15) > 0 , let N = max { N 1 , N 2 , N 3 , N 4 } , then ∀ n > N ,
Z θ − (cid:15) <
E [ T n ] < Z θ < E [(2 n − 1) T n − 2( n − 1) T n − 1 ] <
Z θ + (cid:15)
A. O PTIMIZATION S ETTINGS
[Table]
[Table] [Table]
[Table]
[Table] [Table]
[Table]
JOINT U NI T + 2,
[Table]
JOINT B I T-B ASE2, 90, 0.
JOINT B I T-B ASE * - 2,
[Table]
JOINT B I T-L ARGE * + 2, 90, 0.
[Table]
-24L2,
[Table]
The optimization settings are presented in Table 4.
A. H UMAN E VALUATION
A screenshot of the human evaluation experiments can be found in Fig 4.
Every page asks forcomparisons, one of which we know what the ground truth answer is.
We subsampled 333 sentences from the test set of CC-News, and asked 3 Amazon Mechanical turkers to vote.
We consider one continuation better if it gets more votes.
To check the quality of the received ratings, we performed a qualiﬁcation task beforehand, where one of the continuations is real text, and we kept the top half performing turkers for further evaluation (corresponding to higher than 66.67% accuracy for discriminating real from LM samples – for a total of 26 qualiﬁed turkers).
Then in the actual experiment, we use one out of every four comparisons as an attention check and drop responses if the turker did not pass the check.
A. Q UALITATIVE ANALYSIS
We present generation examples when our approach B ASE LM outperforms baseline BALM in
Table 5, and when our approach underperforms in Table 6.
Here the judgment is based on human evaluation when all three turkers unanimously voted in favor of one model over the other.
Preﬁx
[Table]
Generation the timing of the donation couldn’t be better, and even went on to say that no one is more relevant than Chance right now.
Thank you to Doug and @jewelosco for donating $1,000, to The New Chance Arts & Literature
Fund, which will ensure more students have access to arts enrichment education!
#supportcps pic.twitter.com/MXZtpscU5b
SocialWorks(@SocialWorks Chi)
November 20, 2017 “In the past, CPS hasn’t really gotten a lot of money from non-proﬁts
B ASE
LM .
And the fact that the money is coming from the government, it makes a big difference,” he said.
“We’re not the biggest donor of arts education, so to
BALM , and it doesn’t even have the kind of resources or funding for the arts or literary programs that we need to do the things that people want to support,” said Chance.
B I TB ASE to fund programming.
So, I think that it’s a great time for us to do something to support that,” said Chance.
“We want to make sure that our programs
G OLD and charitable arms and organizations because there’s been a past of corrupt activity in the city of Chicago,” Chance said.
“And so, when it comes down to it, it quarter.
The penalties are still somewhat of a problem but tight ends
Travis Kelce and Demetrius Harris made some impressive grown-man football plays.
-It was nice to see running back Kareem Hunt get in the end zone for the ﬁrst time since Week 3.
He must feel good to end the drought.
-Kelce was visibly frustrated on the sidelines and rightfully so.
The ofﬁcials seem to be leaning toward
Oakland with calls today.
Still, Kelce should’ve caught that easy pass that he dropped.
-Quarterback
Alex Smith has delivered a couple of nice deep balls to
B ASE
LM get his hands on the ball this week.
He threw two touchdown passes on Thursday.
He should get another touchdown as the season goes on.
He’s got a good chance to be one of
BALM the Chiefs and the Chiefs defense has made them pay for it.
The offense has done a nice job with the ball, and they’s been a factor.
It’s nice to have
B I TB ASE help the Chiefs win this game.
His completion of a deep ball to wide receiver
Sammy Watkins is a nice sign.
-Jalen
Ramsey should be back in the lineup today.
The Jaguars are going
G OLD receivers Albert Wilson and Tyreek Hill.
The footwork by Wilson on the deep ball was amazing and Hill’s ball-tracking skills were on point as usual.
Good things happen when Smith trusts has an amazing ability to detoxify itself namely by the liver, kidneys, and skin,” she says.
Detox programs and diets do sometimes make people feel better, but that happens more often if you’re eating and/or drinking things that make feel like crap (something it doesn’t sound like Kardashian was doing in the ﬁrst place).
And if, somehow, you discover that you have elevated levels of mercury or lead in your body like Kardashian said she had, it’s important to ﬁgure out why,
Dr. Wider says.
“Finding the source is extremely important for any heavy metal, so you
B ASE
LM can’t say ’no or I’ve never seen something of that value, so I’ll try and ﬁnd it again and see what happens.”
So don’t be afraid to ﬁnd a way to detox or
BALM want to get the full picture and not just have to look at the whole picture,” she says.
“It can be a great idea to talk to your doctor to determine what’s causing your symptoms.”
B I TB ASE can’t say, ’Oh my God, it’s a lead, but I’m ﬁne.’
But it’s deﬁnitely a problem in our bodies,” she says.
“And if it’s a problem in
G OLD can lower your exposure over time,” she says.
Meaning, a detox diet probably isn’t going to help you as much as, say, reducing your intake of foods that are high in mercury (like
Preﬁx
[Table]
Generation but as the audio only came on halfway through the incident, it did not record his initial words to the girl or her response.
It was also dropped in the hallway during their interaction, so it did not record any of what happened once the two left the library.
Jones brought her outside to the library’s front steps, where he waited for responding ofﬁcers to arrive.
They did not call for an ambulance, according to the lawsuit.
Rather, when the ofﬁcers arrived, they told her to spit blood on the grass instead of the concrete, and to move from the steps to a bench.
Some 20 minutes
B ASE
LM later, she was dead, according to the lawsuit.
“It’s not uncommon for an ofﬁcer to spit blood on an unarmed, vulnerable adult.
The use of spit is illegal in a public place,”
BALM later, Jones was arrested for disorderly conduct and released after posting bond, the suit said.
She was arrested again on May 2.
In the suit, Jones is seeking more than $1 million.
A
B I TB ASE after the ofﬁcers’ arrival, Jones and the girl left the library and headed to the parking lot of a nearby apartment complex.
“This is the type of behavior that is most likely to cause harm to
G OLD later, J.G’s mother arrived and took her daughter to Cleveland Clinic in Lakewood, where she was treated for a dislocated jaw, a head injury, and an injury to her knee.
, Bronson said.
“The initiative provides a variety of supports to early childhood programs’ children, families and staff.
The resources provided through this partnership increase the quality of the participating programs, which beneﬁts the community and impacts our future in such a positive way,” Scott said.
Visit
PNCGrowUpGreat.com/donorschoose.
\ nHere are Varsity sports headlines for
April 13, 2018.
Refresh to get the latest as we add news throughout the night as we collect scores:
Best of the best in track and ﬁeld Our Sentinel coverage area top performers lists for girls track and ﬁeld
B ASE
LM at the Varsity Track & Field Invite.
\ nThe
U.S. Army Corps of Engineers has approved $2 billion in construction work along the U.S.-Mexico boundary as a way to
BALM .
Check back frequently for updates.
The
Sentinel also has a feature on the boys basketball and wrestling teams.
Boys golf
The Sentinel boys golf and wrestling teams have been one of those teams who has had some
B I TB ASE .
\ nA few weeks back, it’s been rumored that the HTC Desire was going to be the companys last ﬂagship phone, and now, a new leak has conﬁrmed that it
G OLD and boys track and ﬁeld are updated going into the Saturday district meets.
The season is heating up with more district and region races coming up next week.
Click these links for girls top performers and boys top leaders meeting November 17-18 in
Papua New Guinea as potential
Xi-Trump meet dates.
If all else fails,
Trump and Xi are also expected to meet for a bit at the G20 meeting at the end of November.
On the economic calendar next week, the update on jobs and the U.S. trade deﬁcit are the headliners on November 2.
Notable earnings reports: Akamai
Technologies (NASDAQ:AKAM),
Mondelez International (NASDAQ:MDLZ) and Olin Corp.
(NYSE:OLN) on October 29; Under
Armour (NYSE:
B ASE
LM
UAA), General Motors (NYSE:GM) on
November 4; and Procter & Gamble (NYSE:PG) for October.
On the retail front, Lowe’s Companies (NYSE:L
BALM
UA) on October 30; CVS Health (NASDAQ:CVS) on November 27; Intel Corporation (NASDAQ:INTC) on October 28; and Verizon Communications (NYSE:V
B I TB ASE
UAA), Johnson Controls (NYSE:JCI) and Cisco Systems (NASDAQ:CSCO) on
November 6.
\ nA woman who had to have her nose and mouth taped as punishment
G OLD
UAA), eBay (NASDAQ:EBAY), General
Electric (NYSE:GE),
Coca-Cola (NYSE:KO), Pﬁzer (NYSE:PFE) and
Electronic Arts (NAS