跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 06:59各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 07:31 — 2026-11-19 07:31(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 06:59库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,871 已收录论文22,375 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
新论文 · v1arXiv:2611.13925

OpenRE-Bench: A Benchmark Harness for Multi-Agent Requirements Engineering with Mined GitHub Issues

Haowei Cheng, Milhan Kim, Bowen Jiang, Weixing Zhang, Yuhong Fu, Zhixu Liu, Naoyasu Ubayashi, Hironori Washizaki

原文摘要

OpenRE-Bench is an open-source benchmarking infrastructure for large language model (LLM) based multi-agent requirements-engineering (RE) frameworks. Such frameworks are increasingly common, but they use different agent roles, negotiation policies, and output shapes, and are typically evaluated on their own runtimes, metrics, and small sets of curated system descriptions, which makes fair, reproducible comparison difficult. OpenRE-Bench addresses this with four reusable pieces: a shared run harness with one input, phase-artifact, and metric contract; an adapter mechanism through which a framework joins by implementing a single adapter, leaving cases, metrics, and other adapters untouched; a reproducible GitHub issue-mining pipeline that grows the corpus from real feature requests; and a versioned case suite. As a demonstration, we mine 3,000 fetched issues across five projects (three languages, five domains) into five cases, package them with five hand-built cases as the compact v1.0 suite, and run three heterogeneous frameworks (MARE and iReDev as paper-faithful reimplementations, plus QUARE) under one protocol. OpenRE-Bench originated as the evaluation back-end of our QUARE study and has since been reused by two further studies of our group. It is released with a pinned environment, a Docker image, frozen API snapshots, a 651-test suite, and the full pool of 1,396 filtered issues behind the mined cases.

cs.SE

版本更新 · v2arXiv:2606.26289

Augmentation with Dilution? A Large-Scale Empirical Study of Human Contributor Ecosystems After AI Coding Agent Adoption

Weixing Zhang, Bowen Jiang, Tianhai Liu, Jialong Li, Anne Koziolek

原文摘要

AI coding agents are rapidly proliferating in open-source software development, and the long-term sustainability of open-source projects is closely tied to the health of their human contributor ecosystems. Yet most existing studies treat human contributors as a static backdrop, and the available evidence on human participation after agent adoption mainly concerns newcomer outcomes. This paper takes the human contributor ecosystem as its dependent variable. To the best of our knowledge, it is the first study to estimate how agent adoption changes the number of distinct humans behind each pull request, and to relate this change to agent pull requests recorded under developer accounts. Using the AIDev dataset, GitHub API scanning, agent-trace screening, and two-stage propensity score matching, we construct a balanced panel of 2,246 treated and 3,798 control repositories from January 2023 to May 2026, and estimate effects with the Sun-Abraham estimator for staggered difference-in-differences, event studies, and HonestDiD sensitivity analysis. AI agent adoption is associated with a decline in human contributor density of 0.019 to 0.048, about 4-10% of its pre-adoption level, depending on the reference month (both p < 0.01); because this estimate tolerates only small violations of parallel trends, we regard it as suggestive evidence. The share of newcomers shows no detectable change (ATT = -0.009, p = 0.28), with the 95% confidence interval ruling out a decrease of more than 2.4 percentage points. Whether the decline in density is associated with agent pull requests recorded under developer accounts remains inconclusive (high minus low share: -0.013, 95% CI [-0.083, 0.057]). These findings are consistent with a pattern of augmentation with dilution: we detect no decrease in the share of newcomers, but each human contributor appears to correspond to more pull requests.

cs.SE

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1283ACL Anthology · ACL 2026

OptiCo: Adaptive Distributed Training Optimization via Collaborative Agent Reasoning

Sheng Chen Zhejiang lab, Tang Zhe, Weixing Zhang Zhejiang Lab, Fei Yang Zhejiang Lab, Yuanyuan Wang, Tianlin Li Beihang University, Yang Liu Nanyang Technological University

原文摘要

Optimizing distributed training strategies for large-scale deep learning models remains a critical challenge in both industry and academia, demanding extensive domain expertise and manual tuning. Existing automated distributed training frameworks are plagued by over-reliance on prior profiling, poor generalization across models/hardware, and scalability constraints stemming from vast search spaces, impeding real-world applicability. To address these challenges, we propose OptiCo, a model-driven multi-agent framework that leverages Large Language Models (LLMs) to enable automatic and explainable distributed training strategy configuration. OptiCo orchestrates a team of reasoning-driven agents, through a shared Global Message Pool facilitating persistent memory and coordination. By employing inception prompting and Chain-Of-Thought (COT) reasoning, agents iteratively refine configurations, detect bottlenecks, analyze failures, and optimize resource utilization. Evaluated across 25+ configurations spanning diverse model architectures, GPU types and scales, OptiCo outperforms expert-designed strategies within 20 iterations, achieving an average performance improvement of 1.84%, with gains ranging from 0.08% to 8.65%. The source codes are avaiable at https://github.com/TangZhe96/OptiCo-public.

cs.CL · cs.MA

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表