<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>mendation Systems Using Large Language Models and Personalized Knowledge Graphs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fernando Spadea</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Knowledge Graph, Federated Learning, Knowledge Graph Completion, Personalized Knowledge Graphs,</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Rensselaer Polytechnic Institute</institution>
          ,
          <addr-line>Troy, New York</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <fpage>2</fpage>
      <lpage>6</lpage>
      <abstract>
        <p>We investigate how large language models (LLMs), when paired with personalized knowledge graphs (PKGs), can power decentralized recommendation systems. This work lays the groundwork for more intelligent and user-aligned personal digital assistants that respect user autonomy and data sovereignty. A key focus of our research is exploring how LLMs can be fine-tuned in federated settings to balance personalization with privacy. To this end, we evaluate several fine-tuning methods and compare their performance to select the best one. Early results indicate that LLMs fine-tuned to use PKGs can outperform symbolic and embedding-based KGC models (e.g., KBGAT, HAKE) in both centralized and federated contexts, and that fine-tuning with Kahneman-Tversky Optimization (KTO) is more resilient to lopsided data distributions.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Problem Statement</title>
      <p>CEUR</p>
      <p>ceur-ws.org</p>
      <p>Ford’s work, the system recommends another of his movies, like ”What Lies Beneath (2000)”. If the
user accepts this suggestion, their PKG is updated to reflect this new preference. Later, when the
user’s device participates in a round of federated learning, the model is fine-tuned locally on this new
interaction. The resulting model updates are sent to a central server for aggregation. Because the user’s
specific preferences never leave their device, their privacy is preserved, while the aggregated global
model still learns general patterns, such as the connection between diferent Harrison Ford movies,
benefiting all users.</p>
      <p>Because PKGs are interpretable and adaptable, users can both understand and influence how their
data informs recommendations. The system can be flexibly tuned to specific recommendation contexts.
They can also be designed to deliberately disrupt PIEs by adapting preference patterns within the PKG.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Importance</title>
      <sec id="sec-2-1">
        <title>Why is this problem important and for whom?</title>
        <p>This problem has broad societal relevance, impacting virtually all users of modern digital platforms. For
individuals, it concerns the fundamental right to privacy, transparency, and control over personal data.
Furthermore, exploring a variety of content enriches a user’s experience. For organizations, especially
smaller companies and startups, it presents a barrier to entry due to the infrastructure requirements
and legal risks of handling sensitive user data.</p>
        <p>Who will benefit and who should care?
• Users gain enhanced privacy, transparency, and agency over how they are profiled and marketed
to.
• Companies and organizations benefit from reduced infrastructure costs and data liability, making
advanced recommendation systems more accessible to smaller players.
• Researchers interested in privacy, personalization, fairness, and human-computer interaction
gain a novel paradigm for user modeling and recommendation.</p>
      </sec>
      <sec id="sec-2-2">
        <title>What is the impact of solving this problem (for the research community, or society in general)?</title>
        <p>
          Solving this problem could democratize access to recommendation technology while restoring trust
