acceptodds
Under review as a conference paper at ICLR 2027

PACT-Agent: Prospective Action-Contract Testing for Self-Evolving Language Agent

Abstract

Language-model agents can adapt through external memory, but most systems learn retrospectively from trajectories generated without considering what those trajectories can identify. An extracted rule may therefore fit an observed outcome without having predicted it. We introduce (Prospective Action-Contract Testing), a self-evolving agent grounded in Active Inference. PACT-Agent represents uncertain environmental dynamics as competing mechanisms in unresolved rules and connects LLM reasoning to explicit numerical inference through predictive contracts. During online interaction, a Worker agent predicts mechanism-conditioned traces and minimizes a contracted objective to select actions that balance information gain against utility. After execution, a Builder agent minimizes local , accepting memory revisions only when improved trajectory interpretability outweighs added description complexity. Across multiple LLM-agent benchmarks, PACT-Agent consistently improves over strong memory-based agents. These results show that prospective predictions turn Active Inference into an explicit and auditable procedure for agent self-evolution.

Primary area:
foundation or frontier models, including LLMs
Keywords:
LLM Agent, Self-evolving Agent, Active Inference, Free Energy

Reviews

Among:
Shape:
1234this paper, Top 32%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.50 over 4 reviews, above 68% of the others.
Reviewer_5kn4OpenReview ↗
Rating
4
Confidence
3(−1)
Informativeness
3
Presentation
2
Soundness
2
Read review
Paper summary

This paper presents PACT-Agent, a self-evolving language-agent framework that replaces purely retrospective memory construction with prospective mechanism testing. The key motivation is that a successful trajectory may be consistent with multiple environmental mechanisms, so a rule distilled after the fact may fit the observed outcome without actually having predicted it. PACT-Agent addresses this by maintaining competing mechanism hypotheses, using predictive contracts to precommit mechanism-conditioned outcomes, selecting short-horizon actions through an Expected Free Energy objective, and using a Variational Free Energy gate for post-hoc memory revision. The paper is technically well motivated, and I find the core idea—distinguishing retrospective fit from prospective validation—interesting and potentially important for self-evolving agents. The benchmark choices are also well aligned with the proposed problem, particularly WebArena and AndroidWorld, where local interaction semantics are often ambiguous. However, I currently have several concerns that prevent me from recommending acceptance in the current form.

Critical strengths

The problem formulation is compelling. The paper correctly identifies an underexplored weakness of many self-evolving agent systems: trajectories are usually generated to solve tasks, not to distinguish competing explanations of environment dynamics. As a result, retrospective reflection may produce rules that explain a trajectory but are not actually identifiable from the available evidence. I also like the separation between memory admission and prospective validation. A retrospectively proposed mechanism may be stored as unresolved, but it is not promoted to a resolved rule until it has been prospectively tested. This is a conceptually clean design choice. The experimental settings are generally well chosen. WebArena, AndroidWorld, and ALFWorld contain many cases where environment behavior is only partially observable or where superficially similar actions can have different effects. The ablations on information gain, belief updating, complexity regularization, and prospective validation are useful, and the reported gap between prospectively validated and retrospective-only mechanisms is suggestive.

Critical weaknesses

Presentation of the figures. The overview figures are somewhat over-stylized and have a noticeable AI-generated appearance, which reduces technical clarity. I encourage the authors to replace them with a cleaner and more conventional system architecture diagram during rebuttal.

Incomplete related-work discussion. The paper misses closely related work on failure modes of self-evolving agent memory, particularly Obsessive Experience Poisoning (OEP). OEP studies how locally valid but non-transferable experiences can induce over-generalized persistent rules, which is complementary to PACT's distinction between retrospective fitting and prospective validation. This connection and the difference in problem scope should be discussed.

Lack of direct mechanism-identification validation. The current experiments mainly demonstrate downstream performance and future prediction accuracy, but do not directly verify the paper's central claim that prospective testing improves mechanism identification. A controlled experiment with known ground-truth mechanisms, reporting identification accuracy or false-resolution rate, would substantially strengthen the causal attribution of the gains.

Questions for authors

Would the authors consider replacing the current overview figure with a cleaner and more conventional system architecture diagram? I believe this would substantially improve the technical clarity of the paper.

Related work. How does PACT-Agent relate to Obsessive Experience Poisoning (OEP), which studies how locally valid but non-transferable experiences can induce over-generalized persistent rules in self-evolving agents? In particular, how do the authors distinguish PACT's prospective mechanism validation from OEP's concern about rule scope and cross-task transferability?

