Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ying Zheng 0010

dblp:71/5417-10 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0009-0001-3060-6148ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Human-computer interaction and pervasive computing
1 paper
Learning and educational technologies · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%
Artificial intelligence
1 paper
Multi-agent systems · 100%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computing education › educational technology
educational content generation
1.012026
A Compress-Expand Framework for Automatic Lesson Plan Generation · AAAI 2026
Learning and educational technologies
educational content generation
1.012026
COMA: A Collaborative Multi-Role Agent Framework for Automated Lesson Plan Generation · WWW 2026

Methods — techniques the papers use, named apart from their topics

large language model · 3.0multi-role agent framework · 2.0retrieval-augmented generation · 1.0
YearPublicationVenuePosition
2026 A Compress-Expand Framework for Automatic Lesson Plan Generation
abstract
Creating a well-structured lesson plan is essential for improving classroom efficiency, yet it is often a labor-intensive process. Recently, many studies have leveraged large language models (LLMs) to generate lesson plans automatically. However, existing methods heavily rely on LLMs that are pre-trained on large-scale universal corpora, which often lack critical educational theory and textbook-specific information. This can lead to inconsistencies and misalignments with textbook content. To address these challenges, we propose CE-LessonPlan, a novel compress-expand framework to generate lesson plans by effectively combining external lesson plan references and textbook information. The framework consists of two key components: a compressor, which synthesizes multiple retrieved references into a cohesive document, and an expander, which integrates textbook-specific information with the parametric knowledge of LLMs to produce another enriched lesson plan. The outputs of the compressor and expander are then seamlessly integrated to create a comprehensive golden context, further enhancing the lesson plan generation process with LLMs. We conduct extensive experiments to demonstrate that CE-LessonPlan outperforms existing methods for generating lesson plans.
Shuyan Huang, Ying Zheng 0010, Xiaoli Zeng, Zitao Liu 0001
AAAI2
2026 COMA: A Collaborative Multi-Role Agent Framework for Automated Lesson Plan Generation
Xiaoli Zeng, Ying Zheng 0010, Shuyan Huang, Zitao Liu 0001, Mi Tian 0008, Mingliang Hou, Jiaqi Zheng 0012, Wenzhou Dou
WWW2
2025 ArithmeticGPT: empowering small-size large language models with advanced arithmetic skills
Zitao Liu 0001, Ying Zheng 0010, Zhibo Yin, Jiahao Chen 0006, Tianqiao Liu, Mi Tian 0008, Weiqi Luo 0002
Mach. Learn.2
2024 Extending Context Window of Attention Based Knowledge Tracing Models via Length Extrapolation
abstract
Knowledge tracing (KT) is a prediction task that aims to predict students’ future performance based on their past learning data. The rapid progress in attention mechanisms has led to the emergence of various high-performing attention based KT models. However, in online or personalized education settings, students’ varying learning paths result in different lengths of student interaction sequences, which poses a significant challenge for attention based KT models as their context window sizes are fixed during both training and prediction stages. We refer to this as the length extrapolation of KT model. In this paper, we propose extraKT to facilitate better extrapolation that learn from student interactions with a short context window and continue to perform well across various longer context window sizes at prediction stage. Specifically, we negatively bias attention scores with linearly decreasing penalties that are proportional to query-key distance, which efficiently represents short-term forgetting characteristics of student knowledge states. We conduct comprehensive and rigorous experiments on three real-world educational datasets. The results show that our extraKT model exhibits robust length extrapolation capability and outperforms state-of-the-art baseline models in terms of AUC and accuracy. To encourage reproducible research, we merge our data and code to the publicly available pyKT benchmark at https://github.com/pykt-team/pykt-toolkit.
Xueyi Li 0005, Youheng Bai, Teng Guo 0002, Ying Zheng 0010, Mingliang Hou, Bojun Zhan, Yaying Huang, Zitao Liu 0001, Boyu Gao 0003, Weiqi Luo 0002
ECAI4