WMAttack, an automated attack-search framework for adversarial evaluation of world-model agents, is introduced and a theoretical explanation showing that proposal refinement improves finite-budget search when it shifts probability mass toward high-utility attacks is provided.
Zhixiang Guo, Si-Yuan Liang, Shi Fu et al.· arXiv.org· 6 citations
This work analyzes the decoding trajectories of LLaDA 2.0 and identifies a recurring diffusion confidence trap, which improves LLaDA 2.0 over confidence-based decoding, leading to more reliable mathematical reasoning.
Zhenhong Sun, Han-Qing Zhao, Yatao Bian et al.· 0 citations
This paper first proves that TFS is a sufficient condition for weight disentanglement, and finds that TFS also gives rise to an observable geometric consequence: weight vector orthogonality, which positions TFS as the common cause for both the desired functional outcome and a measurable geometric property.
Shan Liu, Yuehan Yin, Lei Wang et al.· arXiv.org· 3 citations
This work introduces an evolutionary, task-agnostic, strategy-guided, executably-checkable data synthesis framework that, from minimal seed supervision, jointly synthesizes problems, diverse candidate solutions, and verification artifacts, and iteratively discovers strategies via a consistency-based evaluator that enfo...
He Du, Bowen Li, Aijun Yang et al.· Annual Meeting of the Associ...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
