跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 01:33 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-15 01:33最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

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

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 01:32(北京时间)
新论文 · v1arXiv:2611.15783

A Linear-Time Construction on $\mathbb{S}^2$ Achieving a Sublinear Energy Gap on Smale's Seventh Problem

Rishabh Kabra, Wim Dehaen, Andrea Karlova, Mark Hamilton, Joao Carreira, Maks Ovsjanikov, Jonathan T. Barron

原文摘要

Smale's seventh problem asks for a polynomial-time algorithm that places $N$ points on the unit sphere $\mathbb{S}^2$ with logarithmic energy (the sum of $-\log$ of all pairwise distances) within $O(\log N)$ of the minimum. The minimal energy has an asymptotic expansion with explicit terms of order $N^2$ and $N\log N$ and a linear term whose constant is unknown. Brauchart, Hardin, and Saff conjectured this constant; the resulting expansion, $E_{BHS}(N)$, is known to be an upper bound on the minimum, up to $o(N)$. All previously analyzed constructions on $\mathbb{S}^2$ have energy exceeding $E_{BHS}(N)$ by an amount that grows at least linearly in $N$, i.e. $Ω(N)$, far from the $O(\log N)$ accuracy sought by Smale. We present TerracedZonal, a deterministic construction that generates $N$ points in $Θ(N)$ time and memory. Points are placed on latitude rings whose populations are held constant across bands ("terraces") chosen by a one-dimensional dynamic program, so that adjacent rings within each terrace lock into a staggered triangular lattice. Under a locality assumption, we prove that the energy exceeds $E_{BHS}(N)$ by only $Θ(N^{2/3})$, with an explicit constant; exact evaluation up to $N = 10^9$ confirms this rate. Under the same assumption, its distance from the true minimum is sublinear if the conjecture holds. To our knowledge, this is the first algorithmic construction with a sublinear excess over $E_{BHS}(N)$ of explicit order (proven under the locality assumption), a necessary step toward Smale's seventh problem. With one parameter changed, the same algorithm also gives an equal-weight integration rule on $\mathbb{S}^2$ that runs just as fast and whose error decays at an empirical rate of $N^{-4}$ on smooth functions, versus $N^{-3/2}$ for every previous fast construction we tested.

cs.CG · math.MG

版本更新 · v3arXiv:2610.31642

A Fix for Softmax and Cross-Entropy

Jonathan T. Barron, Dan Gnanapragasam, Michael Tschannen

原文摘要

Standard implementations of softmax, log-softmax, and cross-entropy have two numerical bugs. The first bug, Softmax Collapse, rounds the target logit's gradient to zero if that one logit is much larger than the others, resulting in gradients that no longer sum to zero. The second bug, Softmax Cancellation, occurs when student logits are close to teacher logits, and produces non-zero gradients even when the student and teacher logits are equal. We present simple implementations of log-softmax, softmax, and cross-entropy that fix both bugs. Our fix eliminates the previously observed "slingshot" phenomenon, speeds up grokking with weight decay, prevents accuracy collapse without weight decay, stops student networks from drifting away from the teacher during distillation, and shows that after memorization, logit growth is bounded by an equilibrium between weight decay and Adam's $ε$ hyperparameter.

cs.LG