scispace - formally typeset
Open AccessProceedings Article

Learning Program Embeddings to Propagate Feedback on Student Code

TLDR
A neural network method is introduced to encode programs as a linear mapping from an embedded precondition space to an embedded postcondition space and an algorithm for feedback at scale is proposed using these linear maps as features.
Abstract
Providing feedback, both assessing final work and giving hints to stuck students, is difficult for open-ended assignments in massive online classes which can range from thousands to millions of students. We introduce a neural network method to encode programs as a linear mapping from an embedded precondition space to an embedded postcondition space and propose an algorithm for feedback at scale using these linear maps as features. We apply our algorithm to assessments from the Code.org Hour of Code and Stanford University's CS1 course, where we propagate human comments on student assignments to orders of magnitude more submissions.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

Flexible Program Alignment to Deliver Data-Driven Feedback to Novice Programmers

TL;DR: In this article, a flexible program alignment based on program dependence graphs is proposed, which enrich with semantic information extracted from the programs, i.e., operations and calls, to find correspondences at the statement level between them.
Book ChapterDOI

API Misuse Detection Based on Stacked LSTM

TL;DR: Wang et al. as mentioned in this paper employed stacked LSTM to learn the API usage specification to detect the API misuse defects, and then they generated API sequences and transformed the sequences into for training.
Journal ArticleDOI

Cross-Lingual Adversarial Domain Adaptation for Novice Programming

TL;DR: This work focuses on two essential SMP tasks: program classification and early prediction of student success and proposes a Cross-Lingual Adversarial Domain Adaptation (CrossLing) framework that can leverage a large programming dataset to learn features that can improve SMP's build using a much smaller dataset in a different programming language.
Dissertation

Artificial intelligence in computer science and mathematics education

David Azcona
TL;DR: This thesis examines how Artificial Intelligence (AI) techniques can help Computer Science students learn programming and mathematics skills more efficiently using algorithms and concepts such as Predictive Modelling, Machine Learning, Deep Learning, Representational Learning, Recommender Systems and Graph Theory.
Proceedings ArticleDOI

Giving Feedback on Interactive Student Programs with Meta-Exploration

TL;DR: This work shows that exploring to discover errors can be cast as a meta-exploration problem, which enables it to construct a principled objective for discovering errors and an algorithm for optimizing this objective, which provides fine-grained feedback.
References
More filters
Proceedings Article

Adaptive Subgradient Methods for Online Learning and Stochastic Optimization.

TL;DR: Adaptive subgradient methods as discussed by the authors dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradient-based learning, which allows us to find needles in haystacks in the form of very predictive but rarely seen features.
Journal Article

Adaptive Subgradient Methods for Online Learning and Stochastic Optimization

TL;DR: This work describes and analyze an apparatus for adaptively modifying the proximal function, which significantly simplifies setting a learning rate and results in regret guarantees that are provably as good as the best proximal functions that can be chosen in hindsight.
Journal Article

Random search for hyper-parameter optimization

TL;DR: This paper shows empirically and theoretically that randomly chosen trials are more efficient for hyper-parameter optimization than trials on a grid, and shows that random search is a natural baseline against which to judge progress in the development of adaptive (sequential) hyper- parameter optimization algorithms.
Proceedings Article

Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank

TL;DR: A Sentiment Treebank that includes fine grained sentiment labels for 215,154 phrases in the parse trees of 11,855 sentences and presents new challenges for sentiment compositionality, and introduces the Recursive Neural Tensor Network.
Book

A complexity measure

TL;DR: In this paper, a graph-theoretic complexity measure for managing and controlling program complexity is presented. But the complexity is independent of physical size, and complexity depends only on the decision structure of a program.
Related Papers (5)