By avoiding weight updates entirely, Nullify serves as an efficient, plug-and-play inference-time intervention framework for LLM unlearning, and matches or surpasses established baselines in forget quality while achieving near-lossless preservation of model utility.
Wei Zhai, Xiang Liu, Qiang Huang et al.· 0 citations
Results show that preserving already-correct work under unsupported accusation is a distinct safety challenge for long-lived agents, and introduces CAVE-Bench, a benchmark of 365 agentic tasks across six domains built around opaque tasks.
Xu-Tao Mao, Rui Qian, Long-Xiang Wang et al.· 0 citations
Verifiable rewards improve language models through reliable task-level feedback, but methods based on Group Relative Policy Optimization (GRPO) apply a sequence-level advantage uniformly across all tokens. This coarse credit assignment reinforces or penalizes entire responses without identifying which local decisions t...
Hai-Jiang Li, Cheng-Yue Lv, Yi Zhang et al.· 0 citations
Prospective Multimodal Memory Compilation is proposed, a framework that shifts part of the memory reasoning process from query time to memory consolidation time and improves answer quality and visual evidence recall while reducing query-time token and latency costs.
Jing-Yu Sun, Yang Lin, Yuyang Xue et al.· 1 citation
Tempered Evidence Fusion (TEF) is proposed, a training-free rule that weights each sentence's log-odds by its normalized information gain, as derived from a generalized Bayesian posterior, making the fused score nearly vanish for uncertain sentences while preserving the Bayes-optimal weight of decisive evidence.
Yu-He Wu, Rui Qian, Guang-Yu Wang et al.· 0 citations
Ro is proposed, a rubric-guided process reward framework for stepwise model routing that consistently outperforms strong baselines and achieves better accuracy and cost trade-offs.
Sheng-Hao Ye, Yu Guo, Zheng-Heng Li et al.· arXiv.org· 2 citations
Results suggest that AAPT performs best when candidate actions can be enumerated in advance, whereas reactive execution remains stronger when they cannot, and on an external benchmark, AAPT matches the overall performance of a reactive baseline, although the two methods exhibit complementary strengths.
A three-tier diagnostic taxonomy shows that verification/feedback and planning failures dominate execution/grounding errors, while a single scalar success rate can not explain, and connects these findings to newer long-horizon CUA benchmarks and derive stage-specific design rules for CUA evaluation.
Zi-Han Dong, Zhiyuan Ma, Zekun Wang et al.· arXiv.org· 2 citations
The Personal Agent Sycophancy Benchmark (PASB) is introduced, a 1,600-task benchmark that traces whether a conversational claim is accepted, written into durable agent state, and reused in a later neutral query, and shows that agent sycophancy is fundamentally a state-writing governance problem.
Xutao Mao, Liang Zhao, Leyao Wang et al.· 0 citations
Experiments on long-horizon embodied and web-agent benchmarks show that MemPrism consistently improves the task performance, especially as trajectories become longer, while reducing memory token consumption.
Zhi-Sheng Chen, Bingfan Zeng, Bangde Cao et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.