The paper introduces Specified-Foil Counterfactuals for temporal graphs, a method that seeks low‑cost past‑event interventions to make a user‑specified alternative outcome the top prediction. It uses trace‑guided search to compare completed executions of the original prediction with reconstructed incomplete executions of the foil, mapping differences to operations such as DELETE, INSERT, REWIRE, RELABEL, and SHIFT, and then verifies the foil through exact replay. Experiments on continuous‑time dynamic graphs and temporal knowledge graphs show that the approach retains most greedy successes while dramatically reducing predictor evaluations and achieving the specified foil in a majority of cases.
By Minwoo Yu, Young-guk Ha
arXiv:2603. 16475v2 Announce Type: replace Abstract: In schema-guided reasoning (SGR) pipelines, LLMs produce explicit intermediate structures -- rubrics, checklists, or verification queries -- before committing to a final decision.
By Oleg Somov, Mikhail Chaichuk, Gleb Ershov, Karim Vafin, Mikhail Seleznyov, Alexander Panchenko, Elena Tutubalina
arXiv:2609. 05019v1 Announce Type: new Abstract: Agents tend to optimize, select, or constrain execution structures before decisive runtime outcomes are observed.
By Tianxing Wang, Mingming Zhao, Shuai Huang, Huiyang Xu, Chaoyue Niu, Shengzhong Liu, Fan Wu
Causal diagnostic models must explain how conclusions follow from evidence because diagnoses guide repairs and treatments. Yet serious cases are scarce, records rarely contain reasoning paths, and data transfer poorly across configurations, complicating local deployment.
arXiv:2607. 11327v1 Announce Type: cross Abstract: Model editing keeps large language models (LLMs) up to date without retraining, but temporal facts expose a limitation of the prevailing locate-and-edit paradigm: an update is not always a replacement.
By Chen Huang (Tsinghua University), Qi Zheng (Tsinghua University), Ruiqin Zheng (ByteDance), Long Zeng (Tsinghua University), Yuantong Xu (ByteDance)
The paper introduces RIPPLE, a method for adapting workflow-synthesizing agents through prompt-policy editing without retraining the underlying model. RIPPLE diagnoses failed execution trajectories, maps failures to specific policy segments, and restricts edits to those segments. It then evaluates candidate edits in isolation and replays only those that remain safe after composition, achieving up to a 23.1% improvement in validation success on a synthetic benchmark and positive gains on additional language‑model backbones.
By Manqing Mao, Hong Wang, Samson Koelle, Jie Yuan, Zhuoer Wang, James Feng, Yanjun Lin, Daniel Edmiston, Nikki Lijing Kuang, Zhecheng Sheng, Wei Niu
STRIVE is a new framework for longitudinal radiology report generation that separates clinical reasoning into distinct Diagnosis, Attribute, and Temporal Change agents, each producing explicit evidence. The Temporal Change agent is refined with a Progression-Aware GRPO reward that differentiates direction-preserving errors from reversals. Verification occurs twice: a Consistency Gate aligns agent outputs before report generation, and a Validation Agent ensures the final report is supported by the aggregated evidence. On the Longitudinal-MIMIC dataset, STRIVE achieves superior clinical efficacy and more than doubles Longitudinal Change Concordance compared to the strongest baseline.
By Junyeong Maeng, Eunsong Kang, Heung-Il Suk
arXiv:2607. 25554v1 Announce Type: new Abstract: Future event prediction carries broad social impact yet remains challenging.
By Wanxu Cai, Zhengyu Chen, Huaisheng Zhu, Wei Wang, Jingang Wang, Qiang Xu
The paper introduces the Procedural Graph, a framework that structures procedural knowledge into (procedure, relation, procedure) triplets to guide large language model agents in planning and tool usage. At each decision point, a guidance model uses the local subgraph to bias the agent’s next action, while an LLM refiner self‑evolves the graph by editing its topology based on successful versus failed trajectories. Experiments across datasets and LLMs show that Procedural Graphs consistently outperform memory‑based baselines, and the self‑evolution mechanism further improves performance without manual engineering.
arXiv:2607. 13884v1 Announce Type: new Abstract: Large Language Model (LLM) agents have shown remarkable capabilities in autonomous decision-making by generating sequential trajectories of states, actions, and observations.
By Wenjun Wang, Yuchen Fang, Fengrui Liu, Zibo Liang, Kai Zheng
arXiv:2608. 03674v1 Announce Type: new Abstract: Causal diagnostic models must explain how conclusions follow from evidence because diagnoses guide repairs and treatments.
By Jian Zhang, Bingyi Wang, Yizhi Liu
The paper introduces Procedural Graphs, a framework that structures procedural knowledge for large language model agents as (procedure, relation, procedure) triplets, analogous to knowledge graphs for factual data. At each decision point, a guidance model uses the local subgraph to bias the agent’s next action, while an LLM refiner self‑evolves the graph by comparing failed and successful trajectories, editing its topology to improve performance. Experiments across various datasets, tasks, and LLMs show that Procedural Graphs consistently outperform memory‑based baselines, and the self‑evolution mechanism further enhances results without manual engineering.
By Yuxing Lu, Yicheng Chen, Shanchan Wu, Sercan \"{O}. Ar{\i}k