Pheromone-based Learning of Optimal Reasoning Paths

Anirudh Chari, Aditya Tiwari, Richard Lian, Suraj Reddy, Brian Zhou
1/31/2025
cs.CL

No confident code implementation found for this paper.

Abstract

Large Language Models (LLMs) have demonstrated remarkable reasoning capabilities through chain-of-thought prompting, yet discovering effective reasoning methods for complex problems remains challenging due to the vast space of possible intermediate steps. We introduce Ant Colony Optimization-guided Tree of Thought (ACO-ToT), a novel algorithm that combines ACO with LLMs to discover optimal reasoning paths for complex problems efficiently. Drawing inspiration from Hebbian learning in neurological systems, our method employs a collection of distinctly fine-tuned LLM "ants" to traverse and lay pheromone trails through a centralized tree of thought, with each ant's movement governed by a weighted combination of existing pheromone trails and its own specialized expertise. The algorithm evaluates complete reasoning paths using a mixture-of-experts-based scoring function, with pheromones reinforcing productive reasoning paths across iterations. Experiments on three challenging reasoning tasks (GSM8K, ARC-Challenge, and MATH) demonstrate that ACO-ToT performs significantly better than existing chain-of-thought optimization approaches, suggesting that incorporating biologically inspired collective search mechanisms into LLM inference can substantially enhance reasoning capabilities.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chari2025pheromonebased,
  title  = {Pheromone-based Learning of Optimal Reasoning Paths},
  author = {Anirudh Chari and Aditya Tiwari and Richard Lian and Suraj Reddy and Brian Zhou},
  year   = {2025},
  eprint = {2501.19278},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.19278v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.19278.svg)](https://codeofpaper.com/paper/2501.19278)

Discussion