Direct validation of mechanism identification. Can the authors provide a controlled experiment with known ground-truth mechanisms to directly verify that prospective testing improves mechanism identification, rather than only downstream task success or future prediction accuracy? Metrics such as mechanism identification accuracy and false-resolution rate would be especially helpful.

I currently lean toward accept.

1 comment

We sincerely thank the reviewer for the strong support and for framing the retrospective-vs-prospective distinction so clearly.

W1 / Q1 (Overview figure). We replaced the overview figure with a cleaner, conventional architecture diagram (Worker contract → contracted EFE → execution → VFE-gated Builder → versioned memory with unresolved/resolved states). We hope this improves technical readability.

W2 / Q2 (Relation to Obsessive Experience Poisoning, OEP). We added discussion of OEP. The problems are complementary:

OEP: locally correct experiences can yield over-broad persistent rules that fail on transfer—an attack/robustness perspective on rule scope and cross-context misuse.

PACT: under a rule’s stated applicability, multiple mechanisms may equally explain seen trajectories. Before the next action, PACT records each candidate’s predictions and uses observations to discriminate them (e.g., ReadBack tests whether Save alone persists). Validation supports that rule version under tested conditions, not automatic extrapolation to new edit modes.

PACT records explicit applicability; widening scope creates a new version and requires evidence on the expanded conditions. Our experiments focus on mechanism prediction and task success; OEP-style cross-context poisoning robustness is important but requires dedicated evaluation—we cite OEP and clarify scope rather than claiming to solve poisoning.

W3 / Q3 (Direct mechanism-identification validation). We added a controlled Zendo study (following the compositional hypothesis-setting of Grounding Compositional Hypothesis Generation in Specific Instances): each episode has a known hidden rule and an initial scene compatible with multiple hypotheses (e.g., “one blue one red” fits both “exactly one blue” and “at least one blue”). The agent may test up to seven additional scenes; we save PACT’s pre-action predictions and at episode end compare memory rules marked resolved against the hidden rule (domain-equivalent rules count as correct). Gemini-2.5-flash; three variants:

MethodMechanism ID accuracy (%)
Full PACT (active test selection)76.4
PACT with random query selection58.9
Retrospective induction on the same query log62.1

Full PACT substantially exceeds both controls: active EFE-based testing helps find the true rule, and prospective validation reduces false resolution given the same queries. We will include full protocol details in the appendix / supplemental material.

We hope these additions address the remaining concerns and would be grateful if the reviewer considers whether the revised empirical and conceptual clarity supports the positive assessment.

Reviewer_QQuAOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper introduces PACT-Agent, a memory-augmented language agent framework that decouples prospective mechanism testing from retrospective memory updates. The agent maintains a semantic memory structured around Entities, Rules, and Skills, where uncertain environment dynamics are modeled as competing hypotheses. Before acting, a Worker module constructs a predictive contract that outlines potential short-term policies, expected observable outcomes, and mechanism-dependent execution traces. A numerical selector then chooses an action sequence by balancing expected subgoal progress, execution cost, and information gain, updating its mechanism beliefs by comparing the observed outcome against its precommitted predictions.

Once an episode ends, a Builder module proposes updates to the semantic memory, accepting edits only if they improve a complexity-penalized evidence objective evaluated over past execution traces. The authors emphasize this explicit separation between retrospective hypothesis generation and subsequent prospective validation.

Critical strengths
  1. The prospective contract is a concrete and potentially useful interface between language reasoning and evidence-based memory.

  2. The empirical results suggest practical value across several established agent benchmarks.

Critical weaknesses
  1. Limited Methodological Novelty

The core concepts closely mirror prior work: AutoManual alternates planning and rule construction, BED-LLM uses Bayesian information gain for LLM exploration, and learning predictive environment models are widely explored. The transition from experience retrieval to mechanism testing is already established in the literature, making the technical novelty narrower than claimed. The paper need more justification for its actual contribution.

  1. Theoretical Framing Adds Little Operational Value

The Active Inference formalism largely rebrands standard probabilistic operations: Equation (5) is a standard utility-plus-information-gain objective, Equation (6) is Bayesian conditioning, and Equation (7) is negative log-likelihood with a description penalty. Key steps such as identifying uncertainties, generating candidates, and evaluating predictions still rely heavily on LLM prompts and hand-tuned heuristics rather than the theoretical framework itself. This creates a gap between the methodology and its empirical implementation, making it hard for readers to see the framework's value.

  1. Incomplete Ablation and Baseline Controls

