<!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>Designing Human-Centric Foundation Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Narendra Patwardhan</string-name>
          <email>narendraprakash.patwardhan@unina.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shreya Shetye</string-name>
          <email>shreya.shetye@deepkapha.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lidia Marassi</string-name>
          <email>lidia.marassi@unina.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Monica Zuccarini</string-name>
          <email>monica.zuccarini@unina.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tannistha Maiti</string-name>
          <email>tannistha.maiti@deepkapha.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tarry Singh</string-name>
          <email>tarry.singh@deepkapha.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Deepkapha AI Research</institution>
          ,
          <addr-line>Street Vaart ZZ n° 1.d,9401GE, Assen</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Naples Federico II</institution>
          ,
          <addr-line>Via Claudio 21, 80125 Naples</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In recent years, generative AI has made remarkable strides in algorithmic innovation, enhancing zeroshot generalization for downstream tasks. However, challenges of accessibility and extensibility hinder their use as foundation models, primarily due to scale dependence. This article investigates the potential of sustainability and programmability principles in architectural design to create a more context-aware and user-focused AI ecosystem, promoting the responsible development of foundation models.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Foundation Models</kwd>
        <kwd>Human-centric Design</kwd>
        <kwd>Transformer Models</kwd>
        <kwd>Programmability</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Artificial intelligence (AI) has made significant progress in recent years, particularly in the area
of generative modeling [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ]. These models can generate new and original content, such as
images and text, based on a set of inputs. While these models have shown promising results
in a variety of downstream tasks, they often rely on scaling up the compute and raw data to
achieve such performance.[
        <xref ref-type="bibr" rid="ref4 ref5 ref6">4, 5, 6</xref>
        ]
      </p>
      <p>
        However, training on web-scale corpora with limited filtering can lead to unforeseen failure
modes and a lack of semantic context, which can raise ethical concerns such as bias and
discrimination.[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] As AI systems are increasingly being adopted in various domains, such
as personalized healthcare and social media content recommendation, they must prioritize
human-centered principles and operate ethically and fairly.
      </p>
      <p>While the impressive computational scale-up achieved by these models is undeniably an
engineering feat, it is not a sustainable approach in the long run due to its significant energy
consumption and carbon footprint. Scaling up comes with drawbacks that go beyond
environmental concerns and also afect accessibility and extensibility. The sheer scale of these models
makes them impractical for inference on standard hardware, thus limiting their accessibility to
researchers and developers. Moreover, the reliance on scale undermines their efectiveness as
foundation models, as they encounter various challenges including limited control over output,
brittleness, domain dependence, ineficiencies in training, and a lack of customizability for users.</p>
      <p>In this paper, we delve into the potential of sustainability and programmability principles
in architectural design to shape the future of foundation models. In Section 2, we focus on
improving the accessibility of these models by addressing their computational complexity and
exploring sustainable alternatives for internal components. We examine techniques for updating
AI models in real-time without retraining to address unforeseen failure modes and adapt to
changing definitions of ethics and propriety.</p>
      <p>In Section 3, our focus shifts to the crucial aspect of extensibility in the design of foundation
models. We explore how programmability plays a vital role in enabling users to customize
and exert control over these models. Additionally, we delve into innovative approaches that
facilitate context-length generalization. Moreover, we emphasize the importance of tailoring AI
systems to cater to individual needs and values, thus fostering a more personalized and adaptive
experience.</p>
      <p>Finally, in Section 4, we summarize our findings and discuss the implications of our work.
We hope to provide valuable insights into designing and deploying such models and help guide
future research and development eforts in this area.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Sustainability Principles in Architectural Design</title>
      <p>
        Bommasani Et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] coined the term foundation model to refer to any model that is trained on
a broad amount of data and is suitable for adaptation to a variety of downstream tasks. This
is in contrast to task-specific models, which focus on learning optimal representations for a
single problem based on a limited amount of data and aren’t suitable for adaptation to other
tasks without considerable retraining. With the advent of large-scale language models, much
of the research in the field of AI (especially in the subdomain of NLP) has shifted focus from
developing task-specific models to efectively adapting foundation models to downstream tasks.
      </p>
      <p>
        As the models increase in scale, the optimization demands a proportional increase in data.
