← Formal Protocol Theory

August 7, 2026

SIG-FPT 2026-08-07

Participants: Patrick Nast, Venkatesh Rao, PAtwater, Ellen Kaye-Cheveldayoff (UTC -4), Ergod, Giovanni Merlino, Jordan Peacock, Matthew Bright UTC-7

This is part of the group's "summer of stigmergy" series within the formal protocol theory SIG. Having previously covered the Deneubourg pheromone-signaling model and termite-construction (sematectonic vs. marker, qualitative vs. quantitative) stigmergy, the group now moved from natural/foundational models to *engineered* systems that use stigmergy — specifically ACO. Discussion centered on how ACO recasts combinatorial optimization as ants laying pheromone on abstract graphs, why the classic approach underperformed and where it still shines (dynamic routing), and how the newer deep-learning approach learns the heuristic rather than hand-tuning it. Much of the conversation was participants still working to understand the papers, plus threads on locality, stability, and real-world applications.

  • **From nature to engineered protocols (Patrick):** The natural progression is moving from foundational models (Deneubourg pheromones, termite construction) to engineered systems that borrow/extend them. ACO is the cleanest computer-science example — casting problems like TSP, network routing, or protein folding as graph-path problems where digital "ants" lay pheromone tracks.
  • **The core "move" (Patrick):** Replace the physical traversal environment with an *abstract computational (graph) space*. If a problem can be framed as finding a path on a graph, ants can lay pheromone along edges; choosing an update rule that reinforces better solutions more strongly yields iterative improvement — the same feedback-loop logic as the physical case.
  • **Historical arc (Patrick):** ACO was heavily published in the late 1990s–early 2000s, reached maturity, but never became state-of-the-art for the big combinatorial optimization problems. A key limitation is the **heuristic** — a hand-tuned, "fiddly" update rule specific to each problem.
  • **The Deep ACO contribution (Patrick):** The revival ("neuro-combinatorial optimization") *learns* the heuristic parameter rather than hand-tuning it, making the technique more flexible and compelling in the deep-learning era.
  • **What the second paper actually does (Venkatesh):** Initially confused, he clarified it is *not* just exploring parameters of a single heuristic form (e.g., evaporation rates). It explores the **space of functional forms** for choosing between next nodes in the construction graph — e.g., the simple "nearer cities are better" form (1/distance) vs. alternatives like 1/distance². Open question for him: how much of the value is computational advantage vs. intuition/interpretability advantage over traditional optimization.
  • **Where stigmergy earns its keep (Patrick):** Little computational benefit on static/centralized combinatorial problems (classical algorithms do fine). The exception is **dynamic routing** — nonstationary environments, distributed, partial-information settings — which is also the environment ants evolved to thrive in, making the fit natural. Connects to multi-agent reinforcement learning problems.

Session Recording Summary · 62m 46s · Full notes ↗

Reading: The session focused on **Ant Colony Optimization (ACO)** and a more recent **deep learning revival ("Deep ACO")** paper. Patrick assigned two-to-three readings: an introductory/review piece on ACO and related ideas, and a recent paper applying deep reinforcement learning to learn ACO heuristics. Specific titles/authors were not stated verbatim, though Giovanni noted one paper came from the original ACO/Ant Colony research line and emphasized a link between stochastic gradient descent and ACO.

This is part of the group's "summer of stigmergy" series within the formal protocol theory SIG. Having previously covered the Deneubourg pheromone-signaling model and termite-construction (sematectonic vs. marker, qualitative vs. quantitative) stigmergy, the group now moved from natural/foundational models to *engineered* systems that use stigmergy — specifically ACO. Discussion centered on how ACO recasts combinatorial optimization as ants laying pheromone on abstract graphs, why the classic approach underperformed and where it still shines (dynamic routing), and how the newer deep-learning approach learns the heuristic rather than hand-tuning it. Much of the conversation was participants still working to understand the papers, plus threads on locality, stability, and real-world applications.

  • **From nature to engineered protocols (Patrick):** The natural progression is moving from foundational models (Deneubourg pheromones, termite construction) to engineered systems that borrow/extend them. ACO is the cleanest computer-science example — casting problems like TSP, network routing, or protein folding as graph-path problems where digital "ants" lay pheromone tracks.
  • **The core "move" (Patrick):** Replace the physical traversal environment with an *abstract computational (graph) space*. If a problem can be framed as finding a path on a graph, ants can lay pheromone along edges; choosing an update rule that reinforces better solutions more strongly yields iterative improvement — the same feedback-loop logic as the physical case.
  • **Historical arc (Patrick):** ACO was heavily published in the late 1990s–early 2000s, reached maturity, but never became state-of-the-art for the big combinatorial optimization problems. A key limitation is the **heuristic** — a hand-tuned, "fiddly" update rule specific to each problem.
  • **The Deep ACO contribution (Patrick):** The revival ("neuro-combinatorial optimization") *learns* the heuristic parameter rather than hand-tuning it, making the technique more flexible and compelling in the deep-learning era.
  • **What the second paper actually does (Venkatesh):** Initially confused, he clarified it is *not* just exploring parameters of a single heuristic form (e.g., evaporation rates). It explores the **space of functional forms** for choosing between next nodes in the construction graph — e.g., the simple "nearer cities are better" form (1/distance) vs. alternatives like 1/distance². Open question for him: how much of the value is computational advantage vs. intuition/interpretability advantage over traditional optimization.
  • **Where stigmergy earns its keep (Patrick):** Little computational benefit on static/centralized combinatorial problems (classical algorithms do fine). The exception is **dynamic routing** — nonstationary environments, distributed, partial-information settings — which is also the environment ants evolved to thrive in, making the fit natural. Connects to multi-agent reinforcement learning problems.

Questions & Disagreements: - **What is the second paper actually doing?** Multiple participants (Venkatesh, Ellen, Matthew) said their main task was still just understanding the paper. Venkatesh corrected an initial misreading (parameter space vs. functional-form space). - **What's the real advantage of ACO/stigmergy framing?** Ergod raised the recurring question of why writing problems in stigmergic language is any better

Participants: Patrick Nast, Venkatesh Rao, PAtwater, Ellen Kaye-Cheveldayoff (UTC -4), Ergod, Giovanni Merlino, Jordan Peacock, Matthew Bright UTC-7