跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-18 11:21 — 2026-11-19 11:21(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

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

Persistent Recursive Worlds Enable Autonomous Software Evolution

Beichen Huang, Zhenyu Liang, Bowen Zheng, Ran Cheng

原文摘要

Software systems accumulate dependencies and design commitments over time, while the agents that modify them operate within bounded sessions. How, then, can development remain cumulative across generations of transient agents? We introduce EvoX Genesis, which organizes development as a persistent recursive software world. Agents enter an accepted repository version, delegate work within local scopes, and submit changes for verification and parent review. Once accepted, those changes pass to later episodes together with the contracts and tests used to assess them. The project thus preserves both earlier work and a basis for evaluating what comes next. We examine this continuity through four studies of formation, continuation and redevelopment. Starting without compiler code, Genesis built a C compiler with 219,676 lines of Rust source through 1,019 agent episodes over 123.4 hours. Within this growing implementation, repairs increased passes on a fixed set of 100 Csmith programs from 61 to 93; a subsequent revision retained all 93 passes. Development also continued in a separate compiler lineage when DeepSeek V4 Flash inherited a GLM 5.2 snapshot. To examine continuity when the implementation itself changes, Genesis redeveloped selected MESA functionality in Rust, with numerical agreement assessed against the Fortran reference across six workloads. The WebGL trajectory, meanwhile, exposed both repairs and regressions as repeated checks recorded progress towards 2,017/2,019 conformance pages passed. A complementary EvoX Compiler case connects program-merging performance to executable graph and backend contracts. Together, these records trace how accepted work becomes a foundation for further development: later agents inherit both usable implementations and concrete ways to assess further revisions.

cs.SE · cs.AI · cs.MA · cs.NE

新论文 · v1arXiv:2610.36616

Normalized Cuts and Data Clustering via Matrix Fractional Programming

Yannan Chen, Beichen Huang, Licheng Zhao, Chris Ding, Kaiming Shen

原文摘要

The normalized cut (NCut) problem is a fundamental one in the area of data clustering. Despite its fractional structure, the NCut problem is seldom considered from a fractional programming (FP) perspective in the existing literature. The main reason is that the conventional FP method is inadequate for this problem case: the classical Dinkelbach's transform can only handle a single ratio and hence is limited to the two-class clustering, whereas the multi-class clustering involves multiple ratio terms. This work proposes a novel so-called multidimensional quadratic transform that is capable of dealing with the multi-ratio case; it recasts the NCut problem into a bipartite matching problem---which can be immediately solved by linear search. Furthermore, we explore the connection between the proposed FP method and the minorization-maximization (MM) theory, and in turn characterize the convergence behavior of our algorithm. Finally, we conduct experiments to numerically demonstrate the advantages of the proposed FP-based algorithm in a variety of data clustering and image segmentation tasks.

cs.LG · eess.SP