Competition-Level Problems are Effective LLM Evaluators
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909215667257344 |
|---|---|
| author | Huang, Yiming Lin, Zhenghao Liu, Xiao Gong, Yeyun Lu, Shuai Lei, Fangyu Liang, Yaobo Shen, Yelong Lin, Chen Duan, Nan Chen, Weizhu |
| author_facet | Huang, Yiming Lin, Zhenghao Liu, Xiao Gong, Yeyun Lu, Shuai Lei, Fangyu Liang, Yaobo Shen, Yelong Lin, Chen Duan, Nan Chen, Weizhu |
| contents | Large language models (LLMs) have demonstrated impressive reasoning capabilities, yet there is ongoing debate about these abilities and the potential data contamination problem recently. This paper aims to evaluate the reasoning capacities of LLMs, specifically in solving recent competition-level programming problems in Codeforces, which are expert-crafted and unique, requiring deep understanding and robust reasoning skills. We first provide a comprehensive evaluation of GPT-4's peiceived zero-shot performance on this task, considering various aspects such as problems' release time, difficulties, and types of errors encountered. Surprisingly, the peiceived performance of GPT-4 has experienced a cliff like decline in problems after September 2021 consistently across all the difficulties and types of problems, which shows the potential data contamination, as well as the challenges for any existing LLM to solve unseen complex reasoning problems. We further explore various approaches such as fine-tuning, Chain-of-Thought prompting and problem description simplification, unfortunately none of them is able to consistently mitigate the challenges. Through our work, we emphasis the importance of this excellent data source for assessing the genuine reasoning capabilities of LLMs, and foster the development of LLMs with stronger reasoning abilities and better generalization in the future. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_02143 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Competition-Level Problems are Effective LLM Evaluators Huang, Yiming Lin, Zhenghao Liu, Xiao Gong, Yeyun Lu, Shuai Lei, Fangyu Liang, Yaobo Shen, Yelong Lin, Chen Duan, Nan Chen, Weizhu Computation and Language Artificial Intelligence Large language models (LLMs) have demonstrated impressive reasoning capabilities, yet there is ongoing debate about these abilities and the potential data contamination problem recently. This paper aims to evaluate the reasoning capacities of LLMs, specifically in solving recent competition-level programming problems in Codeforces, which are expert-crafted and unique, requiring deep understanding and robust reasoning skills. We first provide a comprehensive evaluation of GPT-4's peiceived zero-shot performance on this task, considering various aspects such as problems' release time, difficulties, and types of errors encountered. Surprisingly, the peiceived performance of GPT-4 has experienced a cliff like decline in problems after September 2021 consistently across all the difficulties and types of problems, which shows the potential data contamination, as well as the challenges for any existing LLM to solve unseen complex reasoning problems. We further explore various approaches such as fine-tuning, Chain-of-Thought prompting and problem description simplification, unfortunately none of them is able to consistently mitigate the challenges. Through our work, we emphasis the importance of this excellent data source for assessing the genuine reasoning capabilities of LLMs, and foster the development of LLMs with stronger reasoning abilities and better generalization in the future. |
| title | Competition-Level Problems are Effective LLM Evaluators |
| topic | Computation and Language Artificial Intelligence |
| url | https://arxiv.org/abs/2312.02143 |