paper-with-me

Papers

Can Generative Pre-trained Transformers (GPT) Pass Assessments in Higher Education Programming Courses?

2023-03-16 · Jaromir Savelka, Arav Agarwal, Christopher Bogart, YiFan Song, Majd Sakr

We evaluated the capability of generative pre-trained transformers (GPT), to pass assessments in introductory and intermediate Python programming courses at the postsecondary level. Discussions of potential uses (e.g., exercise generation, code explanation) and misuses (e.g., cheating) of this emerging technology in programming education have intensified, but to date there has not been a rigorous analysis of the models' capabilities in the realistic context of a full-fledged programming course with diverse set of assessment instruments. We evaluated GPT on three Python courses that employ assessments ranging from simple multiple-choice questions (no code involved) to complex programming projects with code bases distributed into multiple files (599 exercises overall). Further, we studied if and how successfully GPT models leverage feedback provided by an auto-grader. We found that the current models are not capable of passing the full spectrum of assessments typically involved in a Python programming course (<70% on even entry-level modules). Yet, it is clear that a straightforward application of these easily accessible models could enable a learner to obtain a non-trivial portion of the overall available score (>55%) in introductory and intermediate courses alike. While the models exhibit remarkable capabilities, including correcting solutions based on auto-grader's feedback, some limitations exist (e.g., poor handling of exercises requiring complex chains of reasoning steps). These findings can be leveraged by instructors wishing to adapt their assessments so that GPT becomes a valuable assistant for a learner as opposed to an end-to-end solution.

📄 PDF Abstract BibTeX arXiv:2303.09325

Code (0)

등록된 구현이 없습니다.

Tasks

Multiple-choice

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Residual Connection 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Weight Decay 설명 없음

Similar Papers 제목 키워드 기반

Thrilled by Your Progress! Large Language Models (GPT-4) No Longer Struggle to Pass Assessments in Higher Education Programming Courses

2023-06-15 · Jaromir Savelka, Arav Agarwal, Marshall An, Chris Bogart 외

This paper studies recent developments in large language models' (LLM) abilities to pass assessments in introductory and intermediate Python programming courses at the postsecondary level. The emergence of ChatGPT result…

Multiple-choice

Could ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants

2024-08-07 · Beatriz Borges, Negar Foroutan, Deniz Bayazit, Anna Sotnikova 외

AI assistants are being increasingly used by students enrolled in higher education institutions. While these tools provide opportunities for improved teaching and education, they also pose significant challenges for asse…

Transformers Generalize DeepSets and Can be Extended to Graphs & Hypergraphs

2021-05-21 · NeurIPS 2021 12 · Jinwoo Kim, Saeyoon Oh, Seunghoon Hong

We present a generalization of Transformers to any-order permutation invariant data (sets, graphs, and hypergraphs). We begin by observing that Transformers generalize DeepSets, or first-order (set-input) permutation inv…

2kGraph Regression

Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphs

2021-10-27 · NeurIPS 2021 12 · Jinwoo Kim, Saeyoon Oh, Seunghoon Hong

We present a generalization of Transformers to any-order permutation invariant data (sets, graphs, and hypergraphs). We begin by observing that Transformers generalize DeepSets, or first-order (set-input) permutation inv…

2kGraph RegressionHyperedge PredictionSet-to-Graph Prediction

A Modern Perspective on Query Likelihood with Deep Generative Retrieval Models

2021-06-25 · Oleg Lesota, Navid Rekabsaz, Daniel Cohen, Klaus Antonius Grasserbauer 외

Existing neural ranking models follow the text matching paradigm, where document-to-query relevance is estimated through predicting the matching score. Drawing from the rich literature of classical generative retrieval m…

Passage Re-RankingPassage RetrievalRe-RankingRetrieval+1