Experience Report: Standards-Based Grading at Scale in Algorithms

• URL: http://arxiv.org/abs/2204.12046v1
• Date: Tue, 26 Apr 2022 02:52:58 GMT
• Title: Experience Report: Standards-Based Grading at Scale in Algorithms
• Authors: Lijun Chen, Joshua A. Grochow, Ryan Layer, Michael Levet
• Abstract summary: The course had 200-400 students, taught by two instructors, eight graduate teaching assistants, and supported by two additional graders and several undergraduate course assistants. We highlight the role of standards-based grading in supporting our students during the COVID-19 pandemic.
• Score: 2.093287944284448
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We report our experiences implementing standards-based grading at scale in an Algorithms course, which serves as the terminal required CS Theory course in our department's undergraduate curriculum. The course had 200-400 students, taught by two instructors, eight graduate teaching assistants, and supported by two additional graders and several undergraduate course assistants. We highlight the role of standards-based grading in supporting our students during the COVID-19 pandemic. We conclude by detailing the successes and adjustments we would make to the course structure.

Related papers

• Grad-ELLM: Gradient-based Explanations for Decoder-only LLMs [52.15785423211181]
  Grad-ELLM is a gradient-based attribution method for decoder-only transformer-based Large Language Models.<n>We introduce two faithfulneses metrics $$-Soft-NC and $$-Soft-NS, which provide fairer comparisons.<n>Experiment results show that Grad-ELLM consistently achieves superior faithfulness than other attribution methods.
  arXiv  Detail & Related papers  (2026-01-06T15:22:39Z)
• Introductory Courses on Digital Twins: an Experience Report [0.4233176571117095]
  We describe two new courses on model-based approaches to the engineering of Digital Twins.<n>One course was delivered to doctoral students from a range of largely non-computational backgrounds, and the other to Masters students with computing experience.
  arXiv  Detail & Related papers  (2025-12-17T14:58:11Z)
• Grade Like a Human: Rethinking Automated Assessment with Large Language Models [11.442433408767583]
  Large language models (LLMs) have been used for automated grading, but they have not yet achieved the same level of performance as humans. We propose an LLM-based grading system that addresses the entire grading procedure, including the following key components.
  arXiv  Detail & Related papers  (2024-05-30T05:08:15Z)
• Class Gradient Projection For Continual Learning [99.105266615448]
  Catastrophic forgetting is one of the most critical challenges in Continual Learning (CL) We propose Class Gradient Projection (CGP), which calculates the gradient subspace from individual classes rather than tasks.
  arXiv  Detail & Related papers  (2023-11-25T02:45:56Z)
• TBGC: Task-level Backbone-Oriented Gradient Clip for Multi-Task Foundation Model Learning [0.0]
  We propose the task-level backbone-oriented gradient clip paradigm, compared with the vanilla gradient clip method. Based on the experimental results, we argue that the task-level backbone-oriented gradient clip paradigm can relieve the gradient bias problem to some extent. Our approach has been shown to be effective and finally achieve 1st place in the Leaderboard A and 2nd place in the Leaderboard B of the CVPR2023 Foundation Model Challenge.
  arXiv  Detail & Related papers  (2023-07-07T08:57:57Z)
• Low-complexity deep learning frameworks for acoustic scene classification using teacher-student scheme and multiple spectrograms [59.86658316440461]
  The proposed system comprises two main phases: (Phase I) Training a teacher network; and (Phase II) training a student network using distilled knowledge from the teacher. Our experiments conducted on DCASE 2023 Task 1 Development dataset have fulfilled the requirement of low-complexity and achieved the best classification accuracy of 57.4%.
  arXiv  Detail & Related papers  (2023-05-16T14:21:45Z)
• Learning What Not to Segment: A New Perspective on Few-Shot Segmentation [63.910211095033596]
  Recently few-shot segmentation (FSS) has been extensively developed. This paper proposes a fresh and straightforward insight to alleviate the problem. In light of the unique nature of the proposed approach, we also extend it to a more realistic but challenging setting.
  arXiv  Detail & Related papers  (2022-03-15T03:08:27Z)
• Course Difficulty Estimation Based on Mapping of Bloom's Taxonomy and ABET Criteria [0.0]
  We propose a methodology that estimates the difficulty level of a course. The estimated difficulty level is validated based on the history of grades secured by the students.
  arXiv  Detail & Related papers  (2021-11-16T12:53:21Z)
• Generalized and Incremental Few-Shot Learning by Explicit Learning and Calibration without Forgetting [86.56447683502951]
  We propose a three-stage framework that allows to explicitly and effectively address these challenges. We evaluate the proposed framework on four challenging benchmark datasets for image and video few-shot classification.
  arXiv  Detail & Related papers  (2021-08-18T14:21:43Z)
• ProtoTransformer: A Meta-Learning Approach to Providing Student Feedback [54.142719510638614]
  In this paper, we frame the problem of providing feedback as few-shot classification. A meta-learner adapts to give feedback to student code on a new programming question from just a few examples by instructors. Our approach was successfully deployed to deliver feedback to 16,000 student exam-solutions in a programming course offered by a tier 1 university.
  arXiv  Detail & Related papers  (2021-07-23T22:41:28Z)
• Curriculum Learning: A Survey [65.31516318260759]
  Curriculum learning strategies have been successfully employed in all areas of machine learning. We construct a taxonomy of curriculum learning approaches by hand, considering various classification criteria. We build a hierarchical tree of curriculum learning methods using an agglomerative clustering algorithm.
  arXiv  Detail & Related papers  (2021-01-25T20:08:32Z)
• A Berkeley View of Teaching CS at Scale [19.08810272234958]
  The Computer Science program at the University of California, Berkeley has tripled the size of its graduating class in five years. This report presents three strategies that have enabled the effective teaching, delivery, and management of large-scale CS courses.
  arXiv  Detail & Related papers  (2020-04-28T17:33:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.