Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2501.10365

Help | Advanced Search

Computer Science > Computers and Society

arXiv:2501.10365 (cs)
[Submitted on 9 Dec 2024 ]

Title: Can LLMs Identify Gaps and Misconceptions in Students' Code Explanations?

Title: LLMs能否识别学生代码解释中的漏洞和误解?

Authors:Priti Oli, Rabin Banjade, Andrew M. Olney, Vasile Rus
Abstract: This paper investigates various approaches using Large Language Models (LLMs) to identify gaps and misconceptions in students' self-explanations of specific instructional material, in our case explanations of code examples. This research is a part of our larger effort to automate the assessment of students' freely generated responses, focusing specifically on their self-explanations of code examples during activities related to code comprehension. In this work, we experiment with zero-shot prompting, Supervised Fine-Tuning (SFT), and preference alignment of LLMs to identify gaps in students' self-explanation. With simple prompting, GPT-4 consistently outperformed LLaMA3 and Mistral in identifying gaps and misconceptions, as confirmed by human evaluations. Additionally, our results suggest that fine-tuned large language models are more effective at identifying gaps in students' explanations compared to zero-shot and few-shot prompting techniques. Furthermore, our findings show that the preference optimization approach using Odds Ratio Preference Optimization (ORPO) outperforms SFT in identifying gaps and misconceptions in students' code explanations.
Abstract: 本文研究了使用大型语言模型(LLMs)的各种方法,以识别学生在特定教学材料自我解释中的差距和误解,我们的情况是代码示例的解释。 这项研究是我们更大努力的一部分,旨在自动化评估学生自由生成的回答,特别关注他们在与代码理解相关的活动中的自我解释。 在这项工作中,我们尝试了零样本提示、监督微调(SFT)和大型语言模型的偏好对齐,以识别学生自我解释中的差距。 通过简单的提示,GPT-4在识别差距和误解方面始终优于LLaMA3和Mistral,这经过人工评估得到了确认。 此外,我们的结果表明,微调后的大型语言模型在识别学生解释中的差距方面比零样本和少样本提示技术更有效。 此外,我们的研究结果表明,使用几率比偏好优化(ORPO)的偏好优化方法在识别学生代码解释中的差距和误解方面优于SFT。
Subjects: Computers and Society (cs.CY) ; Artificial Intelligence (cs.AI); Software Engineering (cs.SE)
Cite as: arXiv:2501.10365 [cs.CY]
  (or arXiv:2501.10365v1 [cs.CY] for this version)
  https://doi.org/10.48550/arXiv.2501.10365
arXiv-issued DOI via DataCite

Submission history

From: Priti Oli [view email]
[v1] Mon, 9 Dec 2024 19:42:23 UTC (2,773 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.CY
< prev   |   next >
new | recent | 2025-01
Change to browse by:
cs
cs.AI
cs.SE

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号