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

Jiashu Yao

dblp:379/5887 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 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.

Artificial intelligence
4 papers
Language models and text generation · 65% Reinforcement learning · 22% Knowledge representation and reasoning · 13%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
instruction following
1.722025
HomeBench: Evaluating LLMs in Smart Homes with Valid and Invalid Instructions Across Single and Multiple Devices · ACL (1) 2025
ReFF: Reinforcing Format Faithfulness in Language Models Across Varied Tasks · AAAI 2025
Natural language and speech › Language models and text generation › large language model
large reasoning model
1.012026
Incorporating Self-Rewriting into Large Language Model Reasoning Reinforcement · AAAI 2026
Machine learning › Reinforcement learning
reinforcement learning for reasoning
1.012026
Incorporating Self-Rewriting into Large Language Model Reasoning Reinforcement · AAAI 2026
Natural language and speech › Language models and text generation
knowledge editing
0.812024
FAME: Towards Factual Multi-Task Model Editing · EMNLP 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning › belief change
knowledge update
0.812024
FAME: Towards Factual Multi-Task Model Editing · EMNLP 2024
Machine learning › Reinforcement learning › reward learning
self-rewarding
0.312026
Incorporating Self-Rewriting into Large Language Model Reasoning Reinforcement · AAAI 2026
Ubiquitous computing and smart environments
smart home
0.312025
HomeBench: Evaluating LLMs in Smart Homes with Valid and Invalid Instructions Across Single and Multiple Devices · ACL (1) 2025

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

