QM
Qiuyang Mang
cs.CLcs.AIcs.LGcs.SEcs.DBcs.PLcs.SIcs.CVcs.NEcs.CR
On Valency
published · living versionsW_472urbcs·v1 · currentpublished
FrontierCS 2: A Benchmark for Computer Science R&D
with Wenhao Chai, Runyuan He, Dongruixuan Li, Zihan Zheng +56
1 version
Preprints & journals
24 papers in the corpus · 2023–2026FrontierCS 2: A Benchmark for Computer Science R&D2610.29932v1 · Qiuyang Mang, Wenhao Chai, Runyuan He et al.2026 · 0 citationsarXivon Valency
Scaling Discovery Requires Forgetting2610.20563v1 · Shangyin Tan, Ben Zhou, Lakshya A Agrawal et al.2026 · 0 citationsarXiv
Stateless Language Agents: Scaling Long-Horizon Automated Research2610.07625v1 · Qizheng Zhang, Changxiu Ji, Isaac Sun et al.2026 · 0 citationsarXiv
EasyPPO: Stabilizing the Critic Is Key2609.36802v1 · Xuanyi Zhou, Qiuyang Mang, Huanzhi Mao et al.2026 · 0 citationsarXiv
When Agents Slow Down: Understanding LLM Agents' Test-Time Strategies via Elo-per-token Analysis2609.15309v1 · Kaiyuan Liu, Qiuyang Mang, Bo Peng et al.2026 · 0 citationsarXiv
DeployBench: Benchmarking LLM Agents for Research Artifact Deployment2606.05238v2 · Yuanli Wang, Yaoyao Qian, Yue Zhang et al.2026 · 0 citationsarXiv
Agents' Last Exam2606.05405v4 · Yiyou Sun, Xinyang Han, Weichen Zhang et al.2026 · 0 citationsarXiv
FrontierSmith: Synthesizing Open-Ended Coding Problems at Scale2605.14445v1 · Runyuan He, Qiuyang Mang, Shang Zhou et al.2026 · 0 citationsarXiv
OpenDeepThink: Parallel Reasoning via Bradley-Terry Aggregation2605.15177v2 · Shang Zhou, Wenhao Chai, Kaiyuan Liu et al.2026 · 0 citationsarXiv
Do Androids Dream of Breaking the Game? Systematically Auditing AI Agent Benchmarks with BenchJack2605.12673v1 · Hao Wang, Hanchen Li, Qiuyang Mang et al.2026 · 1 citationarXiv
PLOP: Cost-Based Placement of Semantic Operators in Hybrid Query Plans2604.09944v2 · Qiuyang Mang, Yufan Xiang, Hangrui Zhou et al.2026 · 0 citationsarXiv
Combee: Scaling Prompt Learning for Self-Improving Language Model Agents2604.04247v2 · Hanchen Li, Runyuan He, Qizheng Zhang et al.2026 · 0 citationsarXiv
SVG-EAR: Parameter-Free Linear Compensation for Sparse Video Generation via Error-aware Routing2603.08982v2 · Xuanyi Zhou, Qiuyang Mang, Shuo Yang et al.2026 · 0 citationsarXiv
EvoX: Meta-Evolution for Automated Discovery2602.23413v2 · Shu Liu, Shubham Agarwal, Monishwaran Maheswaran et al.2026 · 1 citationarXiv
AdaEvolve: Adaptive LLM Driven Zeroth-Order Optimization2602.20133v1 · Mert Cemri, Shubham Agrawal, Akshat Gupta et al.2026 · 2 citationsarXiv
Curing Miracle Steps in LLM Mathematical Reasoning with Rubric Rewards2510.07774v3 · Youliang Yuan, Qiuyang Mang, Jingbang Chen et al.2025 · 0 citationsarXiv
Automated Discovery of Test Oracles for Database Management Systems Using LLMs2510.06663v2 · Qiuyang Mang, Runyuan He, Suyang Zhong et al.2025 · 1 citationarXiv
AutoCode: LLMs as Problem Setters for Competitive Programming2510.12803v1 · Shang Zhou, Zihan Zheng, Kaiyuan Liu et al.2025 · 0 citationsarXiv
Scalable Approximate Biclique Counting over Large Bipartite Graphs2505.10471v2 · Jingbang Chen, Weinuo Li, Yingli Zhou et al.2025 · 1 citationarXiv
Finding Logic Bugs in Spatial Database Engines via Affine Equivalent Inputs2410.12496v2 · Wenjing Deng, Qiuyang Mang, Chengyu Zhang et al.2024 · 3 citationsarXiv
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index2406.00344v2 · Qiuyang Mang, Jingbang Chen, Hangrui Zhou et al.2024 · 2 citationsarXiv
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks2402.05006v2 · Jingbang Chen, Qiuyang Mang, Hangrui Zhou et al.2024 · 3 citationsarXiv
Retromorphic Testing: A New Approach to the Test Oracle Problem2310.06433v1 · Boxi Yu, Qiuyang Mang, Qingshuo Guo et al.2023 · 0 citationsarXiv
Automated Testing and Improvement of Named Entity Recognition Systems2308.07937v1 · Boxi Yu, Yiyan Hu, Qiuyang Mang et al.2023 · 9 citationsarXiv
Career total: 31 works. 24 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.