<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>LLMs on DASYA</title>
    <link>https://dasya.itu.dk/tags/llms/</link>
    <description>Recent content in LLMs on DASYA</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <copyright>© DASYA, IT University of Copenhagen</copyright>
    <lastBuildDate>Wed, 05 Aug 2026 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://dasya.itu.dk/tags/llms/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>Agents and Storage Interaction</title>
      <link>https://dasya.itu.dk/for-students/proposals/current/pito-llm-agents/</link>
      <pubDate>Wed, 05 Aug 2026 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/current/pito-llm-agents/</guid>
      <description>This project would investigate the storage access patterns of LLM agents using open-source state-of-the-art inference frameworks such as vLLM and SGLang and workload traces such as the ones released by Mooncake, Alibaba, Swiss AI Initiative, etc. Depending on the size and duration of the project, it can also propose or implement optimizations for the storage access.
This project would be suitable as a standalone project, a research project with an MSc thesis followup, or BSc thesis.</description>
    </item>
    
    <item>
      <title>KV-Cache and Storage Interaction</title>
      <link>https://dasya.itu.dk/for-students/proposals/current/pito-llm-kvcache/</link>
      <pubDate>Wed, 05 Aug 2026 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/current/pito-llm-kvcache/</guid>
      <description>This project would investigate key-value(KV)-cache offloading in large language model (LLM) inference engines, with particular emphasis on data placement and storage efficiency. First, the project would use an emulator such as FEMU to characterize workload access patterns, including hot-key distributions, write intensity, and write amplification factor (WAF). Then, we would evaluate the potential of Flexible Data Placement (FDP) for improving data placement decisions on SSDs for KV-cache accesses.
The project will use open source state-of-the-art KV-cache types such as LMCache or the ones implemented by the inference frameworks such as vLLM and SGLang.</description>
    </item>
    
    <item>
      <title>Building a Game with LLM Randomness: From Play to Personas</title>
      <link>https://dasya.itu.dk/for-students/proposals/current/mh-llm-rng-personas/</link>
      <pubDate>Fri, 24 Jul 2026 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/current/mh-llm-rng-personas/</guid>
      <description>BSc Thesis.
This project builds on a previous master&amp;rsquo;s thesis, Prompting Luck: Bias and Manipulability in LLM-Generated Randomness, that explored replacing traditional random number generators (RNG) in games with large language models (LLMs). The idea is that an LLM can produce &amp;ldquo;intelligent&amp;rdquo; random numbers, for example the outcome of a slot machine spin, that take context into account rather than being drawn from a uniform distribution. The goal of this project is to experimentally validate the findings of that thesis by building an actual game, connecting it to an LLM, and putting the idea to the test with real players.</description>
    </item>
    
    <item>
      <title>&#34;Intelligent&#34; Randomness: Can LLMs Make Games More Fun?</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-llm-vs-rng/</link>
      <pubDate>Thu, 20 Nov 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-llm-vs-rng/</guid>
      <description>BSc Thesis / MSc Thesis.
The goal of this project is to explore the feasibility and impact of replacing traditional random number generators (RNG) in games with large language models (LLMs). For example, in a slot machine game, the outcome is typically determined by a random number generated each time the &amp;ldquo;spin&amp;rdquo; button is pressed. In this project, students will investigate using an LLM to generate these numbers instead.
Research questions include:</description>
    </item>
    
    <item>
      <title>Good or Bad: LLM-Generated Datasets</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/mh-generated-dataset/</link>
      <pubDate>Wed, 02 Jul 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/mh-generated-dataset/</guid>
      <description>(MSc Research Project / MSc Thesis)
The goal of this project is to research how AI and large language models generate datasets. Research questions include: Where does the generated data come from? Are sources available on the internet or can they be found? What biases exist in the generated data? And how much of the data is simply wrong? Generated datasets are used in many fields in practice, including journalism (e.</description>
    </item>
    
    <item>
      <title>Combine Knowledge Graph Embeddings and Reasoning</title>
      <link>https://dasya.itu.dk/for-students/proposals/current/zk-kges/</link>
      <pubDate>Wed, 28 May 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/current/zk-kges/</guid>
      <description>Knowledge graphs (KGs) are extensively used in many application domains, such as search engines, product recommendation, and bioinformatics. Knowledge graph completion (a.k.a.~link prediction), i.e.,~the task of inferring missing information from knowledge graphs, is a widely used task in the above applications. This project will investigate how to loosely-couple the data-driven power of knowledge graph embeddings with domain-specific reasoning stemming from experts or reasoning systems. In this way, we not only enhance the prediction accuracy with domain knowledge that may not be included in the input knowledge graph but also allow users to plugin their own knowledge graph embedding and reasoning method.</description>
    </item>
    
    <item>
      <title>MCP server for Apache Wayang</title>
      <link>https://dasya.itu.dk/for-students/proposals/current/zk-apachewayang-mcp/</link>
      <pubDate>Wed, 28 May 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/current/zk-apachewayang-mcp/</guid>
      <description>Are you interested in working with a big data open source project and AI?
You are welcome to conduct your thesis/project in the context of Apache Wayang. Apache Wayang is the first cross-platform framework that allows users to specify their task/query in a system-agnostic manner and Wayang will determine which is the best system(s) to execute this task with the goal of optimizing performance. For a general overview check this paper.</description>
    </item>
    
  </channel>
</rss>