To meet this need curation processes have seen a similar shift from their traditionally
humanled nature to heuristics-based automated filtering. To overcome the prohibitive cost of label
generation, most foundation models adopt self-supervised learning (SSL), which formulates the
pretraining task as a property of raw unannotated data such as next-word prediction or masked
reconstruction. [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]
      </p>
      <p>
        An unfortunate side efect of automated curation based on web crawling (which is further
augmented by the use of SSL) is that imperfections in curation heuristics lead the resultant
model to exhibit biases, show memorization of private data, vulnerability to adversarial assaults.
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] In the following subsections, we first explore the key components that form the backbone
of the current crop of foundation models and possible alterations to make them sustainable.
We then identify essential additions to base transformer architecture that decouples modality
modeling from knowledge modeling.
      </p>
      <sec id="sec-2-1">
        <title>2.1. Key Components of Foundation Models</title>
        <p>
          The fundamental constituent of all modern foundation models is the transformer block based
on the idea of self-attention [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], which allows the model to focus on certain parts of the input
sequence when processing it. The transformer block consists of self-attention and feedforward
layers. One of the key advantages of transformers is their ability to handle long input sequences
and internal parallelization, which allows them to be trained eficiently on large datasets.
        </p>
        <p>We will go through each of the components of the transformer block and discuss the possible
alternatives to make them more sustainable. The original formulation of the transformer is
presented with an encoder-decoder architecture. Modern variants such as GPTs focus on
decoder-only architecture. This simplification allows for straightforward implementations and
removes the overhead of architectural choices such as early or late fusion, number of context
injections, etc. However, the encoder-decoder architecture allows caching of the context. This
is particularly useful when downstream applications can request multiple generations based on
the same input.</p>
        <p>
          It is commonly thought that attention is the bottleneck in transformer-based models.
Numerous papers have attempted to reduce the computational complexity of the attention mechanism
by providing approximations to the full attention matrix at the cost of a slight decrease in
accuracy. [
          <xref ref-type="bibr" rid="ref12 ref13 ref14 ref15">12, 13, 14, 15</xref>
          ] As these methods only focus on FLOPs and ignore the overhead of
memory access patterns, they often fail to achieve wall-clock speedups. Coupled with the
inability to achieve the same accuracy as the standard attention, these methods have not been
widely adopted.
        </p>
        <p>
          Flash Attention [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] is an exact attention algorithm that reduces the number of memory
reads/writes within diferent types of accelerator memories (HBM and SRAM) with the help of
tiling. It has been found to ofer 15% wall-clock speedup over the standard implementations
of BERT-large (seq. len. 512), 3x speedup for GPT-2 (seq. len. 1k), and 2.4x speedup for the
long-range arena (seq. len. &gt;1k). Since our primary concern is to reduce energy consumption,
wall-clock timing is a more appropriate metric to look at than a notion of complexity detached
from the hardware. We thus recommend the adoption of hardware-specific versions of Flash
Attention as a sustainable alternative to approximate attention mechanisms described above.
        </p>
        <p>
          It has been found that the efect of quadratic cost for attention minimizes with scale as it
