PulseAugur
中
实时 08:15:47
English(EN) Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach

新的零阶方法解决非光滑最小-最大优化问题

研究人员开发了一种新颖的零阶方法,用于解决涉及非光滑次模-凹函数的复杂最小-最大问题。该方法利用 Lovász 扩展的次梯度来最小化器,并利用高斯平滑来估计最大化器的函数梯度。该算法在离线设置中证明了收敛到 ε-鞍点,并在在线设置中实现了 O(sqrt(N*P_N)) 的在线对偶差距,理论结果得到了数值示例的支持。 AI

排序理由 这是一篇研究论文,详细介绍了一种针对特定类别优化问题的新算法方法。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

新的零阶方法解决非光滑最小-最大优化问题

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
这是一篇研究论文,详细介绍了一种针对特定类别优化问题的新算法方法。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
Standard
On-topic for AI-industry coverage; kept in the public index.
Story freshness
173 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv cs.LG TIER_1 English(EN) · Amir Ali Farzin, Yuen-Man Pun, Philipp Braun, Tyler Summers, Iman Shames ·

    求解非光滑次模-凹函数在线与离线Min-Max问题:一种零阶方法

    arXiv:2601.21243v2 Announce Type: replace-cross Abstract: We consider max-min and min-max problems with objective functions that are possibly non-smooth, submodular with respect to the minimiser and concave with respect to the maximiser. We investigate the performance of a zeroth…