TL;DR
This paper explores fine-tuning large language models for automated algorithm design, demonstrating improved performance and generalization over off-the-shelf models using a novel sampling and optimization strategy.
Contribution
It introduces a diversity-aware sampling method and preference optimization for fine-tuning LLMs specifically for algorithm design tasks.
Findings
Fine-tuned LLMs outperform off-the-shelf models on specific tasks.
Fine-tuning improves generalization across related algorithm design tasks.
Code for the method is publicly available at the provided GitHub link.
Abstract
The integration of large language models (LLMs) into automated algorithm design has shown promising potential. A prevalent approach embeds LLMs within search routines to iteratively generate and refine candidate algorithms. However, most existing methods rely on off-the-shelf LLMs trained for general coding tasks, leaving a key question open: Do we need LLMs specifically tailored for algorithm design? If so, how can such LLMs be effectively obtained and how well can they generalize across different algorithm design tasks? In this paper, we take a preliminary step toward answering these questions by exploring fine-tuning of LLMs for algorithm design. We introduce a Diversity-Aware Rank-based (DAR) sampling strategy to balance training data diversity and quality, then we leverage direct preference optimization to efficiently align LLM outputs with task objectives. Our experiments are…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling
