跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+918新增论文
+729其中 AI 相关
+73已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 12:06各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 12:06库内论文最新更新时间:2026-11-16 04:06

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

24,672 已收录论文20,615 AI 相关7,189 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · v3arXiv:2604.18540

Duality for the Adversarial Total Variation

Leon Bungert, Lucas Schmitt

原文摘要

Adversarial training of binary classifiers can be reformulated as regularized risk minimization involving a nonlocal total variation. Building on this perspective, we establish a characterization of the subdifferential of this total variation using duality techniques. To achieve this, we derive a dual representation of the nonlocal total variation and a related integration-by-parts formula, involving a nonlocal gradient and divergence. We provide such duality statements both in the space of continuous functions vanishing at infinity on proper metric spaces and for the space of essentially bounded functions on separable metric spaces. Furthermore, under some additional conditions we provide characterizations of the subdifferential in these settings.

math.AP · cs.LG · math.FA · math.OC

新论文 · v1arXiv:2611.09887

关于 ReLU 网络集合的(非)闭性

On the (non-)closedness of the set of ReLU networks

Eloi Martinet, Leon Bungert

AI 速读 基于摘要

作者证明单隐层 ReLU 网络集合在 Sobolev 空间中是弱闭的,而宽度有界的双隐层 ReLU 网络集合在 Sobolev 空间与连续函数空间中均不闭。

cs.LG · math.CA · math.FA · math.NA · math.OC

查看原文摘要

We prove that the set $\mathcal{N}_N$ of ReLU networks with one hidden layer and at most $N\in\mathbb N$ neurons is weakly closed in $W^{1,p}(Ω)$, for a bounded connected open set $Ω\subset\mathbb R^d$. Consequently, every coercive, weakly lower semicontinuous energy on this space attains its minimum over $\mathcal{N}_N$. This covers the Deep Ritz method with convex integrands, Sobolev training and Lipschitz learning. Moreover, as the weight decay parameter tends to zero, minimizers of the regularized problem converge, up to subsequences, to minimizers with minimal parameter norm. We also prove that the set of ReLU networks with two hidden layers of bounded widths is not closed in $W^{1,p}(Ω)$ or in $C(\overlineΩ)$. This disproves a conjecture of Petersen, Raslan and Voigtlaender.