In this task, you are given the abstract of a research paper. Your task is to generate a summary of this abstract. Your summary should not be very short, but it's better if it's not more than 30 words.

[EX Q]: We present a novel approach for training neural abstract architectures which in- corporates (partial) supervision over the machine’s interpretable components. To cleanly capture the set of neural architectures to which our method applies, we introduce the concept of a differential neural computational machine (∂NCM) and show that several existing architectures (e.g., NTMs, NRAMs) can be instantiated as a ∂NCM and can thus benefit from any amount of additional supervision over their interpretable components. Based on our method, we performed a detailed experimental evaluation with both, the NTM and NRAM architectures, and showed that the approach leads to significantly better convergence and generalization capabilities of the learning phase than when training using only input-output examples.

[EX A]: We increase the amount of trace supervision possible to utilize when training fully differentiable neural machine architectures.

[EX Q]: Energy  based  models  outputs  unmormalized  log-probability  values  given  datasamples.   Such a estimation is essential in a variety of application problems suchas sample generation, denoising, sample restoration, outlier detection, Bayesianreasoning, and many more.   However, standard maximum likelihood training iscomputationally expensive due to the requirement of sampling model distribution. Score matching potentially alleviates this problem, and denoising score matching(Vincent, 2011) is a particular convenient version.   However,  previous attemptsfailed to produce models capable of high quality sample synthesis.   We believethat  it  is  because  they  only  performed  denoising  score  matching  over  a  singlenoise scale. To overcome this limitation, here we instead learn an energy functionusing all noise scales.    When sampled using Annealed Langevin dynamics andsingle step denoising jump, our model produced high-quality samples comparableto state-of-the-art techniques such as GANs, in addition to assigning likelihood totest data comparable to previous likelihood models.   Our model set a new sam-ple quality baseline in likelihood-based models.   We further demonstrate that our model learns sample distribution and generalize well on an image inpainting tasks.
[EX A]: Learned energy based model with score matching

[EX Q]: The maximum mean discrepancy (MMD) between two probability measures P
 and Q is a metric that is zero if and only if all moments of the two measures
 are equal, making it an appealing statistic for two-sample tests. Given i.i.d. samples
 from P and Q, Gretton et al. (2012) show that we can construct an unbiased
 estimator for the square of the MMD between the two distributions. If P is a
 distribution of interest and Q is the distribution implied by a generative neural
 network with stochastic inputs, we can use this estimator to train our neural network.
 However, in practice we do not always have i.i.d. samples from our target
 of interest. Data sets often exhibit biases—for example, under-representation of
 certain demographics—and if we ignore this fact our machine learning algorithms
 will propagate these biases. Alternatively, it may be useful to assume our data has
 been gathered via a biased sample selection mechanism in order to manipulate
 properties of the estimating distribution Q.
 In this paper, we construct an estimator for the MMD between P and Q when we
 only have access to P via some biased sample selection mechanism, and suggest
 methods for estimating this sample selection mechanism when it is not already
 known. We show that this estimator can be used to train generative neural networks
 on a biased data sample, to give a simulator that reverses the effect of that
 bias.
[EX A]:
We propose an estimator for the maximum mean discrepancy, appropriate when a target distribution is only accessible via a biased sample selection procedure, and show that it can be used in a generative network to correct for this bias.