Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.07909 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915784648818688 |
|---|---|
| author | Zhang, Taolin Guo, Hang Lu, Wang Dai, Tao Xia, Shu-Tao Wang, Jindong |
| author_facet | Zhang, Taolin Guo, Hang Lu, Wang Dai, Tao Xia, Shu-Tao Wang, Jindong |
| contents | As large language models (LLMs) continue to scale up, their performance on various downstream tasks has significantly improved. However, evaluating their capabilities has become increasingly expensive, as performing inference on a large number of benchmark samples incurs high computational costs. In this paper, we revisit the model-item performance matrix and show that it exhibits sparsity, that representative items can be selected as anchors, and that the task of efficient benchmarking can be formulated as a sparse optimization problem. Based on these insights, we propose SparseEval, a method that, for the first time, adopts gradient descent to optimize anchor weights and employs an iterative refinement strategy for anchor selection. We utilize the representation capacity of MLP to handle sparse optimization and propose the Anchor Importance Score and Candidate Importance Score to evaluate the value of each item for task-aware refinement. Extensive experiments demonstrate the low estimation error and high Kendall's~$τ$ of our method across a variety of benchmarks, showcasing its superior robustness and practicality in real-world scenarios. Code is available at {https://github.com/taolinzhang/SparseEval}. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_07909 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | SparseEval: Efficient Evaluation of Large Language Models by Sparse Optimization Zhang, Taolin Guo, Hang Lu, Wang Dai, Tao Xia, Shu-Tao Wang, Jindong Computation and Language Machine Learning As large language models (LLMs) continue to scale up, their performance on various downstream tasks has significantly improved. However, evaluating their capabilities has become increasingly expensive, as performing inference on a large number of benchmark samples incurs high computational costs. In this paper, we revisit the model-item performance matrix and show that it exhibits sparsity, that representative items can be selected as anchors, and that the task of efficient benchmarking can be formulated as a sparse optimization problem. Based on these insights, we propose SparseEval, a method that, for the first time, adopts gradient descent to optimize anchor weights and employs an iterative refinement strategy for anchor selection. We utilize the representation capacity of MLP to handle sparse optimization and propose the Anchor Importance Score and Candidate Importance Score to evaluate the value of each item for task-aware refinement. Extensive experiments demonstrate the low estimation error and high Kendall's~$τ$ of our method across a variety of benchmarks, showcasing its superior robustness and practicality in real-world scenarios. Code is available at {https://github.com/taolinzhang/SparseEval}. |
| title | SparseEval: Efficient Evaluation of Large Language Models by Sparse Optimization |
| topic | Computation and Language Machine Learning |
| url | https://arxiv.org/abs/2602.07909 |