no code implementations • 19 Jun 2023 • Antoine Lesage-Landry, Julien Pallage
We propose the online submodular greedy algorithm (OSGA) which solves to optimality an approximation of the previous round loss function to avoid the NP-hardness of the original problem.
