Zhouchen Lin
Author directory2026
MorphoBench: A Benchmark with Difficulty Adaptive to Model Reasoning
Xukai Wang | Xuanbo Liu | Mingrui Chen | Haitian Zhong | Xuanlin Yang | Bohan Zeng | Jinbo Hu | Hao Liang | Junbo Niu | Xuchen Li | Ruitao Wu | Ruichuan An | Yang Shi | Liu Liu | Qiang Liu | Zhouchen Lin | Xu-Yao Zhang | Wentao Zhang | Bin Dong
Findings of the Association for Computational Linguistics: ACL 2026
Xukai Wang | Xuanbo Liu | Mingrui Chen | Haitian Zhong | Xuanlin Yang | Bohan Zeng | Jinbo Hu | Hao Liang | Junbo Niu | Xuchen Li | Ruitao Wu | Ruichuan An | Yang Shi | Liu Liu | Qiang Liu | Zhouchen Lin | Xu-Yao Zhang | Wentao Zhang | Bin Dong
Findings of the Association for Computational Linguistics: ACL 2026
With the advancement of powerful large-scale reasoning models, effectively evaluating the reasoning capabilities of these models has become increasingly important. However, existing benchmarks designed to assess the reasoning abilities of large models tend to be limited in scope and lack the flexibility to adapt their difficulty according to the evolving reasoning capacities of the models. To address this, we propose MorphoBench, a benchmark that incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models. Specifically, we curate the benchmark by selecting and collecting complex reasoning questions from existing benchmarks and sources such as Olympiad-level competitions. Additionally, MorphoBench adaptively modifies the analytical challenge of questions by leveraging key statements generated during the model’s reasoning process. Furthermore, it includes questions generated using simulation software, enabling dynamic adjustment of benchmark difficulty with minimal resource consumption. We have gathered over 1,300 test questions and iteratively adjusted the difficulty of MorphoBench based on the reasoning capabilities of models such as GPT-5 and Gemini-3-Pro. MorphoBench enhances the comprehensiveness and validity of model reasoning evaluation, providing reliable guidance for improving both the reasoning abilities and scientific robustness of large models.
UniMem: Complementary Episodic-to-Parametric Memory for Boundary-Agnostic Task Streams
Siyu Xia | Chenheng Zhang | Yanting Wu | Haoxuan Li | Jiajun Chai | Xiaohan Wang | Guojun Yin | Wei Lin | Zhouchen Lin | Haifeng Zhang | Jun Wang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Siyu Xia | Chenheng Zhang | Yanting Wu | Haoxuan Li | Jiajun Chai | Xiaohan Wang | Guojun Yin | Wei Lin | Zhouchen Lin | Haifeng Zhang | Jun Wang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Memory is essential for LLM agents to accumulate task experience and reuse task-specific execution strategies. However, real-world deployment over boundary-agnostic and evolving task streams exposes a fundamental stability-plasticity dilemma. External retrieval-based memory can rapidly absorb new evidence, but it often fails to internalize recurring execution patterns and incurs inference-time retrieval overhead. Parametric memory enables stable and efficient execution once learned, but typically relies on explicit task boundaries and fixed parameter budgets. Inspired by the human brain, which balances plasticity and stability through complementary episodic storage and gradual consolidation, we propose UniMem, a self-routing framework for autonomous memory management. UniMem uses learnable routing tokens as memory controllers, enabling adaptive coordination between complementary memory pathways: novel or sparse tasks are retained in an episodic buffer for retrieval-augmented execution, while recurring and reliable patterns are consolidated into expandable parametric memory. By decoupling task identification from task execution with routing tokens and parametric memory blocks, UniMem expands memory on demand without task labels during deployment or uncontrolled parameter growth. Experiments on long-horizon streaming task sequences show that UniMem typically achieves strong aggregate results while maintaining routing and execution stability, with an average gain of 4.0 EM over Replay LoRA.