<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>RRAML: Reinforced Retrieval Augmented Machine</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andrea Bacciu</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Florin Cuconasu</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Federico Siciliano</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabrizio Silvestri</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicola Tonellotto</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giovanni Trappolini</string-name>
          <email>trappolini@diag.uniroma1.it</email>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Deep Learning, Information Retrieval, Large Language Models</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>The emergence of large language models (LLMs) has revolutionized machine learning and related fields, showcasing remarkable abilities in comprehending, generating, and manipulating human language. However, their conventional usage through API-based text prompt submissions imposes certain limitations in terms of context constraints and external source availability. LLMs sufer from the problem of hallucinating text, and in the last year, several approaches have been devised to overcome this issue: adding an external Knowledge Base or an external memory consisting of embeddings stored and retrieved by vector databases. In all the current approaches, though, the main issues are: (i) they need to access an embedding model and then adapt it to the task they have to solve; (ii) in case they have to optimize the embedding model, they need to have access to the parameters of the LLM, which in many cases are “black boxes”. To address these challenges, we propose a novel framework called Reinforced Retrieval Augmented Machine Learning (RRAML). RRAML integrates the reasoning capabilities of LLMs with supporting information retrieved by a purpose-built retriever from a vast user-provided database. By leveraging recent advancements in reinforcement learning, our method efectively addresses several critical challenges. Firstly, it circumvents the need for accessing LLM gradients. Secondly, our method alleviates the burden of retraining LLMs for specific tasks, as it is often impractical or impossible due to restricted access to the model and the computational intensity involved. Additionally, we seamlessly link the retriever's task with the reasoner, mitigating hallucinations and reducing irrelevant and potentially damaging retrieved documents. We believe that the research agenda outlined in this paper has the potential to profoundly impact the field of AI, democratizing access to and utilization of LLMs for a wide range of entities.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The advent of Large Language Models (LLMs) has brought about a paradigm shift in machine
learning and its related disciplines. LLMs [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1, 2, 3, 4, 5</xref>
        ] have exhibited unprecedented capabilities
in understanding, generating, and manipulating the human language. Famously, ChatGPT
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] has entered the public space by reaching one million users in a matter of days. The way
these models are used is through API that only allows submitting a textual prompt and getting
back from the server the generated text. However, this causes an immediate limitation: all
information must be passed through this context, and we know transformer-based models do
not scale nicely. Even if they did, API costs are charged on the basis of their usage. Therefore,
using long contexts would be expensive. Even if one had the resources to run their own LLM,
the costs of training and of the hardware infrastructure, and the environmental impact should
be considered. There is an impendent need, though, to accommodate the enormous power of
those models to specific user needs by making sure that they could use the reasoning capabilities
of LLMs, through in-context learning [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] on their data.
      </p>
      <p>
        A solution is to adopt a retrieval-augmented approach [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]. In this setting, a retriever is used
to filter out relevant information to be passed as context to the reasoner. This generates a new
problem, however, namely that the retriever and the reasoner are not aligned [
        <xref ref-type="bibr" rid="ref10 ref8 ref9">8, 9, 10</xref>
        ]. In
particular, the retriever might not be trained on the task of interest to the user. Moreover, the
retriever might actually provide “dangerous” pieces of information to the reasoner, as proved in
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], leading to poor results and, more importantly, to hallucinations.
      </p>
      <p>
        Ideally, one would have to fine-tune these models to account for these issues. Within this
setting, fine-tuning the model for a given task is technically impossible. We asked ourselves: “ Is
it still possible to use the API that gatekeeps those powerful LLMs on our data without the need for
ifne-tuning? ” We show that this question has a positive answer and in this paper, we propose a
novel framework, Reinforced Retrieval Augmented Machine Learning (RRAML), in which we
combine the reasoning capabilities of large foundational models enhanced by the provision of
supporting relevant information provided by a retriever that searches them in a large database.
In this setting, an eficient retriever model is tasked to search for relevant information in an
arbitrarily large database of data provided by users. Once this set of relevant data has been
retrieved, it is forwarded to the reasoner (a large foundational model such as ChatGPT, for
instance) through its API to “reason” on the input and produce an adequate result. In particular,
we plan to overcome current limitations, namely that the retriever’s task is detached from that
of the reasoner, reducing in such a way the tendency of LLM to hallucinate and diminishing
the number of damaging documents (as defined in [
        <xref ref-type="bibr" rid="ref12 ref13 ref8">12, 13, 8</xref>
        ]) returned by the retriever. The
