scispace - formally typeset
Open AccessProceedings Article

Learning Program Embeddings to Propagate Feedback on Student Code

Reads0
Chats0
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
Proceedings ArticleDOI

A Memory-Augmented Neural Model for Automated Grading

TL;DR: An efficient memory networks-powered automated grading model for essay writing and open-ended assignments that learns to predict a score for an ungraded response by computing the relevance between the un graded response and each selected response in memory.
Proceedings Article

Coda: An End-to-End Neural Program Decompiler

TL;DR: Coda1 is proposed, the first end-to-end neural-based framework for code decompilation and reveals the vulnerability of binary executables and imposes a new threat to the protection of Intellectual Property (IP) for software development.
Journal ArticleDOI

Deep Reinforcement Learning for Syntactic Error Repair in Student Programs

TL;DR: A novel programming language correction framework amenable to reinforcement learning that allows an agent to mimic human actions for text navigation and editing and demonstrates that the agent can be trained through self-exploration directly from the raw input, that is, program text itself, without either supervision or any prior knowledge of the formal syntax of the programming language.
Proceedings Article

Learning continuous semantic representations of symbolic expressions

TL;DR: This paper proposed neural equivalence networks, which combine abstract, symbolic reasoning with continuous neural reasoning to learn continuous semantic representations of algebraic and logical expressions, even of expressions that are syntactically very different.
Proceedings ArticleDOI

Misconception-Driven Feedback: Results from an Experimental Study

TL;DR: Describing analysis from the study indicating the MDF student model allows for complex analysis of student mistakes and misconceptions that can suggest improvements to the feedback, the instruction, and to specific students is presented.
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)