reinforcement learning · 1.9retrieval-augmented generation · 1.7in-context learning · 1.7fine-tuning · 1.7self-rewriting · 1.0GRPO · 1.0interpretability analysis · 0.9format checker · 0.9caching mechanism · 0.8
YearPublicationVenuePosition
2026 Incorporating Self-Rewriting into Large Language Model Reasoning Reinforcement
abstract
Through reinforcement learning (RL) with outcome correctness rewards, large reasoning models (LRMs) with scaled inference computation have demonstrated substantial success on complex reasoning tasks. However, the one-sided reward, focused solely on final correctness, limits its ability to provide detailed supervision over internal reasoning process. This deficiency leads to suboptimal internal reasoning quality, manifesting as issues like over-thinking, under-thinking, redundant-thinking, and disordered-thinking. Inspired by the recent progress in LRM self-rewarding, we introduce self-rewriting framework, where a model rewrites its own reasoning texts, and subsequently learns from the rewritten reasoning to improve the internal thought process quality. For algorithm design, we propose a selective rewriting approach wherein only "simple" samples, defined by the model's consistent correctness, are rewritten, thereby preserving all original reward signals of GRPO. For practical implementation, we compile rewriting and vanilla generation within one single batch, maintaining the scalability of the RL algorithm and introducing only 10% overhead. Extensive experiments on diverse tasks with different model sizes validate the effectiveness of self-rewriting. In terms of the accuracy-length tradeoff, the self-rewriting approach achieves improved accuracy (+0.6) with substantially shorter reasoning (-46%) even without explicit instructions in rewriting prompts to reduce reasoning length, outperforming existing strong baselines. In terms of internal reasoning quality, self-rewriting achieves significantly higher scores (+7.2) under the LLM-as-a-judge metric, successfully mitigating internal reasoning flaws.
Jiashu Yao, Heyan Huang, Shuang Zeng, Chuwei Luo, WangJie You, Jie Tang 0001, Yuhang Guo 0001, Yangyang Kang
AAAI1
2025 ReFF: Reinforcing Format Faithfulness in Language Models Across Varied Tasks
abstract
Following formatting instructions to generate well-structured content is a fundamental yet often unmet capability for large language models (LLMs). To study this capability, which we refer to as format faithfulness, we present FormatBench, a comprehensive format-related benchmark. Compared to previous format-related benchmarks, FormatBench involves a greater variety of tasks in terms of application scenes (traditional NLP tasks, creative works, autonomous agency tasks), human-LLM interaction styles (single-turn instruction, multi-turn chat), and format types (inclusion, wrapping, length, coding). Moreover, each task in FormatBench is attached with a format checker program. Extensive experiments on the benchmark reveal that state-of-the-art open- and closed-source LLMs still suffer from severe deficiency in format faithfulness. By virtue of the decidable nature of formats, we propose to Reinforce Format Faithfulness (ReFF) to help LLMs generate formatted output as instructed without compromising general quality. Without any annotated data, ReFF can substantially improve the format faithfulness rate (e.g., from 21.6% in original LLaMA3 to 95.0% on caption segmentation task), while keep the general quality comparable (e.g., from 47.3 to 46.4 in F1 scores). Combined with labeled training data, ReFF can simultaneously improve both format faithfulness (e.g., from 21.6% in original LLaMA3 to 75.5%) and general quality (e.g., from 47.3 to 61.6 in F1 scores). We further offer an interpretability analysis to explain how ReFF improves both format faithfulness and general quality.
Jiashu Yao, Heyan Huang, Zeming Liu, Haoyu Wen, Boao Qian, Yuhang Guo 0001
AAAI1
2025 HomeBench: Evaluating LLMs in Smart Homes with Valid and Invalid Instructions Across Single and Multiple Devices
abstract
Large language models (LLMs) have the potential to revolutionize smart home assistants by enhancing their ability to accurately understand user needs and respond appropriately, which is extremely beneficial for building a smarter home environment.While recent studies have explored integrating LLMs into smart home systems, they primarily focus on handling straightforward, valid single-device operation instructions.However, real-world scenarios are far more complex and often involve users issuing invalid instructions or controlling multiple devices simultaneously.These have two main challenges: LLMs must accurately identify and rectify errors in user instructions and execute multiple user instructions perfectly.To address these challenges and advance the development of LLM-based smart home assistants, we introduce HomeBench, the first smart home dataset with valid and invalid instructions across single and multiple devices in this paper.We have experimental results on 13 distinct LLMs; e.g., GPT-4o achieves only a 0.0% success rate in the scenario of invalid multi-device instructions, revealing that the existing stateof-the-art LLMs still cannot perform well in this situation even with the help of in-context learning, retrieval-augmented generation, and fine-tuning.Our code and dataset are publicly available at the link 1 .
Silin Li, Yuhang Guo 0001, Jiashu Yao, Zeming Liu, Haifeng Wang 0001
ACL (1)3
2025 Hiperti: high performance system for cross-platform code generation of transformer model inference based on MLIR
Jiashu Yao, Junmin Xiao, Baokang Xie, Shilong Xu, Yunfei Pang, Yun Song, Guangming Tan
CCF Trans. High Perform. Comput.1
2024 FAME: Towards Factual Multi-Task Model Editing
abstract
Large language models (LLMs) embed extensive knowledge and utilize it to perform exceptionally well across various tasks.Nevertheless, outdated knowledge or factual errors within LLMs can lead to misleading or incorrect responses, causing significant issues in practical applications.To rectify the fatal flaw without the necessity for costly model retraining, various model editing approaches have been proposed to correct inaccurate knowledge within LLMs in a cost-efficient way.To evaluate these model editing methods, previous work introduced a series of datasets.However, most of the previous datasets only contain fabricated data in a single format, which diverges from realworld model editing scenarios, raising doubts about their usability in practice.To facilitate the application of model editing in real-world scenarios, we propose the challenge of practicality.To resolve such challenges and effectively enhance the capabilities of LLMs, we present FAME, an factual, comprehensive, and multi-task dataset, which is designed to enhance the practicality of model editing.We then propose SKEME, a model editing method that uses a novel caching mechanism to ensure synchronization with the real world.The experiments demonstrate that SKEME performs excellently across various tasks and scenarios, confirming its practicality.
Zeng Li 0002, Yingyu Shan, Zeming Liu, Jiashu Yao, Yuhang Guo 0001
EMNLP4