- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper studies federated post-training of LLM agents that run several tools at once. Independent tool calls can finish in different orders, so clients may store the same execution in different orders. Sequential training then gives these clients different gradients for the same execution. The authors call this interleaving heterogeneity. The proposed TopoFed-Agent rebuilds each execution as an execution poset from runtime records. During training, each event attends only to its causal ancestors, positions come from causal rank, and each target is attached to its own event. The authors prove that all legal orders of a fixed poset give the same gradients. Experiments on AppWorld and Gaia2 show higher task success than the baselines.
Critical strengths
Strength 1. The paper clearly defines when two stored traces are the same execution. The fix only changes how each client encodes its own data. The server and the communication cost stay the same, and the extra training cost is small. This matters because the method would be easy to adopt if order effects prove harmful in practice.
Strength 2. If the runtime records cannot show that two events are independent, the method keeps their stored order. The paper proves that this rule never removes a true dependency when the existing records are correct. Its experiments also show that missing records hurt much less than wrong ones. This matters because real runtime records may be incomplete.
Critical weaknesses
Weakness 1. The results do not mean that removing order differences causes the gains. At , all clients use the same uniform scheduler, so no client has its own order preference. Also TopoFed-Agent still beats Seq-FedAvg on AppWorld. Canonical-LE also removes order differences by fixing one order per execution, but it still scores lower than TopoFed-Agent. On the Qwen2.5-1.5B model, gradients from different orders point in nearly the same direction. These things suggest that most of the gain comes from another source.
Weakness 2. The novelty is limited. The invariance theorem follows from the known permutation equivariance of attention. The mechanism is close to DAG Transformers, tree attention in speculative decoding, and Parallel Context Windows, but the paper does not explain how it differs from them. A simpler fix is to give all clients one shared canonical order. The paper argues that different canonical rules give different objectives, but one shared rule causes no disagreement between clients.
Questions for authors
-
At , no client has its own order preference, yet TopoFed-Agent still beats Seq-FedAvg by more than 10 points on AppWorld. What causes this gain? How much of it remains when each of the three components is removed?
-
The experiments list only dependency sources as runtime relations, and without evidence of independence the method essentially reduces to sequential training on the stored order. How is independence between events established in AppWorld and Gaia2, and what fraction of executions has more than one legal order?
2 comments
Thank you for the detailed response. But the new ablations show that the gain over Canonical-LE comes from the modeling choices, not from removing interleaving heterogeneity, so I will maintain my score.
We thank the reviewer for the direct questions about the source of the performance gains, the novelty relative to existing structured-attention methods, and the practical recovery of independent events. We have added component ablations, expanded the canonical-order analysis, and reported runtime evidence and graph-recovery statistics on AppWorld and Gaia2.
Q1. Why does TopoFed-Agent improve over Seq-FedAvg at β = 0, and how much of the gain remains when individual components are removed?
At β = 0, clients sample uniformly from the ready set, so there is no persistent client-specific scheduler preference. However, each execution is still realized and stored as one sampled legal sequence. Sequential training therefore remains sensitive to the order of independent events: the order changes preceding context and physical positions, and next-token supervision can associate targets with different packed rows. Table 5 reports 24.0% TGC for Seq-FedAvg and 35.8% for TopoFed-Agent at β = 0, an 11.8-point difference. Random-LE obtains 31.9% TGC with Δg = 0.38, while Canonical-LE obtains 30.5% with Δg below 10⁻⁵. The complete method obtains 35.8% with Δg below 10⁻⁵ under both β = 0 and β = 2.5. Thus, the gain is not attributed only to removing client-specific scheduler preferences; it also reflects causal-context modeling and event-local target alignment. Table 3 reports the requested mask-only control: M alone obtains 26.2% Test-N and 13.3% Test-C TGC, compared with 35.8% and 22.1% for M+R+T. R-only obtains 23.7%/11.3%, and T-only 23.1%/11.7%; M+R, M+T, and R+T obtain 29.6%/16.4%, 31.0%/17.4%, and 27.3%/14.3%, respectively. Table 5 also gives a progressive comparison from Canonical-LE: adding M raises TGC from 30.5% to 31.7%, adding R raises it to 33.2%, and adding event-local T reaches 35.8%. These results quantify the separate and joint contributions of attention scope, causal positions, and event-bound supervision.
Q2. How is independence established in AppWorld and Gaia2, and what fraction of executions has more than one legal order?
Appendix A.1–A.2 specifies the runtime evidence and conservative recovery procedure, and Table 6 reports the statistics. The constructor starts from certified dependency edges. For event pairs that remain unrelated, it removes the observed order only when independence is positively certified; otherwise, it adds the observed order, checks acyclicity, and computes transitive closure. Evidence includes program order, tool-call/result links, explicit consumption, message send/receive relations, fork/join information, and versioned read/write conflicts. Events remain unordered only when the records establish that neither consumes the other's output nor conflicts on accessed state. Textual similarity and timestamps are not independence evidence. Missing records therefore retain observed order and reduce concurrency rather than declaring events independent. Evidence-source coverage is 100.0% for program order on both benchmarks, 97.6%/98.4% for tool-call/result links on AppWorld/Gaia2, 64.3%/71.5% for explicit consumption, and 47.1%/53.6% for versioned read/write conflicts. Table 6 contains 1,200 AppWorld traces and 960 Gaia2 traces. The fraction with multiple legal extensions is 67.3% and 75.0%, with mean execution widths of 2.7 and 3.5. Under completion-order replay, graph agreement is 94.2% and 91.6% with full available provenance, and 87.9% and 84.6% at provenance completeness ρ = 0.6. These measurements quantify both the prevalence of concurrency and the effect of incomplete provenance on graph recovery.
Concern on novelty relative to DAG Transformers, tree attention, and parallel context methods.
Permutation equivariance is the tool used to prove the invariance result, not the full contribution. Existing DAG and partial-order attention methods provide structured visibility, while PCW and tree-based methods organize parallel branches or shared prefixes. TopoFed-Agent addresses a different setting: federated post-training of asynchronous agents from private runtime traces, where the system must recover dependencies from runtime evidence and preserve the same decision context, position, and target across legal serializations. The revised comparisons include PCW-adapted, Hasse-mask, and Tree Training-adapted, alongside APE and Set-Based Prompting. Table 1 shows that these baselines retain varying levels of gradient sensitivity, whereas TopoFed-Agent supports arbitrary legal extensions with logits, losses, and gradients invariant to numerical precision. The execution graph and traces remain on each client, and the server receives the ordinary federated update. This positions the contribution at the intersection of runtime-grounded dependency recovery, event-level supervision, and federated agent adaptation, with permutation equivariance providing the theoretical foundation for the invariance guarantee.