Ablations show modest drops when replacing numerical modules with LLM judgments (e.g., success falls from 55.1% to 53.8% or 54.3%), which does not fully justify the complex contract protocol. A stronger control would fix the memory structure and LLM backbone while replacing the variational gate with a simpler prospective validation method. Additionally, the mechanism accuracy checks in Table 7 compare different subsets of rules without controlling for task difficulty.

  1. Evaluation Discrepancies and Auxiliary Model Access

Several experimental setup details remain unverified:

  • It is unclear whether the 228 WebArena "building" tasks are completely excluded from the 684 test tasks.

  • ReasoningBank updates memory continuously during evaluation, whereas PACT-Agent uses a separate building phase.

All configurations (including Qwen3-32B) rely on Gemini-2.5 models for the Builder and retrieval, creating an auxiliary model asymmetry that baseline comparisons do not account for.

Questions for authors
  1. Which specific algorithmic component or theoretical insight is provided by the Active Inference formulation beyond standard utility-plus-information-gain planning? Please clarify how this framework differs conceptually and operationally from existing approaches

  2. What experimental evidence isolates the specific advantage of the predictive-contract and admission protocol over a simpler prospective hypothesis-testing baseline that shares the same memory structure, candidate generation, auxiliary models, and interaction budget?

  3. How does the system handle edge cases where the correct mechanism is omitted from the LLM-generated candidate set, multiple hypotheses share an incorrect prediction, or the generated outcome criteria are misleading?

2 comments

Thank you for pushing us to sharpen both novelty and empirical controls.

W1–W2 (Methodological novelty; Active Inference “rebranding”). Thank you to the reviewers for pointing out the need for further clarification of the innovative positioning. The work mentioned by the reviewers has indeed studied rule construction, information gain-driven exploration, Bayesian updates, and revising environmental knowledge through feedback. PACT-Agent's specific innovative contribution and design lies in organizing the local mechanism explanations generated by LLM into executable and verifiable predictive models, specifying how these predictions will be used in subsequent learning, and naturally organizing and coordinating these processes using the theoretical framework of active reasoning—features absent in previous work—and demonstrating that the theoretical framework is not merely a wrapper.

PACT-Agent's overall contribution is the joint design of evidence collection and cross-task rule revision in the task: the system both determines what action should be taken next to differentiate competing explanations and explicitly specifies the evidence upon which a rule can be accepted and verified.

Compared to previous rule and memory construction methods such as AutoManual, PACT-Agent adds explicit prediction and active differentiation of competing mechanisms, rather than simply revising rules based on feedback after application. On the other hand, previous Bayesian update methods like BED-LLM were only tested in dialogue and small-scale experimental scenarios, failing to naturally integrate the exploration process into the completion of real tasks and the updating and exploration of rule beliefs across tasks. Our method's contribution lies in further addressing the problems in environmental interactions: how to determine a certain result from the original return, and which rule version this result actually verifies. These problems cannot be simply solved by piecing them together, but our method naturally solves them simultaneously using the active reasoning theoretical framework.

For example, consider this specific problem: task success is not necessarily sufficient to identify the environmental mechanism. For instance, after executing Save→Confirm→ReadBack, a new value is seen, simultaneously accepting both the interpretation that "Save has already persisted" and "Confirm has completed persistence." Repeatedly executing this process successfully still cannot determine whether Confirm is necessary. PACT compares the predictions of the two mechanisms for candidate policies, scheduling ReadBack before Confirm, causing them to produce different observable results. Here, what changes is the evidence generated by task execution, not just how to summarize experience after the task ends. Regarding this issue, our proposed method effectively addresses it by using a predictive contract to establish a fixed local check for the natural language mechanism before execution. The contract simultaneously binds the rule version, complete mechanism candidates, belief state, outcome identification criteria, and the predicted trajectory of candidate strategies under each mechanism. Strategies can branch based on actual visible results and compare task progress, invocation costs, and mechanism information gain under the same sub-objective. After execution, belief updates must use the previously saved predictions and criteria.

The role of Active Inference is precisely to define clear decision-making and update objectives for the local predictive model provided by LLM. These calculations are operationally significant: they determine which strategy to adopt, how to change the mechanism belief, and whether to accept a rule version. However, its mathematical form belongs to the existing Bayesian model comparison and description complexity regularization.

