<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection: Year-2024</title>
  <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/1725" />
  <subtitle>Year-2024</subtitle>
  <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/1725</id>
  <updated>2026-09-03T09:24:53Z</updated>
  <dc:date>2026-09-03T09:24:53Z</dc:date>
  <entry>
    <title>RecipeGPT implementation</title>
    <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/2083" />
    <author>
      <name>Gupta, Anmol</name>
    </author>
    <author>
      <name>Gupta, Bhavya</name>
    </author>
    <author>
      <name>Bagler, Bagler, Ganesh (Advisor)</name>
    </author>
    <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/2083</id>
    <updated>2026-09-03T06:19:11Z</updated>
    <published>2024-12-08T00:00:00Z</published>
    <summary type="text">Title: RecipeGPT implementation
Authors: Gupta, Anmol; Gupta, Bhavya; Bagler, Bagler, Ganesh (Advisor)
Abstract: The culinary domain offers significant opportunities for leveraging AI to simplify and enhance recipe-related interactions. This project focuses on developing an intelligent recipe chatbot that performs two primary tasks: (1) generating cooking instructions from a list of ingredients, and (2) predicting ingredients based on given instructions. Using the ”51k Recipes” dataset, which contains detailed recipe information, we explored and fine-tuned various large language models (LLMs), including GPT-2, T5 (Text-To-Text Transfer Transformer), Gemini, etc, to identify the most effective approach for these tasks. Key challenges addressed include handling large datasets, ensuring the relevance and accuracy of outputs, and optimizing models for bidirectional task processing. Through comprehensive preprocessing and fine-tuning using PyTorch, the chatbot was trained to deliver coherent and contextually appropriate responses. The models were evaluated using metrics such as BLEU scores and human feedback, with notable improvements observed in instruction fluency and ingredient prediction accuracy. This project demonstrates the potential of LLMs in culinary applications and sets the ground- work for creating versatile, user-friendly tools for home cooks, professional chefs, and culinary learners. Future work involves refining dataset quality, exploring larger instruction-tuned models, and integrating the chatbot into practical applications such as voice assistants and cooking platforms.</summary>
    <dc:date>2024-12-08T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Learning from dependent data</title>
    <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/2082" />
    <author>
      <name>Sethi, Alhad</name>
    </author>
    <author>
      <name>Mukherjee, Manuj (Advisor)</name>
    </author>
    <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/2082</id>
    <updated>2026-09-03T05:55:48Z</updated>
    <published>2024-11-27T00:00:00Z</published>
    <summary type="text">Title: Learning from dependent data
Authors: Sethi, Alhad; Mukherjee, Manuj (Advisor)
Abstract: In this work, we give generalization bounds of statistical learning algorithms trained on samples drawn from a dependent data source both in expectation and with high probability, using the Online-to-Batch conversion paradigm. We show that the generalization error of statistical learners in the dependent data setting is equivalent to the generalization error of statistical learners in the i.i.d. setting up to a term that depends on the decay rate of the underlying mixing stochastic process. Our proof techniques involve defining a new notion of stability of online learning algorithms based on Wasserstein distances and employing “near-martingale” concentration bounds for dependent random variables to arrive at appropriate upper bounds for the generalization error of statistical learners trained on dependent data. Finally, we prove that the Exponential Weighted Averages (EWA) algorithm satisfies our new notion of stability and instantiate our bounds using the EWA algorithm.</summary>
    <dc:date>2024-11-27T00:00:00Z</dc:date>
  </entry>
</feed>

