Showing cs.AIShow all
3 papers · 1 filter
cs.AI2026
ASCT: Attentive Search over Counterfactual Trees for Credit Assignment in Agentic Reinforcement Learning
Yang Li, Jinhan Yang, hai liu +8
Terminal utility evaluates a complete agentic workflow, but learning requires credit for the decisions within it. We introduce Attentive Search over Counterfactual Trees (ASCT), a…
cs.AI2026
Agent-UCT: Upper Confidence Bounds Applied to Trees for Cost-Aware Agentic Workflow Optimization
Yang Li, Hai Liu, Dian Shao +9
Workflow search pays for complete quality observations, whose execution cost changes as reusable prefixes accumulate. AgentUCT uses an economic model of the remaining evaluation co…
cs.AI2026
StateFuse: Deterministic Conflict-Preserving Memory for Multi-Agent Systems
Sergey Volkov, Yang Li, Ye Luo
Agent systems accumulate conflicting observations across branches, retries, and replicas, yet many practical memory layers still collapse disagreement behind overwrite rules that a…