Evaluating Long Range Dependency Handling in Code Generation Models using Multi-Step Key Retrieval
<|reference_start|>Evaluating Long Range Dependency Handling in Code Generation Models using Multi-Step Key Retrieval: As language models support larger and larger context sizes, evaluating their ability to make effective use of that context becomes increasingly important. We analyze the ability of several code generation models to handle long range dependencies using a suite of multi-step key retrieval tasks in context windows up to 8k tokens in length. The tasks progressively increase in difficulty and allow more nuanced evaluation of model capabilities than tests like the popular needle-in-the-haystack test. We find that performance degrades significantly (up to 2x) when a function references another function that is defined later in the prompt. We also observe that models that use sliding window attention mechanisms have difficulty handling references further than the size of a single window. We perform simple prompt modifications using call graph information to improve multi-step retrieval performance up to 3x. Our analysis highlights different facets of long-context performance and is suggestive of prompt construction strategies for code completion tools<|reference_end|>
@article{assogba2024evaluating,
    title={Evaluating Long Range Dependency Handling in Code Generation Models
  using Multi-Step Key Retrieval},
    author={Yannick Assogba, Donghao Ren},
    journal={arXiv preprint arXiv:2407.21049},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.21049},
    primaryClass={cs.CL cs.AI cs.LG}
}