arXiv AI By Jiaxing Sun, Xuli Shen, Jiang Wu, Ruiyi Ding, Ruikang Zhang, Xiao An, Xibao Li, Yubin Wang, Xingjian Wei, Yinfan Wang, Yu Liu, Lingli Ge, Xi Xue, Xiaojian Wang, Lijun Wu, Chang-Yu Hsieh, Yuqiang Li, Bowen Zhou, Dahua Lin, Conghui He

Reaction precedents extend retrosynthetic prediction beyond training coverage

Read the original on arXiv AI →

The study demonstrates that using reaction precedents during inference can significantly improve retrosynthetic prediction accuracy, even when the model’s training data is limited or outdated. By expanding only the retrieval corpus, the authors achieved a Top‑1 accuracy increase from 13.0% to 58.0% for transformations absent from training, and from 4.9% to 23.1% for temporally held‑out data. Across 14 general‑purpose models, precedents boosted performance on both test sets and USPTO‑50K, surpassing specialized models without any task‑specific fine‑tuning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 10

WorldAgen: Unified State-Action Prediction with Test-Time World Model Training

WorldAgen is a unified framework that jointly learns world modeling and action prediction using a shared Transformer backbone with two specialized heads. It introduces a Mixed Unidirectional Attention Mask to separate the world model and agent model, and enables Test-Time Training (TTT) by sampling exploratory actions and updating the world model with real state transitions. Experiments on CALVIN and LIBERO show that WorldAgen matches or surpasses state‑of‑the‑art methods, especially when TTT is applied to a few samples.

By Chi Wan, Kangrui Wang, Yuan Si, Pingyue Zhang, Manling Li
arXiv Machine Learning
Sep 17

Which Histories Matter for Time Series Forecasting? Learning Predictive Relevance with Future Supervision

The paper investigates which historical examples are most useful for time‑series forecasting by defining predictive relevance as the expected future utility conditioned on inference‑time information. It introduces a two‑stage approach: a normalized‑pattern retriever generates a coarse candidate set, and a lightweight MLP reranks these candidates using future‑supervised relevance while keeping inference strictly past‑only. Experiments on six benchmarks show that this reranker improves pattern retrieval and outperforms a matched‑protocol baseline, revealing that historical relevance is structured, domain‑dependent, and not governed by a single universal retrieval rule.

By Yong-Hoon Choi, Kwang-Hyun Park, Youngjin Cho