Min Li
Author directoryOther people with similar names: Min Li
Unverified author pages with similar names: Min Li
2026
TimePrune: Budgeted Temporal Pruning for Efficient Multimodal Time Series Analysis
Chenghao Liu | Qian Liu | Aniket Mahanti | Jindong Han | Min Li | Wei Fan
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Chenghao Liu | Qian Liu | Aniket Mahanti | Jindong Han | Min Li | Wei Fan
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
The recent advancement of time series has witnessed Vision Language Models (VLMs) as a powerful tool for a variety of tasks of multimodal time series analysis, including forecasting, classification, question answering, etc. However, with time series as an explicit modality, inputs with long time series horizons yield excessive numeric tokens for VLMs, resulting in high inference latency. Moreover, such long contexts often contain redundant or noisy segments that might distract the model and thus degrade downstream performance. Although previous token pruning methods can reduce visual or textual tokens, they are mostly unimodal and do not explicitly explore multimodal semantics for time series. To address this, we propose TimePrune, a plug-and-play temporal pruning framework for VLMs in multimodal time series analysis, which can accelerate VLM inference without fine-tuning the VLM backbone. Specifically, TimePrune formulates time series pruning as a budgeted temporal selection problem and introduces a Trimodal Budgeted Network to score temporal patches via jointly conditioning on linguistic and visual semantics. Then, under a fixed budget, this framework is optimized via the proposed Narrative-Calibrated Binned Grounding constraints, to further facilitate context-aware and temporally-coherent pruning. Extensive experiments in four time series tasks across application domains on multiple VLM backbones show that TimePrune could consistently achieve better performances. For example, on Qwen3VL-8B, TimePrune improves average forecasting performance by 33.91%.
From Charts to Code: A Hierarchical Benchmark for Multimodal Models
Jiahao Tang | Henry Hengyuan Zhao | Lijian Wu | Zijian Zhang | Yifei Tao | Dongxing Mao | Yang Wan | Jingru Tan | Min Zeng | Min Li | Alex Jinpeng Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Jiahao Tang | Henry Hengyuan Zhao | Lijian Wu | Zijian Zhang | Yifei Tao | Dongxing Mao | Yang Wan | Jingru Tan | Min Zeng | Min Li | Alex Jinpeng Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
We introduce Chart2Code, a new benchmark for evaluating the natural language to chart code generation capabilities of large multimodal models (LMMs). Chart2Code is explicitly designed from a user-driven perspective, capturing diverse real-world scenarios and progressively increasing task difficulty. It consists of three levels: Level 1 (Chart Reproduction) reproduces charts from a reference figure and user query; Level 2 (Chart Editing) involves complex modifications such as changing chart types or adding elements; and Level 3 (Long-Table to Chart Generation) requires models to transform long, unprocessed tables into faithful charts following user instructions. To our knowledge, this is the first hierarchical benchmark that reflects practical chart2code usage while systematically scaling task complexity. In total, Chart2Code contains 2,186 tasks across 22 chart types, paired with multi-level evaluation metrics that assess both code correctness and the visual fidelity of rendered charts. We benchmark 29 state-of-the-art (SoTA) LMMs, including both proprietary and the latest open-source models such as GPT-5.2, Qwen3-VL, InternVL3/3.5, MiMo-VL, and Seed-1.6-VL. Experimental results demonstrate that even the SoTA model GPT-5.2 averages 72.21 on code-based evaluation and only 33.41 on chart-quality assessment across the editing tasks, underscoring the difficulty of Chart2Code. We anticipate this benchmark will drive advances in multimodal reasoning and foster the development of more robust and general-purpose LMMs.
2025
MLDebugging: Towards Benchmarking Code Debugging Across Multi-Library Scenarios
JinYang Huang | Xiachong Feng | Qiguang Chen | Hanjie Zhao | Zihui Cheng | Jiesong Bai | Jingxuan Zhou | Min Li | Libo Qin
Findings of the Association for Computational Linguistics: ACL 2025
JinYang Huang | Xiachong Feng | Qiguang Chen | Hanjie Zhao | Zihui Cheng | Jiesong Bai | Jingxuan Zhou | Min Li | Libo Qin
Findings of the Association for Computational Linguistics: ACL 2025
Code debugging is a crucial task in software engineering, which attracts increasing attention. While remarkable success has been made in the era of large language models (LLMs), current research still focuses on the simple no-library or single-library setting, ignoring the complex multi-library scenario in real-world applications. To address this limitation, we make the first attempt to introduce MLDebugging (Multi-Library Debugging), a comprehensive benchmark designed to assess debugging challenges within multi-library Python code. Specifically, MLDebugging encompasses 126 distinct Python libraries, covering a wide range of multi-library code issues, categorized into seven distinct types. Furthermore, we conduct a thorough evaluation of MLDebugging using both mainstream open-source and closed-source LLMs and highlight that current LLMs still struggle to correctly perform code debugging across multi-library scenarios. We hope this work can uncover the potential of LLMs in multi-library debugging scenario and offer insights for future research.
2024
AutoCAP: Towards Automatic Cross-lingual Alignment Planning for Zero-shot Chain-of-Thought
Yongheng Zhang | Qiguang Chen | Min Li | Wanxiang Che | Libo Qin
Findings of the Association for Computational Linguistics: ACL 2024
Yongheng Zhang | Qiguang Chen | Min Li | Wanxiang Che | Libo Qin
Findings of the Association for Computational Linguistics: ACL 2024
Cross-lingual chain-of-thought can effectively complete reasoning tasks across languages, which gains increasing attention.Recently, dominant approaches in the literature improve cross-lingual alignment capabilities by integrating reasoning knowledge from different languages. Despite achieving excellent performance, current methods still have two main challenges: (1) Manual language specification: They still highly rely on manually selecting the languages to integrate, severely affecting their generalizability; (2) Static weight allocation: Current methods simply integrate all languages equally. In fact, different language reasoning paths should have different weights to achieve better complementation and integration. Motivated by this, we introduce an Automatic Cross-lingual Alignment Planning (AutoCAP) for zero-shot chain-of-thought to address the above challenges. The core of AutoCAP consists of two components: (1) Automatic Language Selection Prompting to guide LLMs to select appropriate languages and (2) Automatic Weight Allocation Prompting to automatically allocate alignment weight scores to each reasoning path. Extensive experiments on several benchmarks reveal that AutoCAP achieves state-of-the-art performance, surpassing previous methods that required manual effort.