Large Language Models and Algorithm Execution: Application to an Arithmetic Function
Farah Ben Slama (SyCoSMA, LIRIS), Fr\'ed\'eric Armetta (SyCoSMA, LIRIS)

TL;DR
This paper explores enhancing Large Language Models' ability to execute algorithms by introducing a specialized training method called LLM-DAL, which improves their reasoning and generalization in algorithmic tasks.
Contribution
The paper proposes a new supervised training approach, LLM-DAL, that significantly improves LLMs' capacity for algorithm execution and reasoning.
Findings
LLM-DAL enhances algorithmic inference capabilities.
Training method improves generalization in complex tasks.
Models perform better on arithmetic functions after training.
Abstract
Large Language Models (LLMs) have recently developed new advanced functionalities. Their effectiveness relies on statistical learning and generalization capabilities. However, they face limitations in internalizing the data they process and struggle, for instance, to autonomously execute algorithms. In this paper, we investigate the possibility of extending these models' capabilities to algorithm execution through specialized supervised training focused on reasoning decomposition. We introduce a training model called LLM-DAL (Large Language Model - Decompositional Algorithmic Learning), through which we demonstrate that LLMs' ability to perform complex algorithmic inferences and generalize can be significantly improved when the training method is properly designed to guide the model in its learning process.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Topic Modeling · Natural Language Processing Techniques