W3 / Q2 (Stronger ablation vs. simpler prospective testing). We added a locked-setting comparison on WebArena B–T (Gemini-2.5-flash, 228/456 split, three runs): same Entity/Rule/Skill memory, same Worker candidate generation (≤3 mechanisms, ≤3 policies), same Worker/Builder/retrieval models, same step and proposal limits, only the decision/admission logic changes.

VariantSR (%)
Full PACT52.6 ± 0.6
PACT contracts + EFE + saved-predictions updates; VFE → simple prospective admission (reject replay-inconsistent proposals; keep unresolved until posterior > 0.95)51.4
Simple verify-then-act (no contracts; one-step mechanism predictions; shortest discriminating action else subgoal action; compatible admission)49.4

Full PACT remains ahead, supporting that the contracted EFE objective and frozen multi-step predictions, not memory structure alone, contribute beyond lightweight hypothesis testing.

W4 (WebArena split; auxiliary models). Resolved as for Reviewer 8WMq: B–T (456 held-out) vs. TTA (684 online). For backbone symmetry concerns: our main Qwen setup uses a Gemini Builder/retriever; we now report Qwen3-32B for Worker, Builder, and retrieval on ALFWorld: 96.3% overall (vs. 94.8±0.7 in an earlier run—revised paper uses the three-run mean), showing the pipeline is not tied to a stronger auxiliary model on that benchmark.

Q1 (What does Active Inference add operationally?). Beyond standard utility+IG planning: (1) same generative object for pre-action epistemic value and post-action belief revision under a saved contract; (2) VFE replay gate linking admission to description-complexity-regularized evidence; (3) prospective validation decoupled from retrospective admission. These are implemented as concrete algorithmic stages, not narrative only.

Q3 (Missing mechanism, tied wrong predictions, bad outcome criteria). Three distinct failure modes; protections are conditional:

First, the true mechanism is not in the candidate set. If, at a certain step, the actual observation is not supported by any candidate, the normalization term in belief update formula 6 will become 0. The system's handling mechanism is to enter a rule suspension state, pausing the old version: retaining the old contract, prediction, and actual return, and ceasing to use the invalid version for numerical decision-making. Then, the Worker executes normally: the Worker can propose new or revised mechanisms based on contradictions, set positive initial weights, normalize them, freeze the new prediction contract, and continue the task (the numerical module prioritizes actions that can both advance the task and distinguish new candidates). If the Worker cannot find a reliable test, it continues with ordinary executable actions. After the task is completed, the modifications are reviewed and stored: the Builder evaluates the structural modifications using fixed replay and complexity targets; newly added mechanisms remain in a pending verification state and are verified through subsequent pre-specified prediction checks.

Second, multiple candidates give the same erroneous prediction. Under the deterministic contract adopted in this paper, if two candidates both predict the old value but actually read a new value, the weights of both candidates will be reduced to zero. If other candidates predict a new value, the posterior is re-normalized among these candidates; otherwise, the above rule is triggered to pause. Conversely, if the old value is indeed read, this observation cannot distinguish between the two candidates, and their relative weights remain unchanged. Repeating the same check will not increase the evidence to distinguish them; a way needs to be found that makes them predict different actions.

Third, the result criterion itself is flawed. Taking the save operation in the paper as an example, the page displaying "Save successful" may only indicate that the request has been accepted. If the contract directly defines this prompt as "New value has been persisted," then even if the worker accurately reads the prompt, the belief update may still support an incorrect conclusion. This falls under whether LLM can ground their results; we have evaluated this accuracy in Table 7 and found that the accuracy is consistently above 92%.

Reviewer_8WMgOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

PACT-Agent builds external rule memory with fixed language models. It tests competing mechanisms through predicted action outcomes and chooses policies using utility, cost, and information gain. Memory revisions are scored by replay evidence and description length, then checked in future interactions. Experiments cover WebArena, AndroidWorld, and ALFWorld.

Critical strengths
  1. Saving predictions before execution makes decisions auditable and links action selection to belief updates. Separating rules that explain past observations from rules validated in later interactions addresses a real limitation of retrospective memory construction.
