PulseAugur
中
实时 07:57:15

新的 bandit 方法在在线子模量最小化中跟踪移动的最小化器

研究人员开发了一种使用 bandit 反馈的在线子模量最小化新方法,该方法旨在随时间跟踪移动的最小化器。这种新方法利用了基于 Lovász 扩展的零阶预言机,并对扰动点和基点进行了评估。该方法在一般情况下建立了 O((1+sqrt(P*_N))N^3/4) 阶的动态遗憾界,在特定漂移条件下建立了 O((1+sqrt(P*_N))N^2/3) 阶的动态遗憾界,在数值上优于现有算法。 AI

影响 引入了一种新的在线子模量最小化方法,具有改进的动态遗憾界,有可能在动态环境中推进优化技术。

排序理由 该集群包含一篇提交到 arXiv 的研究论文,详细介绍了一种新的算法方法。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.LG 阅读 →

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

新的 bandit 方法在在线子模量最小化中跟踪移动的最小化器

本文如何被排名

Signal score
26 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
该集群包含一篇提交到 arXiv 的研究论文,详细介绍了一种新的算法方法。[lever_c_demoted from research: ic=1 ai=1.0]
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
High
Clearly on-topic for AI-industry coverage.
Story freshness
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

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

报道来源 [1]

  1. arXiv cs.LG TIER_1 English(EN) · Amir Ali Farzin, Philipp Braun, Iman Shames ·

    使用零阶预言机的Bandit在线子模最小化

    arXiv:2611.22130v1 Announce Type: cross Abstract: We consider online submodular minimisation under bandit feedback, where at each round a decision maker plays a subset and observes only its cost, while the cost functions, and hence their minimiser, change over time. Existing band…