跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

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

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

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

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

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

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

Axiomatic Positivstellensaetze for Function Algebras over Ordered Fields

Nayoon Kim, Allen Gehret, Shenyuan Ma, Jakub Marecek

原文摘要

Positivstellensaetze furnish algebraic certificates of positivity, and hence of lower bounds and of global optimality, but the classical ones concern polynomials, whereas many problems of current interest, among them the training of neural networks, involve functions that are neither polynomial nor smooth. We isolate an axiomatic core of the constructive Positivstellensaetze of Fischer. The setting consists of an ordered field expanded by five auxiliary function symbols, subject to a few first-order axioms, together with an algebra of functions on an arbitrary set, subject to closure axioms. In this setting we prove a strict and a weak Positivstellensatz in which the witnesses are obtained by substituting the data into fixed terms that depend only on the number of constraints. The framework recovers Fischer's theorems for definable $C^r$-functions, and yields new instances: algebras of definable functions with arbitrary auxiliary functions, such as the binary step function; algebras of continuous functions, for which we give simple sufficient criteria and auxiliary functions derived from common activation functions; and algebras of continuous functions with values in an ordered field that is not closed under square roots, such as $\mathbb{Q}$. We derive certificates of lower bounds and of global optimality, and show that their expanded term length is cubic in the number of constraints for the strict certificate and quadratic for the weak one.

cs.AI