Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?

Among the hardest tasks for humans are those found in competitive programming where problems require sophisticated algorithmic thinking, puzzle solving, and the creation of effective code.As a domain to assess language models (LMs), it has not received enough attention, though.This study presents the ICPC benchmark, which consists of 254 international collegiate programming contest (ICPC) tasks.Each problem includes official analysis, reference code, and sample, high-quality unit, and hidden tests.We are able to develop and evaluate a variety of LM inference techniques for competitive programming with these resources.With zero-shot chain-of-thought prompting, we find that o1 only achieves a 19.1% pass@1 solve rate.With our best inference technique, which combines multi-turn self-judge with reflection and retrieval over episodic information, raises this to 42.2%.Furthermore, we conduct a new human-in-the-loop investigation to gain a deeper understanding of the remaining difficulties.Surprisingly, we discover that o1 can solve 17 out of 18 problems that were previously unsolvable by any model or technique with just a few specific instructions.A footstep toward LMs with grounded, imaginative, and algorithmic thinking is provided by our quantitative findings and qualitative research.We open-source our code at https://github.com/kraritt/zolve.