Skip to main content

🏢 Indian Institute of Technology Bombay

Learning-Augmented Dynamic Submodular Maximization
·387 words·2 mins· loading · loading
AI Theory Optimization 🏢 Indian Institute of Technology Bombay
Leveraging predictions, this paper presents a novel algorithm for dynamic submodular maximization achieving significantly faster update times (O(poly(log n, log w, log k)) amortized) compared to exist…