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.
--------
Question: Recurrent Neural Networks architectures excel at processing sequences by
 modelling dependencies over different timescales. The recently introduced
 Recurrent Weighted Average (RWA) unit captures long term dependencies
 far better than an LSTM on several challenging tasks. The RWA achieves
 this by applying attention to each input and computing a weighted average
 over the full history of its computations. Unfortunately, the RWA cannot
 change the attention it has assigned to previous timesteps, and so struggles
 with carrying out consecutive tasks or tasks with changing requirements.
 We present the Recurrent Discounted Attention (RDA) unit that builds on
 the RWA by additionally allowing the discounting of the past.
 We empirically compare our model to RWA, LSTM and GRU units on
 several challenging tasks. On tasks with a single output the RWA, RDA and
 GRU units learn much quicker than the LSTM and with better performance.
 On the multiple sequence copy task our RDA unit learns the task three
 times as quickly as the LSTM or GRU units while the RWA fails to learn at
 all. On the Wikipedia character prediction task the LSTM performs best
 but it followed closely by our RDA unit. Overall our RDA unit performs
 well and is sample efficient on a large variety of sequence tasks.

Answer: We introduce the Recurrent Discounted Unit which applies attention to any length sequence in linear time


Question: Effective training of neural networks requires much data. In the low-data regime,
 parameters are underdetermined, and learnt networks generalise poorly. Data
 Augmentation (Krizhevsky et al., 2012) alleviates this by using existing data
 more effectively. However standard data augmentation produces only limited
 plausible alternative data. Given there is potential to generate a much broader set
 of augmentations, we design and train a generative model to do data augmentation.
 The model, based on image conditional Generative Adversarial Networks, takes
 data from a source domain and learns to take any data item and generalise it
 to generate other within-class data items. As this generative process does not
 depend on the classes themselves, it can be applied to novel unseen classes of data.
 We show that a Data Augmentation Generative Adversarial Network (DAGAN)
 augments standard vanilla classifiers well. We also show a DAGAN can enhance
 few-shot learning systems such as Matching Networks. We demonstrate these
 approaches on Omniglot, on EMNIST having learnt the DAGAN on Omniglot, and
 VGG-Face data. In our experiments we can see over 13% increase in accuracy in
 the low-data regime experiments in Omniglot (from 69% to 82%), EMNIST (73.9%
 to 76%) and VGG-Face (4.5% to 12%); in Matching Networks for Omniglot we
 observe an increase of 0.5% (from 96.9% to 97.4%) and an increase of 1.8% in
 EMNIST (from 59.5% to 61.3%).

Answer: Conditional GANs trained to generate data augmented samples of their conditional inputs used to enhance vanilla classification and one shot learning systems such as matching networks and pixel distance


Question: Current literature in machine learning holds that unaligned, self-interested agents do not learn to use an emergent communication channel. We introduce a new sender-receiver game to study emergent communication for this spectrum of partially-competitive scenarios and put special care into evaluation. We find that communication can indeed emerge in partially-competitive scenarios, and we discover three things that are tied to improving it. First, that selfish communication is proportional to cooperation, and it naturally occurs for situations that are more cooperative than competitive. Second, that stability and performance are improved by using LOLA (Foerster et al, 2018), especially in more competitive scenarios. And third, that discrete protocols lend themselves better to learning cooperative communication than continuous ones.

Answer:
We manage to emerge communication with selfish agents, contrary to the current view in ML