Zhixun Li
2026
RealChart2Code: Bridging the Gap in Real-World Chart-to-Code Generation via Multi-Task Evaluation
Jiajun Zhang | Yuying Li | Zhixun Li | Xingyu Guo | Jingzhuo Wu | Leqi Zheng | Yiran Yang | Jianke Zhang | Qingbin Li | Shannan Yan | Changguo Jia | Junfei Wu | Zilei Wang | Qiang Liu | Liang Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Jiajun Zhang | Yuying Li | Zhixun Li | Xingyu Guo | Jingzhuo Wu | Leqi Zheng | Yiran Yang | Jianke Zhang | Qingbin Li | Shannan Yan | Changguo Jia | Junfei Wu | Zilei Wang | Qiang Liu | Liang Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Vision-Language Models (VLMs) have demonstrated impressive capabilities in code generation across various domains. However, their ability to replicate complex, multi-panel visualizations from real-world data remains largely unassessed. To address this gap, we introduce RealChart2Code, a new large-scale benchmark with over 2,800 instances grounded in authentic datasets and featuring tasks with clear analytical intent. Crucially, it is the first benchmark to systematically evaluate chart generation from large-scale raw data and assess iterative code refinement in a multi-turn conversational setting. Our comprehensive evaluation of 14 leading VLMs on RealChart2Code reveals significant performance degradation compared to simpler benchmarks, highlighting their struggles with complex plot structures and authentic data. Our analysis uncovers a substantial performance gap between proprietary and open-weight models and confirms that even state-of-the-art VLMs often fail to accurately replicate intricate, multi-panel charts. These findings provide valuable insights into the current limitations of VLMs and guide future research directions.
Rethinking Sample Polarity in Reinforcement Learning with Verifiable Rewards
Xinyu Tang | Yuliang Zhan | Zhixun Li | Xin Zhao | Zhenduo Zhang | Zujie Wen | Zhiqiang Zhang | Jun Zhou
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xinyu Tang | Yuliang Zhan | Zhixun Li | Xin Zhao | Zhenduo Zhang | Zujie Wen | Zhiqiang Zhang | Jun Zhou
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large reasoning models (LRMs) are typically trained using reinforcement learning with verifiable reward (RLVR) to enhance their reasoning abilities. In this paradigm, policies are updated using both positive and negative self-generated rollouts, which correspond to distinct ***sample polarities***. In this paper, we provide a systematic investigation into how these sample polarities affect RLVR training dynamics and behaviors. We find that positive samples sharpen existing correct reasoning patterns, while negative samples encourage exploration of new reasoning paths. We further explore how adjusting the advantage values of positive and negative samples at both the polarity level and the token level affects RLVR training. Based on these insights, we propose an **A**daptive and **A**symmetric token-level **A**dvantage shaping method for **P**olicy **O**ptimization, namely **A3PO**, that more precisely allocates advantage signals to key tokens across different polarities. Experiments across five reasoning benchmarks demonstrate the effectiveness of our approach.