跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v2arXiv:2603.15437

Terminal Fano 4-fold Hypersurfaces via Deep Reinforcement Learning

Marc Truter

原文摘要

We construct $46{,}992$ new families of Fano $4$-fold hypersurfaces $X_d\subset\mathbb(a_1,\ldots,a_6)$ of Fano index $1$ with $d>200$, whose general members have terminal singularities. Unlike the $11{,}617$ quasismooth families classified by Brown and Kasprzyk, these are nonquasismooth, for which determining terminality can require the analysis of hyperquotient singularities. An exhaustive search has classified all nonquasismooth families with $d\leq200$, but extending this classification to higher degrees becomes computationally prohibitive. We therefore exploit the sparsity and spatial clustering of terminal examples using two best-first searches over $\mathbb{Z}^6$: one with a fixed heuristic, and the other with a neural network trained online by deep reinforcement learning. Together, the searches reach degrees up to $3{,}234$. The neural network additionally discovers an average of $79$ hard-to-reach families per run. For the most isolated examples, our conservative distance-based model gives an estimated lower bound of nearly $40\%$ of the fixed search's total step budget to discover a single such family. An ablation study demonstrates that this advantage arises from the neural network rather than stochastic exploration alone. The complete list of families is publicly available.

math.AG · cs.LG