Zhenxuan Fan
Author directory2026
CoMoL: Efficient Mixture of LoRA Experts via Dynamic Core Space Merging
Jie Cao | Zhenxuan Fan | Zhuonan Wang | Tianwei Lin | Ziyuan Zhao | Rolan Yan | Wenqiao Zhang | Feifei Shao | Hongwei Wang | Jun Xiao | Siliang Tang
Findings of the Association for Computational Linguistics: ACL 2026
Jie Cao | Zhenxuan Fan | Zhuonan Wang | Tianwei Lin | Ziyuan Zhao | Rolan Yan | Wenqiao Zhang | Feifei Shao | Hongwei Wang | Jun Xiao | Siliang Tang
Findings of the Association for Computational Linguistics: ACL 2026
Large language models (LLMs) achieve remarkable performance on diverse downstream and domain-specific tasks via parameter-efficient fine-tuning (PEFT). However, existing PEFT methods, particularly MoE-LoRA architectures, suffer from limited parameter efficiency and coarse-grained adaptation due to the proliferation of LoRA experts and instance-level routing. To address these issues, we propose Core Space Mixture of LoRA (CoMoL), a novel MoE-LoRA framework that incorporates expert diversity, parameter efficiency, and fine-grained adaptation. Specifically, CoMoL introduces two key components: core space experts and core space routing. Core space experts store each expert in a compact core matrix, preserving diversity while controlling parameter growth. Core space routing dynamically selects and activates the appropriate core experts for each token, enabling fine-grained, input-adaptive routing. Activated core experts are then merged via a soft-merging strategy into a single core expert, which is combined with a shared LoRA to form a specialized LoRA module. Besides, the routing network is projected into the same low-rank space as the LoRA matrices, further reducing parameter overhead without compromising expressiveness. Extensive experiments demonstrate that CoMoL retains the adaptability of MoE-LoRA architectures while achieving parameter efficiency comparable to standard LoRA, consistently outperforming existing methods across multiple tasks. Our code is available at https://github.com/DCDmllm/CoMoL.
RoboSPA: Can VLA Models Go Beyond Simple Scenes and Short-Horizon Tasks?
Zhenxuan Fan | Bo Zhang | Yutong Lin | Yuqian Yuan | Juekai Lin | Liang Liang | Zhuoyi Huang | Wenqiao Zhang | Juncheng Li | Siliang Tang | Jun Xiao | Yueting Zhuang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zhenxuan Fan | Bo Zhang | Yutong Lin | Yuqian Yuan | Juekai Lin | Liang Liang | Zhuoyi Huang | Wenqiao Zhang | Juncheng Li | Siliang Tang | Jun Xiao | Yueting Zhuang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Vision-Language-Action (VLA) models have shown promising progress in language-conditioned robotic manipulation. However, existing datasets and benchmarks mainly evaluate task completion under predefined settings, offering limited insight into model reasoning under increasing spatial and procedural complexity. We introduce RoboSPA (Robot Spatial-Procedural Assessment), a large-scale robotic manipulation dataset and benchmark for diagnosing embodied reasoning in VLA models. RoboSPA focuses on two core dimensions, Fine-Grained Spatial Reasoning and Long-Horizon Procedural Planning, covering 10 task categories and 56 base tasks. Each task is instantiated across five difficulty levels, yielding 280 variants with increasing spatial ambiguity and procedural complexity. We collect 527K trajectories across multiple embodiments and diverse scenes. Beyond binary success rate, RoboSPA introduces diagnostic metrics for more detailed evaluation. Experiments on representative VLA models show that current systems still struggle with complex spatial relations, precise low-level execution, and memory-intensive planning. These results establish RoboSPA as a challenging diagnostic benchmark for developing more capable, reliable, and generalizable embodied agents. Our data and code are available at https://github.com/fanzhenxuan/RoboSPA.