Robust Optimization for Submodular Minimization under Uncertainty
The core message of this paper is to provide a complete computational complexity map of the Robust Submodular Minimizer problem, which aims to find a set that is close to some optimal solution for each of the k given submodular functions, under a given recovery bound d.
Efficient Algorithms for Noisy Submodular Maximization with Approximation Guarantees
Efficient algorithms are proposed for maximizing submodular objectives under noisy access to the objective function, achieving approximation guarantees close to the best possible in the standard value oracle setting.
Efficient Multi-Task Subset Selection with Distributional Robustness
The core message of this work is to introduce a novel formulation for multi-task submodular optimization that achieves local distributional robustness within the neighborhood of a reference distribution, which assigns importance scores to each task.
© 2024 by Linnk AI