<!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>Large Language Models integration in Digital Humanities</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Giovanni Sullutrone</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>, University of Modena and Reggio Emilia</institution>
          ,
          <addr-line>UNIMORE</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>First Year PhD Student, ICT Doctorate at DBGroup</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>The exponential growth of available data to Digital Humanities (DH) has created an impending need for tools capable of analyzing and extracting information from multi-lingual historical documents. This paper explores the research directions of my PhD project: providing DH scholars with efective, eficient, and explainable tools based on recent advancements in Large Language Models (LLMs). Two are the main directions of investigation: Self-Improving LLMs applied to Text-to-SQL and Topic Modeling, with a focus on interacting with and augmenting existing DBMS; Knowledge Graph (KG) creation and integration to mitigate hallucination, improve transparency and reasoning in question-answering systems. At the heart of my research lies the Digital Maktaba (DM) project which seeks to create a digital library for assisting in the preservation and analysis of multicultural non-latin heritage documents using, among others, cutting edge techniques for Natural Language Processing (NLP) and Data Science. The DM objectives and ideals align with the ultimate goal of the PhD project: the creation of instruments capable of aiding human-data interaction and information extraction while keeping the user at the center of an ever-evolving system. These tools have the potential to revolutionize the way DH scholars interact with historical documents, leading to new insights and discoveries for the field at large.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Large Language Models</kwd>
        <kwd>Cross-Language Document Analysis</kwd>
        <kwd>Self-Improving Large Language Models</kwd>
        <kwd>Knowledge Graph Integration</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Digital Humanities (DH) is an interdisciplinary field that merges humanities research with
digital technologies with the goal of revolutionizing the analysis of cultural and historical
artifacts. The exponential growth of available digital data has led to new challenges in accessing,
studying and comparing this vast amounts of information, creating the need for more advanced
tools that may assist the user in the analysis and cataloging of documents, be it for the major
latin languages or non-latin ones.</p>
      <p>To assist in this endeavor new algorithms based on recent developments in Natural Language
Processing (NLP) and, more specifically, Large Language Models (LLMs) are gaining traction.
These methods harness advancements in the former to enable cross-lingual data mining and
language processing, facilitating extraction of information and user interaction with vast
databases without the need for extensive technical expertise or costly human intervention.</p>
      <p>In this research project, my primary focus will be on leveraging newly developed
methodologies for self-improving LLMs to dynamically adapt to underlying data distributions and improve
performances in a self-supervised manner. This will be initially used for improving current
techniques of Text-to-SQL and Topic Modeling for the interaction and augmentation of DBMS.</p>
      <p>Another area of research will be on transparency, hallucinations and reasoning. By Knowledge
Graph (KG) creation, augmentation and integration, I seek to provide, on one side, easily
accessible and human readable explanations of the model knowledge and planning steps and,
on the other, explicit and reusable thought processes.</p>
      <p>In this paper, I first provide, in Section 2, an overview of the Digital Maktaba case study,
pointing out its objectives and significance within, and not limited to, the landscape of digital
humanities. Following that, in Section 3, I will discuss the related works that will act as the
foundation for my research. In Section 4 I will provide a comprehensive overview of my
ideas, addressing current limitations and outlining strategies for improvement. Finally, in the
concluding section, a summary of all the points explored in this paper will be given.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Digital Maktaba Project</title>
      <p>In this PhD, the Digital Maktaba (DM), defined as WP5 in the ITSERR project, functions as
the primary source and ultimate goal. This work package is dedicated to crafting a digital
library that can analyze and extract information from multi-lingual documents, particularly
from Arabic scripts (Arabic, Persian and Azerbaijani).</p>
      <p>To facilitate this endeavor, multiple books have been provided from the “Giorgio La Pira”
library in Palermo, hub of the FSCIRE foundation dedicated to history and doctrines of Islam.
This repository of high-quality documents given to the DM project will be invaluable for testing
new ideas and techniques, particularly in languages with limited available resources.</p>
      <p>My contributions toward realizing the DM’s overarching objectives involve providing tools
that facilitate the exploration of vast datasets, extraction of pertinent information, and answering
complex questions. In Figure 1, we see a representation of the main modules that I identified in
this early stage of research.</p>
      <p>
        • Text-to-SQL: Retrieval-Augmented Generation (RAG) methods have been shown to
