跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22130 · v1

Bandit Online Submodular Minimisation Using Zeroth-Order Oracles

首次提交 2026-11-17 11:12
版本更新 2026-11-17 11:12
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

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 bandit methods only guarantee static regret, which compares against a single fixed subset and is a weak benchmark when the minimiser moves. This paper provides, to the best of our knowledge, the first method with guarantees for tracking a moving minimiser in this setting. We propose a zeroth-order method built on a two-point oracle for the Lovász extension whose two evaluations are both subsets that can be played. The perturbed and base points are rounded by a common random threshold, and drawing the smoothing direction from the unit sphere makes the base evaluation a zero-mean control variate, so the oracle is an unbiased estimator of the smoothed gradient. We establish dynamic regret bounds of order O((1+PN∗)N3/4)O\big((1+\sqrt{P^\ast_N})N^{3/4}\big) in general and O((1+PN∗)N2/3)O\big((1+\sqrt{P^\ast_N})N^{2/3}\big) under a sufficiently small drift, where PN∗P^\ast_N is the path length of the minimiser sequence, together with the corresponding O(N3/4)O(N^{3/4}) and O(N2/3)O(N^{2/3}) static regret bounds. Numerically, the method attains lower regret than the algorithm of (Hazan and Kale (2012)), with the advantage growing with the path length.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 11:12 · 最新观测版本

Bandit Online Submodular Minimisation Using Zeroth-Order Oracles

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 bandit methods only guarantee static regret, which compares against a single fixed subset and is a weak benchmark when the minimiser moves. This paper provides, to the best of our knowledge, the first method with guarantees for tracking a moving minimiser in this setting. We propose a zeroth-order method built on a two-point oracle for the Lovász extension whose two evaluations are both subsets that can be played. The perturbed and base points are rounded by a common random threshold, and drawing the smoothing direction from the unit sphere makes the base evaluation a zero-mean control variate, so the oracle is an unbiased estimator of the smoothed gradient. We establish dynamic regret bounds of order O((1+PN∗)N3/4)O\big((1+\sqrt{P^\ast_N})N^{3/4}\big) in general and O((1+PN∗)N2/3)O\big((1+\sqrt{P^\ast_N})N^{2/3}\big) under a sufficiently small drift, where PN∗P^\ast_N is the path length of the minimiser sequence, together with the corresponding O(N3/4)O(N^{3/4}) and O(N2/3)O(N^{2/3}) static regret bounds. Numerically, the method attains lower regret than the algorithm of (Hazan and Kale (2012)), with the advantage growing with the path length.

查看此版本解读 →查看此版本原文 ↗