- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies how agents can infer and adapt to user goals as requirements are progressively clarified or revised during open-ended, multi-turn dialogue. It introduces Open-Universe Assistance Games (OU-AGs), extending assistance games from fixed preference types to dynamically evolving goal sets. To operationalize this framework, the authors propose GOOD (GOals from Open-ended Dialogue), which uses LLMs to propose, prune, and rank natural-language goal hypotheses. Its probabilistic variant aggregates pairwise comparisons into Beta-based confidence estimates, which guide action selection and further clarification without additional model training.
The authors evaluate GOOD through limited-scale interactive experiments in grocery shopping, AI2-THOR household robotics, code generation, and simplified Stateful SWE tasks, alongside subsets of Lost in Conversation, PrefEval, and GoalBench. Interactive evaluations primarily use simulated users and LLM judges, supplemented by a small human-rating study. GOOD matches or exceeds full-context and summary baselines in some interactive settings and model configurations, with larger gains in robotics and coding. At the same time, improvements on the external benchmarks are limited and inconsistent. These results suggest that explicit goal tracking may be particularly useful when inferred goals can influence subsequent questions and actions.
Critical strengths
1. A useful formulation of evolving user intent. The paper addresses an important challenge: user requirements are often incomplete and become clearer or change during interaction. OU-AGs and GOOD provide an explicit, inspectable representation of candidate goals, making it possible to examine how inferred intent influences clarification and action selection.
2. Promising evidence in interactive settings. GOOD improves performance in several interactive task configurations, particularly robotics and coding. The small human-rating study also supports improvements over the full-context baseline in selected grocery and robotics experiments. The more mixed results on external benchmarks provide useful evidence about the method’s potential scope.
Critical weaknesses
1.The incremental contribution of probabilistic goal tracking is insufficiently isolated. Full-context and summary baselines do not establish whether the gains require probabilistic inference or primarily come from organizing user requirements and allocating additional computation. GOOD (prompt) provides a relevant partial control, but it also differs in pruning and planner inputs. The paper does not report comparisons with independent structured-memory methods or integrations into representative frameworks such as ReAct or Plan-and-Execute, despite claiming compatibility with existing action agents. This limits the evidence for GOOD’s distinctive contribution.
2.The evidence for reliable uncertainty-aware assistance remains limited. The Beta-based scores aggregate LLM comparison outcomes, but their calibration as confidence in user goals is not established. Candidate coverage is another unresolved limitation: Appendix A.1 shows strong ranking performance when the correct answer is guaranteed to be present, but no clear advantage when candidates must be generated. This analysis uses only 30 questions and does not establish how coverage failures affect downstream interaction or recovery. The small interactive task sets—particularly five simplified Stateful SWE problems—and reliance on simulated users and LLM judges further limit support for broader claims.
Questions for authors
1. Confidence under correlated evidence. The implementation accumulates pairwise judgments based on overlapping dialogue histories without correcting for their dependence. What justifies interpreting the resulting reduction in Beta variance as increased knowledge of user intent? Is there evidence that confidence remains reliable when additional comparisons provide little new user information?
2. Adaptation to preference revisions. Retained candidates preserve their historical win/loss counts, without an explicit forgetting or change-detection mechanism in the main update path. How quickly does GOOD revise a previously confident goal after the user contradicts it? Can the authors provide evidence distinguishing adaptation to genuine preference changes from ordinary refinement?
3. Recovery from inadequate candidates. The implementation proposes new candidates each round and retains an undefined Baseline hypothesis. How reliably do these mechanisms distinguish an inadequate candidate pool from a sufficiently supported goal? Is there evidence showing that GOOD detects and recovers from coverage failures before taking incorrect actions?
3 comments
Dear reviewer,
Thank you for your time and thoughtful feedback on our submission. We have posted our rebuttal response and would be grateful if you could take a look at our response when you have a chance. Thank you again for your help in improving our work.
Thank you for the response. However, the lack of comparisons with a sufficient number of strong baselines remains a major issue.
Thank you for the careful review. We are glad you found that OU-AGs and GOOD give an explicit, inspectable representation of evolving user intent, and that the interactive results, especially in robotics and coding, and the human-rating study are promising.
Calibration and correlated evidence: The reviewer is correct that the Beta mean is a relative win rate among candidates, not an exact calibrated probability, we treated it as a ranking and gating signal that is more principled and allows for interpretability rather than just one-shotting an LLM model end to end. Goals that pass the "certain" gate are correct 84% of the time, though ranking helps much more in coding than in grocery, where most candidates are already acceptable. Following your suggestion we tested a variant that decays old evidence (wins and losses multiplied by 0.9 each round), compares new goals against the current leaders, and caps the pool size (and removes a goal when its Beta mean is below 0.25 and it has at least 4 decayed wins+losses):
The decay makes GOOD more cautious: it acts on a wrong goal far less often, at the cost of asking in more rounds. For the camera ready of the paper, we will run all of the experiments with the decay.
**intent switching experiments: ** Our main runs cover cases where users reveal preferences gradually, so based on your suggestion, we run an additional intent-switch experiment. Partway through each grocery or coding episode, the simulated user changes a stated preference (a dietary constraint after the matching items are in the cart, or a style requirement after the code is written). A judge scores whether and how quickly the agent acts on the new preference, what fraction of the items the new preference requires end up in the final cart or code, and how well the final outcome matches the new preference overall (5 personas × 3 trials per domain, mean ± SEM):
GOOD (prob) acted on the reversal in every run, while Full Context missed it in 60% of coding and 32% of grocery runs. Summary Context is the fastest to respond to the reversal in coding (0.7 rounds), but its final code satisfies the revised requirement much less well (final alignment 6.2 vs. 9.5), and GOOD (prompt), which tracks the same goals without the probabilistic update, trails GOOD (prob) in both domains (7.7 vs. 9.5 alignment in coding; 64% vs. 91% coverage in grocery).
Isolating the probabilistic goal tracking; planning module: GOOD (prompt) is our closest control: it uses the same goal proposals and planner, and replaces the pairwise Beta inference with a prompted choice of the most likely goal. In the new intent-switch experiment (see Q2), GOOD (prob) beats GOOD (prompt) on final alignment in coding (9.5 vs. 7.7) and on coverage of newly required items in grocery (91% vs. 64%). On integration with existing agents: GOOD's action module is already an act–observe–replan loop over domain-specific actions, which takes the current goal beliefs as input each round, so using ReAct or Plan-and-Execute changes only the planner that consumes those beliefs.
**Recovering from inadequate candidates: ** A goal list with no correct candidate is rare and short-lived (58 of 590 rounds, mostly the first round of an episode), because new candidates are proposed every round and a correct one enters after about one round on average. In those rounds Baseline ranks first 60% of the time, against 5% otherwise (97% vs. 9% with decay), and GOOD asked the user a question before its first incorrect action in every run. Recovery therefore comes mainly from proposing new candidates.