in digital systems. It fosters user empowerment through interpretable data structures and safeguards
personal data by eliminating the need for centralized storage. From a societal perspective, it combats
the dangers of algorithmic echo chambers by enabling users to actively shape their digital experiences.
From a research perspective, it introduces a hybrid model that combines language-based reasoning
with structured, user-owned knowledge, contributing to the evolution of federated and interpretable
AI. This approach aligns with recent perspectives that unifying KGs and LLMs can combine their
respective strengths: the factual knowledge and interpretability from KGs with the advanced reasoning
and language abilities of LLMs [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Related Work</title>
      <sec id="sec-3-1">
        <title>Has a solution to this problem been attempted before and how?</title>
        <p>Prior work has explored key components of our proposed system—namely, knowledge graph completion
(KGC), FL, and recommendation using LLMs, but no existing approach integrates these elements into a
unified, interpretable, privacy-preserving, and scalable recommendation framework.</p>
        <p>
          In the space of centralized KGC, models such as KBGAT [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and HAKE [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] have achieved strong
Hits@k performance by leveraging graph embeddings and attention mechanisms. Federated approaches
to KGC are rare but do exist; notably, Fede [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] explores federated training of KGC models across
distributed clients.
        </p>
        <p>
          To test the potential of fine-tuning LLMs with FL, Ye et al. [
          <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
          ] designed a set of benchmarks,
named OpenFedLLM, to test the capabilities of federated LLMs. They tested several fine-tuning methods
across several models and federated aggregation methods; most notably, they tested Direct Preference
Optimization (DPO), a state-of-the-art human-feedback based fine-tuning method, and found that it
performed well [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>
          LLMs have also been tested for their ability to perform KGC tasks. For example, Meyer et al. [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]
experimented with using ChatGPT for KGC, though in a limited, non-federated setting. In a complementary
direction, Qiu et al. [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] incorporate knowledge graphs (KGs) to improve LLM-based recommendation,
but without personalization or user-side control of data.
        </p>
        <p>
          Eforts to mitigate PIEs include the Dual Echo Chamber framework [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], which models both the
user’s comfort zone and alternative spaces using KG embeddings. Anand et al. [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] propose calculating
data point influence to selectively retrain models in order to diversify recommendations.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>If you are addressing an existing problem, what are the limitations of current solutions?</title>
        <p>
          Despite their strengths, existing KGC models like KBGAT [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and HAKE [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] are unsuitable for our
setting due to several key limitations. These models assume centralized training and storage, requiring
access to the global list of entities and relations when the model is built. Not only does this violate
the constraints of federated environments, but it also requires that the models be rebuilt and retrained
whenever new entities or relations are introduced. This is especially problematic in a federated setting
where clients may leave the network and thus take their data with them so that it can no longer be
used in the retraining of the model. Additionally, current models cannot constrain individual KGC
tasks to specific subdomains (e.g., food, media), limiting their usefulness in personalized, on-demand
recommendation scenarios.
        </p>
        <p>
          While OpenFedLLM [
          <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
          ] does provide a useful framework and set of benchmarks for testing
federated LLMs, it has a significant limitation: it predates Kahneman-Tversky Optimization (KTO) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]
and does not cover or support it as a result. KTO is a newer human-feedback fine-tuning method, like
DPO, but even more widely applicable and efective, making it even more appropriate for FL, so this is
a significant drawback. There is very limited testing of KTO in FL overall, so there is significant room
for exploring its performance in a federated setting.
        </p>
        <p>
          While Fede [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] explores KGC in a federated setting, it does so globally and without personalized
structures like PKGs.
        </p>
        <p>Regarding LLM-based solutions, existing work does not integrate federated training or PKGs. Most
rely on static prompting rather than fine-tuning, and do not explore dynamic, user-guided
recommendations or PIE mitigation strategies.</p>
        <p>
          Eforts to explore outside PIEs also sufer limitations. The Dual Echo Chamber framework [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] requires
case-specific strategies for diferent PIE types, which is not scalable. Additionally, the retraining-based
method by Anand et al. [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] is computationally expensive and lacks real-time adaptability.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>What are you adding that is novel? Why? If not, have research eforts tried or solved similar, analogous problems?</title>
        <sec id="sec-3-3-1">
          <title>Our proposed system introduces several novel contributions:</title>
          <p>
            • Federated, PKG-based Recommendation: We integrate federated learning with personalized
KGs, allowing users to retain control over their data while still benefiting from high-quality,
LLM-driven recommendations. Additionally, we employ diferential privacy to ensure the user’s
data remains private [14].
• LLM Fine-Tuning with KTO: We leverage KTO to fine-tune the LLM for knowledge graph
tasks, enabling more efective and context-aware recommendations [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ]. Among fine-tuning
variants of DPO, KTO is found to produce the best results [15].
• Guideable and Contextual Recommendations: Our system allows users to guide
recommendations toward specific domains by instructing the LLM to work within said domains, improving
relevance and interpretability.
• Real-time PIE Mitigation: Unlike existing approaches that require retraining or heuristic
strategies, we address PIEs directly by modifying the user’s PKG, enabling quick, targeted adjustments
without retraining the model.
          </p>
          <p>This combination of techniques results in a system that is privacy-preserving, interpretable, scalable,
and user-controllable, qualities that are not achieved in existing work.</p>
        </sec>
      </sec>
      <sec id="sec-3-4">
        <title>What can you learn from these eforts?</title>
        <p>These prior eforts underscore the growing interest in privacy, personalization, and interpretability in
recommendation systems. They highlight both the promise and limitations of existing technologies.
Specifically, they show: (i) The potential of LLMs in semantic reasoning tasks involving KGs. (ii) The
practical challenges of deploying centralized models at scale. (iii) The importance of user-guided and
interpretable systems in exploring new content. Together, these works provide valuable benchmarks
and conceptual foundations upon which we can build a more robust and user-centered solution.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Research Questions and Hypothesis</title>
      <sec id="sec-4-1">
        <title>What research questions do you plan to explore?</title>
        <p>We aim to investigate how LLMs can be integrated into a privacy-preserving, decentralized
recommendation system grounded in user-controlled knowledge representations. Specifically, our work explores
the following research questions:
RQ1: How can PKGs be used to fine-tune an LLM to improve recommendation accuracy and
personalization compared to standard knowledge-aware recommenders? (Core technical question focusing on
PKG+LLM eficacy)
RQ2: Which fine-tuning strategies are most efective for LLMs in a federated learning setting,
particularly in the presence of heterogeneous data and privacy constraints?
RQ3: How does knowledge graph completion via LLM, with PKG data, impact recommendation quality,
such as coverage of long-tail items and novelty?</p>
        <p>These questions leverage Semantic Web technologies to structure and store PKGs in interoperable,
machine-readable formats. By grounding user data in open standards (e.g., JSON-LD), stored within Solid
pods, we aim to ensure that users retain full control over their data while still enabling high-performance
model inference on the client side.</p>
      </sec>
      <sec id="sec-4-2">
        <title>What hypotheses do you make in formulating your solution?</title>
        <p>H1: PKGs will enable an LLM to generate more accurate recommendations than an LLM without KG
ifne-tuning, due to the injection of structured personal knowledge.</p>
        <p>
          H2: LLMs fine-tuned with KTO are more performant and resilient to lopsided data in a federated
setting, even with diferential privacy applied, than those fine-tuned via other human feedback-based
ifne-tuning methods, such as Direct Preference Optimization (DPO) [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>H3: If a user’s PKG is adjusted, an LLM fine-tuned for KGC can be led to make recommendations
outside the PIE without retraining more efectively than if the LLM was simply asked to avoid the PIE
with the unadjusted PKG.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Preliminary Results</title>
      <sec id="sec-5-1">
        <title>Do you have any preliminary results that inform your research questions or hypotheses?</title>
        <p>Figure 1 illustrates our framework design. Figure 1a shows how clients perform local training on
personalized KGs and communicate model updates to a central server for aggregation. Before sending
the updates, diferential privacy is applied to ensure the user’s data cannot be reverse engineered
from the updates. Figure 1b shows how, at inference time, the LLM receives a user’s PKG and natural
language query, and generates KG completions. However, if the user indicates they want to avoid the
PIE in the request, the PKG is first adjusted to represent a user with PIE-avoiding preferences.</p>
        <p>Table 1 contains our previous work [16] where we showed that an LLM fine-tuned, via FL, with
KTO outperformed DPO, even when the distribution of the data was randomized. We fine-tuned
alpha7B [17] with chatbot arena data [18] in a federated setting using both DPO and KTO, with and
without randomizing the data (KTOR and KTOO respectively). Our findings demonstrate that KTO
consistently outperforms DPO across all aggregation methods and evaluation benchmarks. Notably,
KTO achieves higher scores even when the training data is randomized (KTOR), highlighting its
robustness to data distribution variance. The evaluated benchmarks include:
Legend
?i = Weight updates at client i
?Agg = Aggregated weight updates
DPi = Differential privacy applied at client i</p>
        <p>LLM</p>
        <p>PKG
Derive KG Completion</p>
        <p>Response
?N</p>
        <p>DPN</p>
        <p>Fine-Tuning
Client N
?1</p>
        <p>DP1</p>
        <p>PKG
User Request</p>
        <p>Federated
Aggregation
Server</p>
        <p>?Agg
LLM
PKG
?2</p>
        <p>DP2
Yes
Avoid
PIE?
No</p>
        <p>Knowledge Graph Update</p>
        <p>Rule Adaptation
Adapted PKG</p>
        <p>PKG
LLM</p>
        <p>PKG
• MT-Bench-1: Measures one-turn conversational performance [18].
• Vicuna: Assesses instruction-following capabilities [19].
• AdvBench: Evaluates model safety and adversarial robustness [20].</p>
        <p>• MMLU: Measures factual knowledge and reasoning ability [21].</p>
        <p>The MT-Bench-1, Vicuna, and AdvBench results have been published in our prior work [16], while
the MMLU results are newer and not yet published.</p>
        <p>Table 2 reports performance on our custom Movie KG dataset, derived from the Recommendation
Dialogues dataset [22, 23]. We took dialogues between users recommending movies to build PKGs
that encode each user’s preferences. In the table, we refer to our model as PKGLLM (centralized) and
FedPKGLLM (federated) with (noSyn) indicating that no synthetic data was used in fine-tuning.</p>
        <p>We evaluated LLMs fine-tuned with KTO against strong symbolic and embedding-based KGC
baselines: KBGAT and HAKE. Results show that our model, PKGLLM, which is a KTO-tuned Qwen3-0.6B
model [24], achieves significantly better performance in both centralized and federated configurations,
across all metrics: Precision, Recall, Hits@K, and MRR. This suggests that LLMs trained with KTO can
outperform specialized KGC models on link prediction tasks grounded in personalized, dialogue-derived
KGs. These results strongly support H1 and H2, indicating that LLMs fine-tuned via KTO can serve as
efective and robust KGC engines, particularly in decentralized, privacy-sensitive settings.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Evaluation</title>
      <sec id="sec-6-1">
        <title>How will you know you’ve answered your question(s)?</title>
        <p>Our evaluation strategy centers on systematically testing each hypothesis and research question through
comparative experiments and controlled ablation studies. For RQ1 and RQ2, we rely on benchmark
datasets and model performance metrics as outlined in the preliminary results. These results already
support H1 and part of H2, showing that LLMs fine-tuned via KTO outperform DPO-based models in a
federated setting across a variety of benchmarks, and an LLM fine-tuned to make recommendations
using PKGs outperforms KBGAT and HAKE. For further testing, we will continue to compare against
baseline models.</p>
      </sec>
      <sec id="sec-6-2">
        <title>What are the methods you apply to test your hypotheses?</title>
        <p>
          To evaluate the other half of H2 (regarding the efect of diferential privacy), we will fine-tune Alpaca7B
using both KTO and DPO under varying levels of privacy budgets. We select Alpaca7B to maintain
comparability with the OpenFedLLM [
          <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
          ], and also because more advanced models may actually
decrease in performance from fine-tuning on the chatbot arena dataset since they likely have already
used it in training. Performance will be assessed using similar metrics as in Table 1, allowing for a
direct comparison of robustness under privacy constraints.
        </p>
        <p>To assess H3 and investigate the impact of KG adaptation on recommendations that venture outside
a user’s PIE, we will conduct experiments using three strategies:</p>
        <sec id="sec-6-2-1">
          <title>1. Recommendations generated with the unmodified PKG.</title>
          <p>2. Recommendations generated by prompting the model to avoid the PIE without PKG adaptation.
3. Recommendations generated after adapting the PKG to avoid the PIE.</p>
          <p>We will compare the precision, relevance, and diversity of recommendations with each strategy to
determine the eficacy of PKG adaptation as a strategy for PIE avoidance.</p>
        </sec>
      </sec>
      <sec id="sec-6-3">
        <title>Have you identified criteria to measure the degree of success of your solution?</title>
        <p>For hypotheses related to diferential privacy ( H2), we will use the same benchmarks as in the
preliminary results: MT-Bench-1, Vicuna, AdvBench, and MMLU. These metrics provide comprehensive
coverage of conversational quality, instruction following, safety, and factual knowledge.</p>
        <p>For evaluating PIE avoidance (H3), we will categorize recommendations into three buckets:
• Invalid Recommendation: The recommendation fails to satisfy the user’s explicit query
constraints
• In-PIE Recommendation: The recommendation is valid but reinforces the user’s existing PIE,
ofering little novelty.
• Out-PIE Recommendation: The recommendation is valid and successfully steers the user away
from their established PIE.</p>
        <p>Consider two illustrative cases: (1) a user seeking a cute animal video but aiming to avoid cat videos,
having been overexposed to them; and (2) a user searching for Italian food recipes while wanting to
avoid tomatoes due to over-personalized exposure. Table 3 presents representative examples of each
recommendation type for these PIE contexts.</p>
        <p>After running query tests, the number of recommendations in each buckets for diferent strategies
will allow us to quantify the tradeof between respecting user’s stated preferences and introducing
novel, out-of-distribution content in recommendations. This would allow us to assess each strategy’s
efectiveness in balancing personalization and recommendation diversity.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Reflection and Future Work</title>
      <sec id="sec-7-1">
        <title>Are there any limitations in your approach?</title>
        <p>A key limitation of our approach lies in the scalability of large language models in federated learning
environments. While our experiments show that relatively small models like Qwen3-0.6B can still yield
strong performance, larger models could achieve even better results in both reasoning and generalization.
However, using larger models significantly narrows the pool of eligible client devices in FL, as they
demand greater computational resources and memory. This presents a tradeof between model capacity
and practical deployability across a diverse, decentralized user base.</p>
      </sec>
      <sec id="sec-7-2">
        <title>What are your planned next steps to complete your investigation?</title>
        <p>Our immediate next steps are focused on two fronts. First, we will implement and rigorously evaluate
the KG adaptation strategy to test its efectiveness in enabling LLMs to recommend outside a user’s
PIE without compromising relevance. Second, we will conduct a thorough diferential privacy
analysis, comparing the performance resilience of KTO and DPO across varying privacy budgets. These
experiments will help validate H2 and H3 and further assess the broader potential of our KGC model
to operate efectively in decentralized, privacy-preserving, and user-adaptive settings.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used ChatGPT, Gemini and Grammarly in order to
rephrase some of the sentences and also to fix grammar and spelling issues. After using these tools
and services, the authors reviewed and edited the content as needed and take full responsibility for the
publication’s content.
[14] C. Dwork, F. McSherry, K. Nissim, A. Smith, Calibrating noise to sensitivity in private data analysis, in: Theory of
Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings
3, Springer, 2006, pp. 265–284.
[15] A. Saeidi, S. Verma, M. N. Uddin, C. Baral, Insights into alignment: Evaluating dpo and its variants across multiple tasks,
arXiv preprint arXiv:2404.14723 (2024).
[16] F. Spadea, O. Seneviratne, Federated fine-tuning of large language models: Kahneman-Tversky vs. direct preference
optimization, arXiv preprint arXiv:2502.14187 (2025).
[17] R. Taori, I. Gulrajani, T. Zhang, Y. Dubois, X. Li, C. Guestrin, P. Liang, T. B. Hashimoto, Stanford alpaca: An
instructionfollowing LLaMA model, https://github.com/tatsu-lab/stanford_alpaca, 2023.
[18] 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 (2023) 46595–46623.
[19] W.-L. Chiang, Z. Li, Z. Lin, Y. Sheng, Z. Wu, H. Zhang, L. Zheng, S. Zhuang, Y. Zhuang, J. E. Gonzalez, et al., Vicuna: An
open-source chatbot impressing gpt-4 with 90%* chatgpt quality, See https://vicuna. lmsys. org (accessed 14 April 2023)
2 (2023) 6.
[20] A. Zou, Z. Wang, N. Carlini, M. Nasr, J. Z. Kolter, M. Fredrikson, Universal and transferable adversarial attacks on aligned
language models, 2023. URL: https://arxiv.org/abs/2307.15043. arXiv:2307.15043.
[21] D. Hendrycks, C. Burns, S. Basart, A. Zou, M. Mazeika, D. Song, J. Steinhardt, Measuring massive multitask language
understanding, 2020.
[22] R. Li, S. Ebrahimi Kahou, H. Schulz, V. Michalski, L. Charlin, C. Pal, Towards deep conversational recommendations,</p>
      <p>Advances in neural information processing systems 31 (2018).
[23] Hugging Face, ReDial dataset, https://huggingface.co/datasets/community-datasets/re_dial, 2024.
[24] Hugging Face, Qwen3-0.6b, https://huggingface.co/Qwen/Qwen3-0.6B, 2024.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>B.</given-names>
            <surname>McMahan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Moore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ramage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hampson</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. A. y Arcas</surname>
          </string-name>
          ,
          <article-title>Communication-eficient learning of deep networks from decentralized data</article-title>
          ,
          <source>in: Artificial intelligence and statistics</source>
          , PMLR,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>Unifying large language models and knowledge graphs: A roadmap</article-title>
          ,
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>36</volume>
          (
          <year>2024</year>
          )
          <fpage>3580</fpage>
          -
          <lpage>3599</lpage>
          . doi:
          <volume>10</volume>
          .1109/TKDE.
          <year>2024</year>
          .
          <volume>3352100</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Nathani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chauhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kaul</surname>
          </string-name>
          ,
          <article-title>Learning attention-based embeddings for relation prediction in knowledge graphs</article-title>
          , arXiv preprint arXiv:
          <year>1906</year>
          .
          <volume>01195</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Cai,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Learning hierarchy-aware knowledge graph embeddings for link prediction</article-title>
          ,
          <source>in: Proceedings of the AAAI conference on artificial intelligence</source>
          , volume
          <volume>34</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>3065</fpage>
          -
          <lpage>3072</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          , Fede:
          <article-title>Embedding knowledge graphs in federated setting</article-title>
          ,
          <source>in: Proceedings of the 10th International Joint Conference on Knowledge Graphs</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>80</fpage>
          -
          <lpage>88</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          , Openfedllm:
          <article-title>Training large language models on decentralized private data via federated learning</article-title>
          ,
          <source>in: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>6137</fpage>
          -
          <lpage>6147</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , S. Chen, FedLLM-Bench:
          <article-title>Realistic benchmarks for federated learning of large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2406.04845</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>
            <given-names>S.</given-names>
            <surname>Ermon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Finn</surname>
          </string-name>
          ,
          <article-title>Direct preference optimization: your language model is secretly a reward model</article-title>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>L.-P.</given-names>
            <surname>Meyer</surname>
          </string-name>
          , C. Stadler,
          <string-name>
            <given-names>J.</given-names>
            <surname>Frey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Radtke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Junghanns</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Meissner</surname>
          </string-name>
          , G. Dziwis,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bulert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <article-title>Llm-assisted knowledge graph engineering: Experiments with chatgpt</article-title>
          ,
          <source>in: Working conference on Artificial Intelligence Development for a Resilient and Sustainable Tomorrow</source>
          , Springer Fachmedien Wiesbaden Wiesbaden,
          <year>2023</year>
          , pp.
          <fpage>103</fpage>
          -
          <lpage>115</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pan</surname>
          </string-name>
          , A. W.-C. Liew,
          <article-title>Unveiling user preferences: A knowledge graph and llm-driven approach for conversational recommendation</article-title>
          ,
          <source>arXiv preprint arXiv:2411.14459</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Donkers</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Ziegler,</surname>
          </string-name>
          <article-title>The dual echo chamber: Modeling social media polarization for interventional recommending</article-title>
          ,
          <source>in: Proceedings of the 15th ACM conference on recommender systems</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>12</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Anand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Mitigating filter bubbles within deep recommender systems</article-title>
          ,
          <source>arXiv preprint arXiv:2209.08180</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>K.</given-names>
            <surname>Ethayarajh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Muennighof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jurafsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiela</surname>
          </string-name>
          , KTO:
          <article-title>Model alignment as prospect theoretic optimization</article-title>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>