stat.MLNov 17, 2026

Bandit Online Submodular Minimisation Using Zeroth-Order Oracles

Authors: Amir Ali Farzin, Philipp Braun, Iman Shames

Organizations: School of Engineering, Australian National University · Department of Electrical and Electronic Engineering, University of Melbourne

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 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.

Figures & tables

Explore similar work

CardsList
  1. Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets

    Feb 24, 2026Yiyang Lu, Haresh Jadav, Mohammad Pedramfar +2Submodular OptimizationDynamic Regret Minimization