reduce hallucinations and improve the quality of responses [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In a similar vein, the
integration of a Text-to-SQL module will act as an interface to extract relevant information
from databases to ground responses for Question-Answering functionalities.
• Metadata Generation: one of the most sought-after features for any digital library is
the generation of document metadata that can help researchers and even our Text-to-SQL
module navigate the vast corpora available. LLMs will be used to fill this role with an
initial focus being placed on Topic Modeling.
• Knowledge Graphs: hallucination, lack of transparency and poor reasoning are major
critiques of current LLM-based Question-Answering systems that make them a dificult
proposition for any knowledge-intensive application like digital libraries. KG creation
and navigation will be used to provide a clear view of the model knowledge and thought
process by conditioning the model into saving important relationships and reasoning
steps.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Related Works</title>
      <sec id="sec-3-1">
        <title>3.1. Self-Improvement</title>
        <p>
          The capability of Large Language Models to enhance their own performance through
selftraining and self-supervision represents a significant advancement in the field. Early
methodologies aimed at improving model performance on specific tasks such as code generation [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] or
mathematical reasoning [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] were based on human-labeled data, which, while efective, were
costly or dificult to obtain.
        </p>
        <p>
          Another branch of research, instead, focused on using highly performant and expensive
models to generate high-quality data to train smaller ones [
          <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
          ], efectively transferring part of
their capabilities to a weaker but faster counterpart.
        </p>
        <p>
          However, the cutting edge of the domain is moving towards self-improving methodologies
for creating better-performing models at a low human cost. In [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], a novel fine-tuning method
was proposed to refine model capabilities by pitting instances of the model against each other
in a adversarial setting, progressively enhancing performance without human intervention.
        </p>
        <p>
          Concurrently, [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] introduced a self-rewarding approach that uses the model under scrutiny
both as predictor and as judge of the response, generating new feedback signals for iterative
DPO training [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Notably, each iteration of improvement enhances both the judge and the
judged capabilities providing interesting possibilities.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Text-to-SQL</title>
        <p>
          The realm of Text-to-SQL translation has seen considerable advancements, propelled by both
traditional and innovative methodologies. Early eforts in this area often centered around templates
and heavy human engineering [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. The advent of machine learning, instead, introduced a wave
of data-driven approaches, culminating in recent procedures that make use of Large Language
Models to solve the task with satisfactory results. These new up and coming techniques are
dominating the leaderboards for the major Text-to-SQL datasets [
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ]. However, while the
usage of open-weight models are garnering interest, they still underperform the best closed
models, as of the time of writing, GPT-4 [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Topic Modeling</title>
        <p>
          Traditional Topic Modeling approaches like Latent Dirichlet Allocation (LDA) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] rely on
statistical distributions to uncover latent thematic structures within a text corpus.
        </p>
        <p>In recent years, instead, attention has shifted towards utilizing autoregressive LLMs. In [14]
and [15] both closed-source and open-weight models were tested for defining and assigning
topics in diferent datasets and contexts, demonstrating significant improvements compared to
baselines, with mixed results for open-weight models compared to closed ones.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Knowledge Graph and LLMs Synergy</title>
        <p>As stated in [16] the integration of Knowledge Graphs and Large Language Models has emerged
as a compelling area of research due to their complementary strengths.</p>
        <p>LLMs excel in language understanding, generation and processing of extensive textual data.
Yet, challenges in interpretability and controllability remain. Conversely, KGs provide clear,
structured factual knowledge, enhancing explainability and reasoning.</p>
        <p>Therefore synergistic methodology are an intriguing avenue of research. KGs can combat
LLMs’ propensity to hallucinate facts by injecting real-world knowledge during training [17, 18]
or inference [19]. In turn, LLMs can facilitate the construction [20] and enrichment [21] of KGs
through their ability to process and interpret vast amounts of unstructured text. Finally, LLMs
can act as a powerful tool for interacting with available knowledge bases, enabling users to ask
natural language questions to receive structured and informative responses that leverage the
depth and interconnectedness of KGs [22].</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Research Objectives</title>
      <p>As described in Section 3, the current best performing techniques for both Topic Modeling and
Text-to-SQL are based on closed source models but this is a more broad phenomena as shown in
the current ranking for chatbots [23]. This reliance poses several problems for real-world
application. These include cost estimation dificulties, dependency on third-party availability, privacy
concerns, potential biases and poor transparency. These issues are particularly pronounced in
digital humanities research, where the analysis of lengthy historical and multifaceted documents
is central.</p>
      <p>The objective of this PhD is to address these challenges by improving existing open-source
models, thereby providing scholars with efective, eficient and explainable tools for analyzing
multilingual documents and interacting with complex data systems. This will be achieved
through three primary avenues: self-improvement of Text-to-SQL and Topic Modeling, and KGs
integration.</p>
      <sec id="sec-4-1">
        <title>4.1. Self-Improvement</title>
        <p>
          In the domain of Text-to-SQL, current methodologies mainly focus on massive and closed LLMs
solutions that are a dificult proposition for a lot of real-world use cases [
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ].
        </p>
        <p>
          The subject of research will be the use of self-improving mechanisms to train the model
in a self-supervised manner by generating new samples of natural language queries through
in-context learning as in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. The results will then be judged by the same model, utilizing
additional information from SQL execution to provide reinforcement feedback for training. The
creation of new examples and the exploration of the database during the iterative improvements
could lead to important gains in performance.
        </p>
        <p>Similarly, for Topic Modeling, new documents on the same subjects will be created, the
associated topics will be predicted and judged using additional information that can be
extracted from more traditional methodologies. This pipeline will provide interesting data for the
iterative reinforcement learning procedure. The efectiveness of this specific approach, while
no intermediate results are available as of the time of writing, shows promise as it has been
shown that Large Language Models are good judges of topic categorization and have a strong
correlation with human judgments [24].</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Knowledge Graphs Synergy</title>
        <p>The synergy with knowledge graphs has become more and more apparent in recent years leading
us to explore their usage for LLMs and with LLMs. This research will focus on leveraging KGs
to ground model responses, mitigate hallucinations, and identify conflicting information among
documents. In particular, following the work of [25], I plan to use the knowledge retrieved at
inference time by RAG systems to generate and augment the available knowledge graphs by
self-reflecting on the contextual and reasoning information. By utilizing in conjunction the
aforementioned KG alteration with their exploration, as in [22], I foresee explicit and transparent
reasoning steps being saved and reused by the LLM for solving progressively more complex
tasks. These capabilities will be crucial for digital humanities research, allowing deeper, richer
and more transparent analysis of multi-document and multilingual subjects.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>This paper presented the research objective and foundational works of my studies which aims
to create instruments capable of aiding data interaction and information extraction utilizing
Self-Improvement methodologies and Knowledge Graphs. The DM project has been shown as
an ideal starting point for building a digital library capable of providing scholars with eficient
and efective tools for the analysis and cataloguing of multi-lingual, non-latin and lengthy
historical documents. Key areas of research were outlined with great emphasis placed on the
application of cutting-edge techniques. This project will hopefully contribute a key piece to the
puzzle in creating ever-evolving systems built with humans and for humans.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Acknowledgments</title>
      <p>This work was supported by the PNRR project Italian Strengthening of Esfri RI Resilience
(ITSERR) funded by the European Union – NextGenerationEU (CUP:B53C22001770006).
[14] C. M. Pham, A. Hoyle, S. Sun, M. Iyyer, Topicgpt: A prompt-based topic modeling
framework, arXiv preprint arXiv:2311.01449 (2023).
[15] H. Wang, N. Prakash, N. K. Hoang, M. S. Hee, U. Naseem, R. K.-W. Lee, Prompting large
language models for topic modeling, in: 2023 IEEE International Conference on Big Data
(BigData), IEEE, 2023, pp. 1236–1241.
[16] S. Pan, L. Luo, Y. Wang, C. Chen, J. Wang, X. Wu, Unifying large language models and
knowledge graphs: A roadmap, IEEE Transactions on Knowledge and Data Engineering
(2024).
[17] Z. Zhang, X. Han, Z. Liu, X. Jiang, M. Sun, Q. Liu, ERNIE: Enhanced language representation
with informative entities, in: A. Korhonen, D. Traum, L. Màrquez (Eds.), Proceedings of
the 57th Annual Meeting of the Association for Computational Linguistics, Association for
Computational Linguistics, Florence, Italy, 2019, pp. 1441–1451. URL: https://aclanthology.
org/P19-1139. doi:10.18653/v1/P19-1139.
[18] C. Rosset, C. Xiong, M. Phan, X. Song, P. Bennett, S. Tiwary, Knowledge-aware language
model pretraining, arXiv preprint arXiv:2007.00655 (2020).
[19] P. Lewis, E. Perez, A. Piktus, F. Petroni, V. Karpukhin, N. Goyal, H. Küttler, M. Lewis, W.-t.</p>
      <p>Yih, T. Rocktäschel, et al., Retrieval-augmented generation for knowledge-intensive nlp
tasks, Advances in Neural Information Processing Systems 33 (2020) 9459–9474.
[20] A. Kumar, A. Pandey, R. Gadia, M. Mishra, Building knowledge graph using pre-trained
language model for learning entity-aware relationships, in: 2020 IEEE International
Conference on Computing, Power and Communication Technologies (GUCON), IEEE,
2020, pp. 310–315.
[21] Z. Zhang, X. Liu, Y. Zhang, Q. Su, X. Sun, B. He, Pretrain-KGE: Learning knowledge
representation from pretrained language models, in: T. Cohn, Y. He, Y. Liu (Eds.), Findings of the
Association for Computational Linguistics: EMNLP 2020, Association for Computational
Linguistics, Online, 2020, pp. 259–266. URL: https://aclanthology.org/2020.findings-emnlp.
25. doi:10.18653/v1/2020.findings-emnlp.25.
[22] J. Sun, C. Xu, L. Tang, S. Wang, C. Lin, Y. Gong, H.-Y. Shum, J. Guo, Think-on-graph: Deep
and responsible reasoning of large language model with knowledge graph, arXiv preprint
arXiv:2307.07697 (2023).
[23] L. Zheng, W.-L. Chiang, Y. Sheng, S. Zhuang, Z. Wu, Y. Zhuang, Z. Lin, Z. Li, D. Li, E. Xing,
et al., Judging llm-as-a-judge with mt-bench and chatbot arena, Advances in Neural
Information Processing Systems 36 (2024).
[24] D. Stammbach, V. Zouhar, A. Hoyle, M. Sachan, E. Ash, Revisiting automated topic
model evaluation with large language models, in: H. Bouamor, J. Pino, K. Bali (Eds.),
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing,
Association for Computational Linguistics, Singapore, 2023, pp. 9348–9357. URL: https:
//aclanthology.org/2023.emnlp-main.581. doi:10.18653/v1/2023.emnlp-main.581.
[25] C. Packer, S. Wooders, K. Lin, V. Fang, S. G. Patil, I. Stoica, J. E. Gonzalez, Memgpt: Towards
llms as operating systems, 2024. arXiv:2310.08560.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Retrievalaugmented generation for large language models: A survey</article-title>
          ,
          <year>2024</year>
          . arXiv:
          <volume>2312</volume>
          .
          <fpage>10997</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B.</given-names>
            <surname>Roziere</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gehring</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gloeckle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sootla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Gat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. E.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Adi</surname>
          </string-name>
          , J. Liu,
          <string-name>
            <given-names>T.</given-names>
            <surname>Remez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rapin</surname>
          </string-name>
          , et al.,
          <article-title>Code llama: Open foundation models for code</article-title>
          ,
          <source>arXiv preprint arXiv:2308.12950</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Scaling relationship on learning mathematical reasoning with large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2308</source>
          .
          <year>01825</year>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gunasekar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Aneja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. C. T.</given-names>
            <surname>Mendes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Del Giorno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gopi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Javaheripi</surname>
          </string-name>
          , P. Kaufmann, G. de Rosa,
          <string-name>
            <given-names>O.</given-names>
            <surname>Saarikivi</surname>
          </string-name>
          , et al.,
          <article-title>Textbooks are all you need</article-title>
          ,
          <source>arXiv preprint arXiv:2306.11644</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bubeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Eldan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Giorno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gunasekar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. T.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Textbooks are all you need ii:</article-title>
          <source>phi-1.5 technical report</source>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2309</volume>
          .
          <fpage>05463</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <article-title>Self-play fine-tuning converts weak language models to strong language models</article-title>
          ,
          <source>arXiv preprint arXiv:2401.01335</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>W.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. Y.</given-names>
            <surname>Pang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sukhbaatar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          ,
          <article-title>Self-rewarding language models</article-title>
          ,
          <source>arXiv preprint arXiv:2401.10020</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.</given-names>
            <surname>Rafailov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          , E. Mitchell,
          <string-name>
            <surname>C. D. Manning</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Ermon</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Finn</surname>
          </string-name>
          ,
          <article-title>Direct preference optimization: Your language model is secretly a reward model</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>36</volume>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Févotte</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Idier</surname>
          </string-name>
          ,
          <article-title>Algorithms for nonnegative matrix factorization with the -divergence</article-title>
          ,
          <source>Neural computation 23</source>
          (
          <year>2011</year>
          ). doi:
          <volume>10</volume>
          .1162/NECO_a_
          <fpage>00168</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yasunaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Roman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , D. Radev,
          <article-title>Spider: A large-scale human-labeled dataset for complex and crossdomain semantic parsing and text-to-sql task</article-title>
          ,
          <year>2019</year>
          . arXiv:
          <year>1809</year>
          .08887.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hui</surname>
          </string-name>
          , G. Qu,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Geng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Huo</surname>
          </string-name>
          , et al.,
          <article-title>Can llm already serve as a database interface? a big bench for large-scale database grounded text-to-</article-title>
          <string-name>
            <surname>sqls</surname>
          </string-name>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>36</volume>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Text-to-sql empowered by large language models: A benchmark evaluation</article-title>
          ,
          <source>arXiv preprint arXiv:2308.15363</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>D. M. Blei</surname>
            ,
            <given-names>A. Y.</given-names>
          </string-name>
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>M. I. Jordan</given-names>
          </string-name>
          ,
          <article-title>Latent dirichlet allocation</article-title>
          ,
          <source>Journal of machine Learning research 3</source>
          (
          <year>2003</year>
          )
          <fpage>993</fpage>
          -
          <lpage>1022</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>