approach we devise in this research work exploits recent advances in reinforcement learning.
Recently, in fact, reinforcement learning techniques like PPO [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] have been used to improve
large foundational models with human feedback where the loss is non-diferentiable. We
propose to link the training phase of the retriever to the final task outcome by the use of a
purposefully crafted reward model that depends either on human feedback or on the specific
characteristics of the task data. The RL technique also ofers the advantage of not requiring
ifne-tuning an LLM as a reasoner, which can be considered a black box in this setting, and
exchanged freely.
      </p>
      <p>Finally, we argue that the research agenda we lay out in this paper has the potential to hugely
impact the field of AI and democratize the access and use of these large foundational models to
a large set of entities.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>The system takes as input a task description, a query, and a database and gives as output the
response generated by a reasoner. The overall system architecture, shown in Figure 1, consists
of three main components: a Generative Language Model, a Retriever, and a Reasoner (typically
an LLM).</p>
      <p>Task
Description</p>
      <p>Query
Database</p>
      <p>Generative</p>
      <p>Model
Retriever</p>
      <p>Trained</p>
      <p>Frozen</p>
      <p>Reinforcement Learning
Input</p>
      <p>Prompt
Support Set</p>
      <p>Reasoner</p>
      <p>(LLM)
Don't want /
can't fine-tune
Reinforcement Learning</p>
      <p>Human
Feedback
Expected
Output
Output</p>
      <p>Reward / Loss</p>
      <p>More in detail, the Generative Language Model takes the task description and query as input
and generates a prompt. The Retriever takes the query and the database as input and outputs a
support set, which is then concatenated with the query and passed to the Reasoner.
2.1. Data
The data is a critical component of the framework: the task description guides the generation of
an appropriate prompt, the query represents the user request, and the database provides the
data needed by the reasoner to perform the task.</p>
      <p>Task Description The task description is a string that defines the nature of the task, possibly
with expected results, that the user wants to perform. For example, if the user wants to
generate a summarization of multiple news articles, a possible task description could be “News
Summarization”. If the user wants to perform question answering on a vast document collection,
the task description could be “Question Answering”.</p>
      <p>
        Query The query represents the user’s need. The Retriever will operate on the database w.r.t
to the user’s query, and the resulting data is input for the task. For example, if the user wants
to summarize a collection of news articles, the query could be the topic the user is interested in.
If the user wants to answer a specific query, this becomes the actual question.
Database The database is a collection of public or private data (or documents) that can be
queried to provide relevant information to satisfy the user’s information needs. The database
represents the knowledge needed by the Reasoner to perform the task. The data stored in
the database will depend on the specific task and may include text, images, audio, and other
data types (as in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]). For example, if the user wants to summarize multiple news articles,
the database could be an indexed collection of articles. If the user wants to perform Question
Answering, the database may consist of facts related to a particular topic (as in [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]).
      </p>
      <sec id="sec-2-1">
        <title>2.2. Models</title>
        <p>Generative Language Model The Generative Language Model component of the framework
is responsible for generating textual instructions based on the input Task Description and Query
that maximize the rewards w.r.t Reasoner. Specifically, it receives a string representing the task
to be performed (Task Description) and a query (Query) that represents the user’s request. The
Generative Language Model then generates a textual prompt that is relevant to the query and
the task by performing automatic prompt engineering.</p>
        <p>
          Retriever The Retriever component of the framework is responsible for retrieving relevant
data from the Database based on the user’s query. We refer to the Retriever outputs as support
set (as in [
          <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
          ]). A support set is a subset of the data from the Database that either directly
answers the given query or contributes to the final answer.
        </p>
        <p>Prompt Aggregator This component is responsible for processing the input required by
the Reasoner. In its simplest form, it just needs to concatenate the prompt generated by the
Generative Language Model with the Support Set provided by the Retriever. However, in a
more complex version, it may need to rework the prompt based on the number of support sets
received to ensure that the LLM can provide a coherent response. For example, if the Retriever
provides two support sets, the Prompt Aggregator may need to split the prompt into two parts
and concatenate each part with one of the support sets.</p>
        <p>Reasoner The Reasoner is responsible for generating the answer to the user’s query based
