Compositional Hardness of Code in Large Language Models -- A Probabilistic Perspective
<|reference_start|>Compositional Hardness of Code in Large Language Models -- A Probabilistic Perspective: A common practice in large language model (LLM) usage for complex analytical tasks such as code generation, is to sample a solution for the entire task within the model's context window. Previous works have shown that subtask decomposition within the model's context (chain of thought), is beneficial for solving such tasks. In this work, we point a limitation of LLMs' ability to perform several sub-tasks within the same context window - an in-context hardness of composition, pointing to an advantage for distributing a decomposed problem in a multi-agent system of LLMs. The hardness of composition is quantified by a generation complexity metric, i.e., the number of LLM generations required to sample at least one correct solution. We find a gap between the generation complexity of solving a compositional problem within the same context relative to distributing it among multiple agents, that increases exponentially with the solution's length. We prove our results theoretically and demonstrate them empirically.<|reference_end|>
@article{wolf2024compositional,
    title={Compositional Hardness of Code in Large Language Models -- A
  Probabilistic Perspective},
    author={Yotam Wolf, Binyamin Rothberg, Dorin Shteyman, Amnon Shashua},
    journal={arXiv preprint arXiv:2409.18028},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.18028},
    primaryClass={cs.AI cs.CL}
}