Skip to content

Author

Rui Qian

We have 9 of 24 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

VERPO: Verified Evidence Regularized Policy Optimization

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
Preprint Aug 2026

PMMC: Prospective Multimodal Memory Compilation for Long-Term LVLM Agents

Long-term memory is essential for LVLM agents to maintain consistency and integrate information across extended multimodal interactions. Existing agent memory systems, however, often reduce visual experiences into textual summaries or rely on static retrieve-then-reason pipelines, which are inefficient at query time an...

Jingyu Sun, Yang Lin, Yuyang Xue et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Count Evidence, Not Sentences: Tempered Evidence Fusion of LLM Judgments for Long-Text Value Measurement

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

Rubric-Guided Process Reward for Stepwise Model Routing

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. · 2 citations
Jul 2026

Why Are GUI Agents Correct but Late? Decode on the Decision-Time Critical Path, Tested with Pre-Compiled Policy Trees

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.

Zi-Han Dong, Rui Qian, Ruifang Qian et al. · 0 citations
Jul 2026

How Benchmarks Mis-Score Computer-Use Agents

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. · 2 citations
Preprint Jul 2026

Agents Don't Just Agree, They Remember: Benchmarking Persistent Sycophancy in Stateful Personal Agents

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
Preprint Aug 2026

MemPrism: Task-Conditioned Relational Memory Views for Long-Horizon Agents

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.