Critical weaknesses
  1. The evaluation setup and baseline results need clarification. Appendix E.1 uses 228 WebArena tasks to build memory, selects a 120-task probe from leftover tasks, and reports results on 684 tasks. Without task IDs, I cannot tell whether building tasks are included in final testing. Table 1 includes JitRL scores, but Appendix E.1 says JitRL is discussed only in related work because it uses a different test split. Borrowed ReasoningBank results use online memory construction, whereas PACT starts with prebuilt memory. Matching the Worker model alone does not establish equal learning exposure or compute. Comparable access to building interactions and auxiliary models needs to be established.
  2. The contribution beyond earlier rule-learning methods is not clear. [1] already combine natural-language hypotheses, numerical information-gain experiment selection, Bayesian belief updates, and a prior favoring shorter hypotheses. [2] alternates active exploration with Bayesian revision of environment theories. [3] learns persistent rules from predicted-versus-observed trajectories. These uncited precedents narrow the novelty claim. PACT differs through its prediction interface, versioned memory, and separation of retrospective admission from later validation. These are plausible contributions; the EFE/VFE identities alone do not establish a new learning principle. Table 4 shows component benefits, but lacks an existing numerical hypothesis-testing approach adapted to the same memory setting. The 55.1% versus 52.6% prompt-level comparison does not fill this gap.

References:
[1] Doing Experiments and Revising Rules with Natural Language and Probabilistic Reasoning. NeurIPS 2024. https://arxiv.org/abs/2402.06025
[2] WorldLLM: Improving LLMs’ world modeling using curiosity-driven theory-making. 2025 preprint. https://arxiv.org/abs/2506.06725v1
[3] WALL-E 2.0: World Alignment by NeuroSymbolic Learning improves World Model-based LLM Agents. 2025. https://arxiv.org/abs/2504.15785

Questions for authors
  1. Which WebArena task IDs are used for building and final testing? Are the 228 building tasks excluded from the 684-task evaluation? Please report results on unseen tasks and clarify whether belief updates carry over between test tasks.
  2. Where do the JitRL scores come from, given Appendix E.1? How do results compare with ReasoningBank and the strongest rerun baseline using the same building data, auxiliary models, and total interaction/token budget?
  3. How does PACT compare with the Bayesian rule learner in [1] adapted to the same candidates, memory retrieval, and budget? Does the contract and memory-validation design improve task success or learned-rule reliability beyond that baseline?
2 comments

We appreciate the detailed feedback on evaluation protocol and prior work.

W1/Q1/Q2 (Evaluation setup, JitRL, learning exposure). We agree the original manuscript was unclear and could conflate learning exposure across methods.

Correction: We previously built memory on 228 WebArena tasks and reported results on all 684 tasks, including the 228 building tasks. That mixed seen and unseen tasks and did not match the learning exposure of online-adaptation baselines. We originally aimed for comparability with prior reporting (AWM, ReasoningBank, JitRL) but should have separated protocols explicitly.

Revised evaluation (Table 1 + Appendix E):

B–T: memory built on a stratified 228-task building split (62 Shopping / 61 Admin / 60 GitLab / 35 Reddit / 10 Multi-site); 456 held-out tasks for testing (125/121/120/71/19). Building tasks are excluded from B–T test scores. AutoManual, ExpeL, and MemRL use the same split. TTA: memory starts empty; after each of 684 tasks the trajectory updates cross-task memory—matching ReasoningBank and JitRL. Belief states and mechanism posteriors carry over across tasks within a run. JitRL: Table 1 JitRL numbers are from our re-run of the open-source implementation on the 684-task TTA stream with accumulating experience memory. The earlier appendix note that JitRL appears “only in related work” was incorrect and has been fixed. We now distinguish our reproduction from the original paper’s split where they differ.

Fairness: We report build vs. test token counts (Appendix token table). TTA baselines receive ongoing memory updates during evaluation; B–T methods pay extra building cost for prospective contracts but test on frozen memory on held-out tasks. Both protocols are now explicit so readers can judge exposure fairly.

W2 & Q3 (Novelty vs. [1–3]; Bayesian rule learner baseline). We thanks for pointing out these relevant works. We agree that [1] has already combined natural language hypotheses, numerical information gain, Bayesian updates, and simplicity priors. The contribution of PACT-Agent needs to be explained by how it supports persistent rule learning in real-world tasks.

