Preprint10.48550/arxiv.2406.08828
Estimating Difficulty Levels of Programming Problems with Pre-trained Model
Zhiyuan Wang,Wei Emma Zhang,Jun Wang +2 more
- 13 Jun 2024
TL;DR: Estimating difficulty levels of programming problems with pre-trained model is a task that aims to guide students' adaptive learning. The proposed approach utilizes text and code modalities through pre-trained models to estimate difficulty levels accurately.
read more
Abstract: As the demand for programming skills grows across industries and academia, students often turn to Programming Online Judge (POJ) platforms for coding practice and competition. The difficulty level of each programming problem serves as an essential reference for guiding students' adaptive learning. However, current methods of determining difficulty levels either require extensive expert annotations or take a long time to accumulate enough student solutions for each problem. To address this issue, we formulate the problem of automatic difficulty level estimation of each programming problem, given its textual description and a solution example of code. For tackling this problem, we propose to couple two pre-trained models, one for text modality and the other for code modality, into a unified model. We built two POJ datasets for the task and the results demonstrate the effectiveness of the proposed approach and the contributions of both modalities.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
References
•Posted Content
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
TL;DR: A new language representation model, BERT, designed to pre-train deep bidirectional representations from unlabeled text by jointly conditioning on both left and right context in all layers, which can be fine-tuned with just one additional output layer to create state-of-the-art models for a wide range of tasks.
81.7K
XGBoost: A Scalable Tree Boosting System
Tianqi Chen,Carlos Guestrin +1 more
TL;DR: This paper proposes a novel sparsity-aware algorithm for sparse data and weighted quantile sketch for approximate tree learning and provides insights on cache access patterns, data compression and sharding to build a scalable tree boosting system called XGBoost.
•Posted Content
GraphCodeBERT: Pre-training Code Representations with Data Flow
Daya Guo,Shuo Ren,Shuai Lu,Zhangyin Feng,Duyu Tang,Shujie Liu,Long Zhou,Nan Duan,Alexey Svyatkovskiy,Fu Shengyu,Michele Tufano,Shao Kun Deng,Colin B. Clement,Dawn Drain,Neel Sundaresan,Jian Yin,Daxin Jiang,Ming Zhou +17 more
TL;DR: Results show that code structure and newly introduced pre-training tasks can improve GraphCodeBERT and achieves state-of-the-art performance on the four downstream tasks and it is shown that the model prefers structure-level attentions over token- level attentions in the task of code search.
790
A Framework for Intelligent Knowledge Sequencing and Task Sequencing
Peter Brusilovsky
- 10 Jun 1992
TL;DR: Several additional components are suggested that have been designed to complete the framework for intelligent knowledge and task sequencing and a pragmatic strategy for multiple-kind, multiple-concept task sequencing based upon the framework is described.
Cluster Analysis to Estimate the Difficulty of Programming Problems
Chowdhury Md Intisar,Yutaka Watanobe +1 more
- 01 Nov 2018
TL;DR: This research has proposed an expert system which is based on fuzzy rules derivation which was compared with 3 different learning models (Decision tree, Random forest, K-nearest neighbor).