only adds () FLOPs per token per layer, whereas matrix multiplications (in the form of
linear layers) add (2)[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. A common misconception is that the parameter count directly
correlates with energy consumption. However, higher-order mechanisms such as routing allow
scaling up the parameter count without a proportional increase in energy consumption [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
Routing introduces sparsity which results in developing independent paths that act together
as a mixture of experts. We recommend adopting routing as a sustainable alternative to the
standard linear layers, as it enables the model to capture the diverse information content from
larger datasets without requiring additional processing power. By incorporating routing into
our model architecture, we can enhance both sustainability and eficiency while maintaining
the ability to leverage the valuable information contained in extensive datasets.
        </p>
        <p>
          In an orthogonal direction, Jaegle Et al. [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] searching for universal architectures proposed
the use of cross-attention to decouple the computational complexity of transformer blocks
from the input sequence length. This allowed them to consume multimodal data without any
architectural changes. An extension to this work soon followed to decouple this complexity
from output sequence length as well [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. This decoupling from both ends allows a network to
treat multimodal data in a unified manner.
        </p>
        <p>
          [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] provided formulation for [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] to be suitable for self-supervised learning. We recommend
considering the adoption of the general architectural structure of the perceiver family as a
sustainable alternative to the established self-attention (SA)-based encoder-decoder and
decoderonly architectures. This architectural approach has shown promising potential in terms of
reducing inference time latency.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Essential Additions to Foundation Models</title>
        <p>Training large models incur a significant cost in terms of the environment, finances, and
time. Unfortunately, the current foundation models require periodic retraining lest they become
outdated in their predictions. Knowledge about world events and new inventions is an important
indirect context that contributes to the quality of the generated text.</p>
        <p>Based on the scale, even the cost and resources required for retraining can be significant.
Consumers often resort to non-robust methods such as prompt tuning for incorporating specific
knowledge to avoid fine-tuning. However, since the context length for most models is limited,
prompt tuning is only efective in limited cases. Instilling expert knowledge in trained models
has been an area of active research.</p>
        <p>
          Boregeaud Et al. showed that the quality of generation can be improved with additional
context obtained from retrieval [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. Instead of increasing the size of the model and training on
more data, their method gives models the ability to directly access a large database during the
forward pass by using a small, frozen network and doing the nearest neighbor lookup.
        </p>
        <p>This method (RETRO) can be used with models trained from scratch as well as be retrofitted
after the initial training has been done. While RETRO hasn’t yet been widely adopted it provides
a promising direction for service providers to perform hotfixes to the model, an essential feature
in mature products.</p>
        <p>Combining multiple modalities, such as text, images, audio, and video, can improve the
performance and generalization ability of large AI models. This is because multimodal data
provides more comprehensive information, is more robust to errors in any individual modality,
and better reflects the complexity of real-world situations. For example, if an image is blurry or
distorted, the accompanying text may still provide enough information to accurately identify
the object.</p>
        <p>
          Networks that use a common structure to process independent modalities have been shown
to have synergistic efects on generalization. While current state-of-the-art models for computer
vision are trained to predict a fixed set of categories, in real-world scenarios, the categories are
often not known in advance and the model must be able to adapt to new categories as well as
provide a null prediction when the category difers from the known set. Because the cardinality
of text is far larger than the categories in classification datasets, models that share a common
representation space can be applied in a zero-shot manner [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] or even used to identify and
label new categories.
        </p>
        <p>
          To enable adaptation to new modalities, it is crucial to consider tokenization as part of the
architectural design process. Tokenization refers to the process of breaking down the input
modality into smaller units, such as words or subword units for text, to facilitate processing
by transformer models. One approach that has shown promise is byte-based tokenization [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ].
Instead of relying solely on word-level tokenization, byte-based tokenization allows for a more
ifne-grained decomposition and is a natural embedding space across modalities. Byte-based
tokenization can handle unseen categories well, however, trades computation for memory
requirements as the sequence length increases by an order of magnitude compared to other
representations. An approach by [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] overcomes this limitation by segmenting the byte-based
sequence into patches and applying a local submodel to have intra-patch information pooling
and a global submodel to have inter-patch information routing.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Programmability for User-Focused AI</title>
      <p>In this section, we explore various aspects of programmability that empower users with
customization, control, and alignment with their individual needs and values. We discuss the
concept of empowering users through customization and control, highlighting difusion models
and pluggable control as efective techniques. Additionally, we delve into two innovative
approaches for context length generalization, namely ALiBi, and RoPe, which utilize advanced
positional embeddings. Lastly, we address the significance of aligning AI systems with individual
needs and values, highlighting the adaptation capabilities of LoRA. By examining these aspects,
we aim to shed light on the potential of programmability to enhance the user experience and
enable AI systems to better meet the diverse requirements of individuals.</p>
      <sec id="sec-3-1">
        <title>3.1. Pluggable Control</title>
        <p>
          A new class of methods has rapidly captured the image generation landscape, called difusion
models. [
          <xref ref-type="bibr" rid="ref2 ref25">25, 2</xref>
          ] These models can be trained in a semi-supervised manner, where the model is
trained on a combination of labeled and unlabelled data. Difusion generates input-output pairs
by iteratively adding Gaussian noise to the input till the result itself resembles Gaussian noise.
The model is then trained to invert this process. Due to the inherent stability of optimization
that stems from supervised learning and the excellent quality of the generated samples, difusion
models have largely replaced the more traditional generative adversarial networks (GANs).
[
          <xref ref-type="bibr" rid="ref26 ref27 ref28">26, 27, 28</xref>
          ]
        </p>
        <p>
          While initially, difusion models were costly to train and obtain generations from at high
resolution, recent work has shifted difusion to be an internal component of a larger network
and work with latent representations [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. Due to open-sourcing of the weights of this model
(known as StableDifusion), it has become viable to produce high-resolution images even on a
consumer-grade GPU or with some additional time, on a CPU.
        </p>
        <p>
          Difusion-LM [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] provides a natural extension of difusion models to the domain of NLP.
Instead of producing a single token at a time and then finding the chain that has a maximum
probability, Difusion-LM work with spans. Difusion-LM allows the use of arbitrary
diferentiable modules as a guidance mechanism. This makes them quite attractive for removing
toxicity and stopping the leakage of sensitive information. While the research on these models
is still in its infancy, through our future work we aim to explore their use in the context of
instilling reliable and responsible behavior in the resultant generations.
        </p>
        <p>
          A new technique, introduced on top of difusion models but applicable to most generative
models is inversion [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. By providing a few instances of a concept not present in the corpus,
inversion learns its optimal representation in the input domain. This allows for the
generation of new instances and combinations with existing concepts. Inversion provides a critical
programmable interface to the model that we should thrive to enable within our models.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Context Length Generalization</title>
        <p>Context-length generalization is crucial in transformer models as it enables the ability to process
and understand larger contexts in downstream applications such as chatbots and summarization.
Transformer models are typically trained on sequences of up to 4k tokens, which limits their
capacity to handle longer contexts. Since transformers are permutation invariant, the choice of
positional embeddings plays a significant role in determining their ability to generalize across
diferent context lengths [31].</p>
        <p>ALiBi [32] adopts a diferent strategy. It introduces a penalty proportional to the distance
between query-key attention scores, rather than using positional embeddings. This biasing
mechanism enables ALiBi to efectively handle longer contexts by discouraging excessive
attention to distant tokens and promoting a better focus on relevant information within the
given context. Rotary positional embeddings (presented in [33]) have been shown to handle
larger contexts by changing their base at inference time [34].</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Low Resource Fine-tuning</title>
        <p>Fine-tuning large models has traditionally been a challenging task in AI research. The
complexity and size of these models often make fine-tuning computationally expensive and
resourceintensive. Moreover, the need for large-scale labeled datasets for fine-tuning can be a bottleneck,
as collecting and annotating such datasets is time-consuming and costly. However, the
introduction of LoRA [35] (low-rank adaption) has brought significant simplification to the process of
ifne-tuning large models. LoRA and its subsequent extension [ 36] utilizes low-rank
decomposition to eficiently update the weights of the pre-trained model during fine-tuning. This approach
reduces the computational requirements and memory footprint, making it more feasible to
ifne-tune large models on limited resources.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>In conclusion, integrating sustainability and programmability principles into the architectural
design of foundation models holds the potential to address the challenges of accessibility
and extensibility, fostering a context-aware and user-focused AI ecosystem. By prioritizing
responsible development, we can empower users with customization and improve eficiency.
It is crucial for researchers and practitioners to embrace these principles and collaboratively
design foundation models that promote a more inclusive and responsible AI future.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This research was made possible thanks to the generous support of the SIMAR GROUP s.r.l.,
Monte Urano (FM, Italy) and NextGenerationEU, which provided a Ph.D. scholarship to the lead
author.
arXiv preprint arXiv:2208.01618 (2022).
[31] R. Csordás, K. Irie, J. Schmidhuber, The devil is in the detail: Simple tricks improve
systematic generalization of transformers, arXiv preprint arXiv:2108.12284 (2021).
[32] O. Press, N. A. Smith, M. Lewis, Train short, test long: Attention with linear biases enables
input length extrapolation, arXiv preprint arXiv:2108.12409 (2021).
[33] J. Su, Y. Lu, S. Pan, A. Murtadha, B. Wen, Y. Liu, Roformer: Enhanced transformer with
rotary position embedding, arXiv preprint arXiv:2104.09864 (2021).
[34] G. Georgi, llama.cpp, https://github.com/ggerganov/llama.cpp, 2023.
[35] E. J. Hu, Y. Shen, P. Wallis, Z. Allen-Zhu, Y. Li, S. Wang, L. Wang, W. Chen, Lora: Low-rank
adaptation of large language models, arXiv preprint arXiv:2106.09685 (2021).
[36] T. Dettmers, A. Pagnoni, A. Holtzman, L. Zettlemoyer, Qlora: Eficient finetuning of
quantized llms, arXiv preprint arXiv:2305.14314 (2023).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Luan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          , et al.,
          <article-title>Language models are unsupervised multitask learners</article-title>
          ,
          <source>OpenAI blog 1</source>
          (
          <year>2019</year>
          )
          <article-title>9</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nichol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Hierarchical text-conditional image generation with clip latents</article-title>
          ,
          <source>arXiv preprint arXiv:2204.06125</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Rombach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Blattmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lorenz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Esser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ommer</surname>
          </string-name>
          ,
          <article-title>High-resolution image synthesis with latent difusion models</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>10684</fpage>
          -
          <lpage>10695</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <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="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>O.</given-names>
            <surname>Lieber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Sharir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lenz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shoham</surname>
          </string-name>
          , Jurassic-1
          <source>: Technical details and evaluation, White Paper. AI21 Labs</source>
          <volume>1</volume>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Patwary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Norick</surname>
          </string-name>
          , P. LeGresley, S. Rajbhandari,
          <string-name>
            <given-names>J.</given-names>
            <surname>Casper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Prabhumoye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zerveas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Korthikanti</surname>
          </string-name>
          , et al.,
          <article-title>Using deepspeed and megatron to train megatronturing nlg 530b, a large-scale generative language model</article-title>
          ,
          <source>arXiv preprint arXiv:2201.11990</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Bender</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gebru</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>McMillan-Major</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shmitchell</surname>
          </string-name>
          ,
          <article-title>On the dangers of stochastic parrots: Can language models be too big?</article-title>
          ,
          <source>in: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>610</fpage>
          -
          <lpage>623</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bommasani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Hudson</surname>
          </string-name>
          , E. Adeli,
          <string-name>
            <given-names>R.</given-names>
            <surname>Altman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Arora</surname>
          </string-name>
          , S. von Arx,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bohg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bosselut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Brunskill</surname>
          </string-name>
          , et al.,
          <article-title>On the opportunities and risks of foundation models</article-title>
          ,
          <source>arXiv preprint arXiv:2108.07258</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <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</source>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , Ł. Kaiser,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Khabsa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Fang</surname>
          </string-name>
          , H. Ma, Linformer:
          <article-title>Self-attention with linear complexity</article-title>
          , arXiv preprint arXiv:
          <year>2006</year>
          .
          <volume>04768</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Kitaev</surname>
          </string-name>
          , Ł. Kaiser,
          <string-name>
            <given-names>A.</given-names>
            <surname>Levskaya</surname>
          </string-name>
          ,
          <article-title>Reformer: The eficient transformer</article-title>
          , arXiv preprint arXiv:
          <year>2001</year>
          .
          <volume>04451</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>I.</given-names>
            <surname>Beltagy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cohan</surname>
          </string-name>
          ,
          <article-title>Longformer: The long-document transformer</article-title>
          , arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>05150</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>B.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Dao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Winsor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rudra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ré</surname>
          </string-name>
          , Scatterbrain:
          <article-title>Unifying sparse and low-rank attention</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>34</volume>
          (
          <year>2021</year>
          )
          <fpage>17413</fpage>
          -
          <lpage>17426</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>T.</given-names>
            <surname>Dao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. Y.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ermon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rudra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ré</surname>
          </string-name>
          ,
          <article-title>Flashattention: Fast and memory-eficient exact attention with io-awareness</article-title>
          ,
          <source>arXiv preprint arXiv:2205.14135</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>W.</given-names>
            <surname>Fedus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zoph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          , Switch transformers:
          <article-title>Scaling to trillion parameter models with simple and eficient sparsity</article-title>
          ,
          <source>The Journal of Machine Learning Research</source>
          <volume>23</volume>
          (
          <year>2022</year>
          )
          <fpage>5232</fpage>
          -
          <lpage>5270</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jaegle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gimeno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Brock</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Carreira</surname>
          </string-name>
          , Perceiver:
          <article-title>General perception with iterative attention</article-title>
          ,
          <source>in: International conference on machine learning, PMLR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>4651</fpage>
          -
          <lpage>4664</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jaegle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Borgeaud</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-B. Alayrac</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Doersch</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Ionescu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Koppula</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Zoran</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Brock</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Shelhamer</surname>
          </string-name>
          , et al.,
          <article-title>Perceiver io: A general architecture for structured inputs &amp; outputs</article-title>
          , arXiv preprint arXiv:
          <volume>2107</volume>
          .14795 (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>C.</given-names>
            <surname>Hawthorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jaegle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cangea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Borgeaud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Nash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Malinowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dieleman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Botvinick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Simon</surname>
          </string-name>
          , et al.,
          <article-title>General-purpose, long-context autoregressive modeling with perceiver ar</article-title>
          ,
          <source>arXiv preprint arXiv:2202.07765</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>S.</given-names>
            <surname>Borgeaud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rutherford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Millican</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. B. Van Den Driessche</surname>
          </string-name>
          , J.
          <string-name>
            <surname>-B. Lespiau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Damoc</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Clark</surname>
          </string-name>
          , et al.,
          <article-title>Improving language models by retrieving from trillions of tokens</article-title>
          , in: International conference on machine learning,
          <source>PMLR</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>2206</fpage>
          -
          <lpage>2240</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hallacy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          , G. Goh,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</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>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mishkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          , et al.,
          <article-title>Learning transferable visual models from natural language supervision</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>8748</fpage>
          -
          <lpage>8763</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>L.</given-names>
            <surname>Xue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Constant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Al-Rfou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          , C. Rafel, Byt5:
          <article-title>Towards a token-free future with pre-trained byte-to-byte models</article-title>
          ,
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>10</volume>
          (
          <year>2022</year>
          )
          <fpage>291</fpage>
          -
          <lpage>306</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Simig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Flaherty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Aghajanyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <article-title>Megabyte: Predicting million-byte sequences with multiscale transformers</article-title>
          ,
          <source>arXiv preprint arXiv:2305.07185</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>Vector quantized difusion model for text-to-image synthesis</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>10696</fpage>
          -
          <lpage>10706</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nichol</surname>
          </string-name>
          ,
          <article-title>Difusion models beat gans on image synthesis</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>34</volume>
          (
          <year>2021</year>
          )
          <fpage>8780</fpage>
          -
          <lpage>8794</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>J.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ermon</surname>
          </string-name>
          ,
          <article-title>Denoising difusion implicit models</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>02502</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Abbeel</surname>
          </string-name>
          ,
          <article-title>Denoising difusion probabilistic models</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>6840</fpage>
          -
          <lpage>6851</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>X. L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Thickstun</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gulrajani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          , T. B.
          <string-name>
            <surname>Hashimoto</surname>
          </string-name>
          ,
          <article-title>Difusion-lm improves controllable text generation</article-title>
          ,
          <source>arXiv preprint arXiv:2205.14217</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>R.</given-names>
            <surname>Gal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Alaluf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Atzmon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Patashnik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. H.</given-names>
            <surname>Bermano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Chechik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cohen-Or</surname>
          </string-name>
          ,
          <article-title>An image is worth one word: Personalizing text-to-image generation using textual inversion,</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>