Compared to [1], PACT first changes the objective served by the selection of experiments. [1] selects the most informative experiments around the current hidden rule; PACT, on the other hand, needs to determine which environmental mechanisms hold true while completing the user task. Therefore, the candidate is the task policy that allows for further branching based on observations, and its score considers sub-goal completion, environmental invocation cost, and mechanism information gain simultaneously. PACT explicitly incorporates this distinction into numerical decision-making, enabling mechanism testing to directly serve task execution.

Secondly, PACT maintains environmental rules that are retained across tasks. [1] demonstrates sequential hypothesis revision within the same hidden rule task, without implementing or evaluating persistent rule base updates between independent tasks. PACT retains multiple local rules with applicable scope in the construction of the task sequence, and subsequent tasks retrieve existing rules and continue to test and revise them for new objects and states. Accordingly, the system also needs to address the issue of obtaining verification evidence from real-world feedback: clearly defining result labels and identification criteria before execution, returning interpretations based on saved criteria after execution, and updating the beliefs of the corresponding rule version.

Furthermore, Builder evaluates whether a local memory modification is worth retaining. Its complexity cost covers the rule description, scope of application, candidate mechanisms, and the new supporting descriptions required for prediction, not just the length of a candidate hypothesis sentence. New and old versions are compared on the same playback record; revisions are only accepted if the improvement in evidence sufficiently compensates for the increased descriptive cost.

Rule acceptance and mechanism verification also have different roles. An explanation proposed after seeing historical results can be retained due to improved historical fit, but only subsequent discriminative predictions and actual observations can support the version's verification. Version and prediction records maintain a clear distinction between "what was explained" and "what was predicted in advance" during cross-task revisions.

Compared to WorldLLM and WALL-E 2.0, PACT more directly selects actions based on mechanism divergences in the current task. WorldLLM guides exploration based on prediction error or learning progress, while WALL-E learns rules through the difference between predictions and actual results, primarily examining the success or failure of actions. PACT, however, considers an easily overlooked scenario: all actions succeed, yet the existing trajectory is insufficient to determine which interpretation is valid. For example, a new value is read after Save and Confirm, accommodating both "Save already persisted" and "Confirm only persisted." PACT can choose to read first and then confirm if necessary, allowing the two mechanisms to produce different observations while preserving the path to complete the task. It thus explicitly compares what discriminative evidence different task strategies provide.

Therefore, our contributions are positioned at mechanism testing in tasks, cross-task rule maintenance, and memory revision with explicit evidence and complexity criteria. EFE/VFE provides a unified, computable formulation of these operations; we do not present information gain, Bayesian updates, or the principle of simplicity itself as new learning principles.

Reviewer_pfRdOpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper presents PACT-Agent, a self-evolving LLM-agent framework that uses predictive contracts to test competing explanations of environment behavior. Before taking action, the Worker specifies the outcomes expected under different mechanisms and candidate policies. It then selects a policy using an Expected Free Energy (EFE) objective that balances task progress, action cost, and information gain, and updates its beliefs based on the observed result. After each task, the Builder proposes memory revisions and uses a Variational Free Energy (VFE) criterion to balance explanatory fit against description complexity. Rules inferred retrospectively remain unresolved until they are tested prospectively. Experiments on WebArena, AndroidWorld, and ALFWorld show improvements over several memory-based agent baselines.

Critical strengths

The paper addresses a limitation of existing agent-memory methods: a successful trajectory does not necessarily reveal why an action worked. Gathering evidence that distinguishes possible explanations before committing to a rule is a worthwhile direction.

Predictive contracts connect mechanism hypotheses, expected outcomes, and belief updates. Fixing predictions before execution makes the process easier to inspect and limits post-hoc explanations.

The Worker uses EFE to select actions, while the Builder uses VFE to revise memory. The two stages have clear roles, and the paper provides mathematical derivations and implementation details.

Critical weaknesses
  1. The paper discusses BED-LLM, Bayesian-Agent, and AutoManual, but it is still difficult to tell which advantages are specific to PACT-Agent. Information gathering under uncertainty and learning rules from interaction are not new on their own. A closer comparison of how these methods represent uncertainty, choose actions, and update memory would help clarify what the predictive-contract and EFE/VFE formulation adds.
  2. The implementation uses two or three mechanism hypotheses, at most three candidate policies, and no more than three predicted environment calls per policy. Although the agent replans after each action, each contract covers only a small part of the environment's behavior. It is unclear how well this approach handles interacting mechanisms, delayed effects, or hypotheses that require longer sequences to distinguish. The stochastic extension and observation-noise tests do not directly address these cases.
  3. The ablations show that information gain, belief updates, and VFE-based memory admission contribute to performance. However, they do not fully rule out simpler numerical strategies using the same predictive contracts. For example, the Worker could select informative actions subject to a task-progress constraint or follow a simple verify-then-act strategy, while the Builder could admit rules using prediction-error and complexity thresholds. Comparisons under matched interaction and token budgets would help establish the added value of the specific EFE/VFE objectives.