on the final prompt generated by the Prompt Aggregator. The Reasoner can be a pre-trained
model like GPT or a custom-trained model specific to the task at hand. The output of the LLM
is a textual response, which can be further parsed to comply with the intended output.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.3. Reinforcement Learning</title>
        <p>The Reinforcement Learning (RL) part of the framework is responsible for fine-tuning the
Generative Language Model (GLM) and Retriever based on the computed reward. The RL is
a crucial part of RRAML, it will be used to constantly improve the GLM and Retriever. As
mentioned earlier, the retriever will get a penalty if some of his recommendations will leads
the Reasoner to a hallucinate, for example by adding damaging documents. The RL allows
use to integrate and augment the signals in the training of these models, going beyond the
data present in their training set, ensuring that they are aligned with the environment (i.e., the
reasoner and the final task).</p>
        <p>
          Reward The reward function can be defined based on the similarity between the generated
output and the expected output and it can be estimated by training a Reward Model [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
RL algorithm The specific RL method which can be used is Deep Q-Networks (DQN) [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ],
which is a model-free RL algorithm that learns to maximize the cumulative reward over time.
DQN combines Q-Learning, which is a RL algorithm that learns the optimal action-value
function, with a Deep Neural Network to approximate the action-value function. In the proposed
framework, DQN is used to train the Generative Language Model and the Retriever to maximize
the reward obtained from user feedback. The update process is performed by backpropagating
the reward signal through the neural networks using Stochastic Gradient Descent (SGD). The
weights of the neural networks are updated in the direction that maximizes the expected reward,
using the Q-Learning update rule. The update is performed iteratively until convergence, which
is achieved when the expected reward stops improving.
        </p>
        <p>Human-in-the-loop Human preferences can be incorporated into our ML system by allowing
users to provide feedback on the system’s output. This feedback will be used to compute the
reward for the RL algorithm and will help improve the performance of the overall system
over time. We acknowledge that some tasks may not have a clear expected output or may
require additional context that is not available in the input data. In these cases, we will leverage
human-in-the-loop approaches to provide additional context and guidance to the system. For
example, crowd-sourcing platforms or internal subject matter experts can be used to provide
feedback on the system’s output and help train the model on more complex tasks.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Use Case Example</title>
      <p>RRAML promises to be efective in many applications. Consider a situation where a company
possesses a private database, which consists of factual information expressed in natural language,
and they need to apply reasoning to this data. The volume of their data may exceed the context
capacity of the LLM, and fine-tuning is not an option, for pricing/environmental impact or
because the LLM is served by other company APIs. To tackle this challenge, RRAML uses its
retriever to get only the relevant facts within the context, enabling the LLM to reason over
them.</p>
      <p>For instance, suppose a company has an employee list, projects that employees are currently
or were previously assigned to, and performance evaluation grids with text-based feedback
from superiors. The company might want to assign employees to a new project on a specific
topic. To do so, it is necessary to input the information contained in these data to the LLM.
However, due to capacity constraints, the entire data cannot fit within the context. Therefore,
the retriever has to return a subset of this information, perhaps excluding data on projects from
the distant past, employees who are already overburdened with multiple projects, or employees
who have never worked on a project related to the same topic.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Related Work</title>
      <p>
        Recent years have seen the emergence of large language models. Starting from the first
Generative Pre/Training Model, better known as GPT [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], these kinds of large language models
have rapidly improved. Even further, deep learning models have now reached multimodal
capabilities beyond just images, with methods proficient on audio [
        <xref ref-type="bibr" rid="ref17 ref18 ref19">17, 18, 19</xref>
        ], video [
        <xref ref-type="bibr" rid="ref20 ref21">20, 21</xref>
        ],
and 3D [
        <xref ref-type="bibr" rid="ref22 ref23 ref24">22, 23, 24</xref>
        ]. GPT-4 [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] is the most recent iteration, but in the meanwhile, many have
rushed to propose their own version. Google has recently released BARD1, while Meta has
proposed their own take on LLM with LLaMA [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The research community has also capitalized
its efort by releasing several open source LLM of diferent sizes, like Bloom [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], Dolly2, and
RWKV [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. However, all these models fail to scale to a larger context size, either by excessive
computational costs or by “losing it in the middle”, as shown in [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ].
      </p>
      <p>
        To address this context-length limitation, some have tried to incorporate external knowledge
into LLMs [
        <xref ref-type="bibr" rid="ref28 ref29 ref30">28, 29, 30</xref>
        ]. In particular, in “Retrieval-enhanced machine learning” [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ], authors
have envisioned a framework in which retrieval systems can enhance the performance of a
machine learning model. More recently, there have been attempts of jointly training retrieval
models with LLMs [
        <xref ref-type="bibr" rid="ref32 ref6">6, 32</xref>
        ], notably, the line of research on neural databases, in which the authors
tried to replace a traditional database with a neural framework removing the need for a schema
[
        <xref ref-type="bibr" rid="ref10 ref8 ref9">10, 9, 8</xref>
        ]. However, all these works assume full access to the reasoner module, which is not the
case for most users in practice.
      </p>
      <p>
        To overcome this limitation, many have tried to craft systems that are able to deliver an optimized
prompt that is input to the LLM. For instance, the research conducted by [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ] demonstrated
a substantial influence of the sequence in which prompts are presented on the ultimate
performance of the task. Meanwhile, a study by Nie et al. [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] highlighted that the performance
is susceptible to the arrangement of the examples in the prompt, prompt templates, and the
in-context instances in the prompt. Lester et al. [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] suggested a method to enhance task
performance by adding adjustable tokens during fine-tuning. LLM-AUGMENTER iteratively
revises [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] to improve the model response.
      </p>
      <p>
        All the works introduced above do not improve on the retriever, which is assumed fixed. In
our work, we propose to finetune the retriever in conjunction with the reasoner to improve
on results. Since the feedback is non-diferentiable we resort to reinforcement learning. In
particular, recent formulation such as Proximal Policy Optimization (PPO) [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ] make use of a
diferentiable neural reward module to include and account for generally non-diferentiable
feedback, like in the case of reinforcement learning with human feedback (RLHF).
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>In conclusion, RRAML provides a promising framework for building intelligent interfaces to
interact with large language models like GPT. By combining a generative language model with
a retriever, this approach can efectively improve the performance of language models and help
them understand user intents better.
1https://bard.google.com/
2https://github.com/databrickslabs/dolly</p>
      <p>However, this approach also comes with several challenges and uncertainties, such as the
need for a large amount of training data, the potential for bias in the data and models, and the
dificulty of balancing the trade-ofs between generative and retrieval-based approaches.</p>
      <p>Despite these challenges, RRAML holds great promise for creating more intelligent, natural,
and efective interfaces for interacting with language models. We hope that this paper has
provided a useful overview of this approach and its potential applications, and we look forward
to further research and development in this exciting area.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work was supported by PNRR MUR projects PE0000013-FAIR, SERICS (PE00000014),
IR0000013-SoBigData.it.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Neelakantan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shyam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          , et al.,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Akiki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Pavlick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ilić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hesslow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Castagné</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Luccioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yvon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gallé</surname>
          </string-name>
          , et al.,
          <article-title>Bloom: A 176b-parameter open-access multilingual language model</article-title>
          ,
          <source>arXiv preprint arXiv:2211.05100</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <article-title>[3] OpenAI, Chatgpt: A large-scale language model for conversational ai</article-title>
          ,
          <source>OpenAI Blog</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lavril</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Izacard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Martinet</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Rozière</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Hambro</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Azhar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Joulin</surname>
          </string-name>
          , E. Grave, G. Lample,
          <article-title>Llama: Open and eficient foundation language models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2302</volume>
          .
          <fpage>13971</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bacciu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Trappolini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Santilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rodolà</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <article-title>Fauno: The italian large language model that will leave you senza parole!</article-title>
          ,
          <source>arXiv preprint arXiv:2306.14457</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Piktus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Küttler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          , W.-t. Yih,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rocktäschel</surname>
          </string-name>
          , et al.,
          <article-title>Retrieval-augmented generation for knowledge-intensive nlp tasks</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>9459</fpage>
          -
          <lpage>9474</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>McAuley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          ,
          <article-title>Factual and informative review generation for explainable recommendation</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>37</volume>
          ,
          <year>2023</year>
          , pp.
          <fpage>13816</fpage>
          -
          <lpage>13824</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>G.</given-names>
            <surname>Trappolini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Santilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rodolà</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Halevy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <article-title>Multimodal neural databases</article-title>
          ,
          <source>in: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , SIGIR '23,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2023</year>
          , p.
          <fpage>2619</fpage>
          -
          <lpage>2628</lpage>
          . URL: https://doi.org/10.1145/3539618.3591930. doi:
          <volume>10</volume>
          .1145/3539618.3591930.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Thorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yazdani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Saeidi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Halevy</surname>
          </string-name>
          ,
          <article-title>Database reasoning over text</article-title>
          ,
          <source>arXiv preprint arXiv:2106.01074</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Thorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yazdani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Saeidi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Halevy</surname>
          </string-name>
          ,
          <article-title>From natural language processing to neural databases</article-title>
          ,
          <source>in: Proceedings of the VLDB Endowment</source>
          , volume
          <volume>14</volume>
          ,
          <string-name>
            <given-names>VLDB</given-names>
            <surname>Endowment</surname>
          </string-name>
          ,
          <year>2021</year>
          , pp.
          <fpage>1033</fpage>
          -
          <lpage>1039</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sauchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Thorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Halevy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tonellotto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <article-title>On the role of relevance in natural language processing tasks</article-title>
          , in: E. Amigó,
          <string-name>
            <given-names>P.</given-names>
            <surname>Castells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gonzalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Carterette</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Culpepper</surname>
          </string-name>
          , G. Kazai (Eds.),
          <source>SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , Madrid, Spain,
          <source>July 11 - 15</source>
          ,
          <year>2022</year>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>1785</fpage>
          -
          <lpage>1789</lpage>
          . URL: https://doi.org/10.1145/3477495.3532034. doi:
          <volume>10</volume>
          .1145/ 3477495.3532034.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Carmel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Cohen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ingber</surname>
          </string-name>
          , E. Kravi,
          <article-title>Ir evaluation and learning in the presence of forbidden documents</article-title>
          ,
          <source>in: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>556</fpage>
          -
          <lpage>566</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sauchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Thorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Halevy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tonellotto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <article-title>On the role of relevance in natural language processing tasks</article-title>
          ,
          <source>in: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>1785</fpage>
          -
          <lpage>1789</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Schulman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wolski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Klimov</surname>
          </string-name>
          ,
          <article-title>Proximal policy optimization algorithms</article-title>
          ,
          <source>arXiv preprint arXiv:1707.06347</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>V.</given-names>
            <surname>Mnih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kavukcuoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Silver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Rusu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Veness</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. G.</given-names>
            <surname>Bellemare</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Graves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Riedmiller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Fidjeland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ostrovski</surname>
          </string-name>
          , et al.,
          <article-title>Human-level control through deep reinforcement learning</article-title>
          , nature
          <volume>518</volume>
          (
          <year>2015</year>
          )
          <fpage>529</fpage>
          -
          <lpage>533</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Narasimhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Salimans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          , et al.,
          <article-title>Improving language understanding by generative pre-training</article-title>
          ,
          <source>OpenAI Blog</source>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Payne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <article-title>Jukebox: A generative model for music</article-title>
          , arXiv preprint arXiv:
          <year>2005</year>
          .
          <volume>00341</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Borsos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Marinier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Vincent</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Kharitonov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Pietquin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sharifi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roblek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Teboul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Grangier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tagliasacchi</surname>
          </string-name>
          , et al.,
          <article-title>Audiolm: a language modeling approach to audio generation</article-title>
          ,
          <source>IEEE/ACM Transactions on Audio, Speech, and Language Processing</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>G.</given-names>
            <surname>Barnabò</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Trappolini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lastilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Campagnano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <article-title>Cycledrums: automatic drum arrangement for bass lines using cyclegan</article-title>
          ,
          <source>Discover Artificial Intelligence</source>
          <volume>3</volume>
          (
          <year>2023</year>
          )
          <article-title>4</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <article-title>Videofusion: Decomposed difusion models for high-quality video generation</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-Y. Wu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Mangalam</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Xiong</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Malik</surname>
          </string-name>
          , C. Feichtenhofer, Mvitv2:
          <article-title>Improved multiscale vision transformers for classification and</article-title>
          detection,
          <year>2022</year>
          . arXiv:
          <volume>2112</volume>
          .
          <fpage>01526</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          , Scenedreamer:
          <article-title>Unbounded 3d scene generation from 2d image collections</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2302</volume>
          .
          <fpage>01330</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>G.</given-names>
            <surname>Trappolini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cosmo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Moschella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Marin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Melzi</surname>
          </string-name>
          , E. Rodolà,
          <article-title>Shape registration in the time of transformers</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>34</volume>
          (
          <year>2021</year>
          )
          <fpage>5731</fpage>
          -
          <lpage>5744</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>O.</given-names>
            <surname>Halimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Imanuel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Litany</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Trappolini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rodolà</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Guibas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kimmel</surname>
          </string-name>
          ,
          <article-title>Towards precise completion of deformable shapes</article-title>
          , in: Computer Vision-ECCV
          <year>2020</year>
          : 16th European Conference, Glasgow, UK,
          <year>August</year>
          23-
          <issue>28</issue>
          ,
          <year>2020</year>
          , Proceedings,
          <source>Part XXIV 16</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>359</fpage>
          -
          <lpage>377</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>OpenAI</surname>
          </string-name>
          , Gpt-4
          <source>technical report</source>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2303</volume>
          .
          <fpage>08774</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>B. PENG</given-names>
            ,
            <surname>RWKV-LM</surname>
          </string-name>
          ,
          <year>2021</year>
          . URL: https://github.com/BlinkDL/RWKV-LM. doi:
          <volume>10</volume>
          .5281/ zenodo.5196577.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>N. F.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hewitt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Paranjape</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bevilacqua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <article-title>Lost in the middle: How language models use long contexts</article-title>
          ,
          <source>arXiv preprint arXiv:2307.03172</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghazvininejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Brockett</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dolan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , W.-t. Yih,
          <string-name>
            <given-names>M.</given-names>
            <surname>Galley</surname>
          </string-name>
          ,
          <article-title>A knowledge-grounded neural conversation model</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>32</volume>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>E.</given-names>
            <surname>Dinan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Roller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shuster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Auli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          ,
          <article-title>Wizard of wikipedia: Knowledgepowered conversational agents</article-title>
          , arXiv preprint arXiv:
          <year>1811</year>
          .
          <volume>01241</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>B.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Galley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          , H. Cheng, Y. Xie,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Liden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Chen</surname>
          </string-name>
          , et al.,
          <article-title>Check your facts and try again: Improving large language models with external knowledge and automated feedback</article-title>
          ,
          <source>arXiv preprint arXiv:2302.12813</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zamani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Diaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dehghani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Metzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bendersky</surname>
          </string-name>
          ,
          <article-title>Retrieval-enhanced machine learning</article-title>
          ,
          <source>in: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>2875</fpage>
          -
          <lpage>2886</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Brockett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Galley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dolan</surname>
          </string-name>
          ,
          <article-title>Retgen: A joint framework for retrieval and grounded text generation modeling</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>36</volume>
          ,
          <year>2022</year>
          , pp.
          <fpage>11739</fpage>
          -
          <lpage>11747</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bartolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Stenetorp</surname>
          </string-name>
          ,
          <article-title>Fantastically ordered prompts and where to find them: Overcoming few-shot prompt order sensitivity</article-title>
          ,
          <source>arXiv preprint arXiv:2104.08786</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>F.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , X. Cheng,
          <article-title>Improving few-shot performance of language models via nearest neighbor calibration</article-title>
          ,
          <source>arXiv preprint arXiv:2212.02216</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>B.</given-names>
            <surname>Lester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Al-Rfou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Constant</surname>
          </string-name>
          ,
          <article-title>The power of scale for parameter-eficient prompt tuning</article-title>
          ,
          <source>arXiv preprint arXiv:2104.08691</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>L.</given-names>
            <surname>Engstrom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ilyas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Santurkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tsipras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Janoos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rudolph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Madry</surname>
          </string-name>
          ,
          <article-title>Implementation matters in deep policy gradients: A case study on ppo and trpo</article-title>
          , arXiv preprint arXiv:
          <year>2005</year>
          .
          <volume>12729</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>