Questions for authors

The main questions are reflected in the weaknesses above.

1 comment

We thank the reviewer for the constructive comments and for recognizing the value of evidence that distinguishes competing explanations before a rule is trusted.

W1 (Novelty vs. BED-LLM, Bayesian-Agent, AutoManual). We agree that information gathering and rule learning are not new in isolation. Our contribution is a different evidentiary standard: PACT separates (i) verifying that a workflow succeeds from (ii) obtaining discriminative evidence for which mechanism explains that success, and uses this distinction both in action selection and in when a rule may be reused.

vs. AutoManual: AutoManual already supports rule application, feedback, and repair, but full workflow success need not identify the mechanism. Example: Save → Confirm → ReadBack succeeding is consistent with “Save persists immediately” and with “Confirm is required to persist.” Repeating the same workflow still cannot tell whether Confirm is necessary. PACT compares mechanism-conditioned predictions and can schedule ReadBack before Confirm so the two mechanisms yield different observable outcomes. A rule that only retroactively fits a success trajectory does not earn unconditional reuse.

vs. Bayesian-Agent: Its context-conditioned posterior targets skill reliability (patch/split/retire skills). In the example above, both mechanisms can yield a fully successful skill; that evidence supports skill validity but not which step caused persistence. Mechanism-conditioned predictions let the Worker detect observational equivalence and plan discriminative environment actions.

vs. BED-LLM: BED-LLM uses EIG for active collection but updates beliefs via candidate generation, historical consistency filtering, and normalization. For a fixed Rule version, PACT freezes mechanism-conditioned predictions before execution and uses the same predictive model for planning information gain and post-hoc Bayesian updates. Planned information gain and post-hoc evidence are therefore aligned within the contract; explanations invented after the fact cannot be credited with having predicted earlier outcomes. Policy scoring explicitly trades subgoal progress, call cost, and mechanism information gain, embedding mechanism tests in task execution.

EFE and VFE implement two decisions: EFE chooses actions that yield task-relevant discriminative evidence; VFE compares old and new memory on the same replay log and admits a revision only when evidence gain outweighs added description cost. We position our contribution in these concrete sampling, update, and usage constraints (under the contract’s finite candidates, predictions, and outcome criteria), not as claiming novelty for EIG, Bayes, or parsimony per se.

W2 (Short contracts, interacting mechanisms, delayed effects). PACT uses local contracts to test mechanisms tied to the current decision; it does not claim to identify the full environment in three steps. The three-call cap does limit which tests can be designed actively; we therefore ran a contract-depth ablation on WebArena B–T (Gemini-2.5-flash, all other hyperparameters fixed), increasing the max environment calls per predicted branch from 3 to 5 (three runs each): H=3 (default): 52.6% ± 0.6; H=5: 53.2% ± 0.7. The gain is small relative to building cost and global step limits, so we keep H=3 to focus on local mechanism discrimination. Interacting mechanisms and long delayed effects remain important future work.

W3 (Simpler numerical strategies under the same contracts). Our choice of EFE/VFE is based on their explicit probabilistic interpretation within the local model declared in this paper. The Worker aims to incorporate task preference, interaction cost, and expected mechanism information gain into the same decision criterion; the Builder aims to compare model evidence with prior description length. Theoretical derivations explain the origin of these specific criteria, but do not imply that they are superior to other reasonable numerical strategies on all tasks.

Regarding the prediction error and complexity thresholds proposed by reviewers, their specific definitions need further clarification. Our VFE gating is equivalent to "logarithmic evidence improvement exceeding the cost of additional description complexity." If alternative methods employ the same marginal evidence and joint thresholds, they represent an equivalent implementation of our gating. If alternative methods employ independent error and length thresholds, different decisions will be made: our paper allows for more complex revisions when the evidence improvement is sufficiently large, while rejecting verbose rewrites that do not add evidence. Furthermore, our evidence computation requires a complete replay of the same candidate mechanism explanation, avoiding the selection of different explanations one by one to obtain a superficially low prediction error.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.