Timezone: »

 
Oral
Fully Dynamic Algorithm for Constrained Submodular Optimization
Silvio Lattanzi · Slobodan Mitrović · Ashkan Norouzi-Fard · Jakub Tarnawski · Morteza Zadimoghaddam

Thu Dec 10 06:30 PM -- 06:45 PM (PST) @ Orals & Spotlights: Optimization
in Orals & Spotlights Track 32: Optimization »
The task of maximizing a monotone submodular function under a cardinality constraint is at the core of many machine learning and data mining applications, including data summarization, sparse regression and coverage problems. We study this classic problem in the fully dynamic setting, where elements can be both inserted and removed. Our main result is a randomized algorithm that maintains an efficient data structure with a poly-logarithmic amortized update time and yields a $(1/2-epsilon)$-approximate solution. We complement our theoretical analysis with an empirical study of the performance of our algorithm.
Keywords: Learning Theory · Frequentist Statistics · Theory · Theory; Theory

Author Information

Silvio Lattanzi (Google Research)
Slobodan Mitrović (MIT)
Ashkan Norouzi-Fard (Google Research)
Jakub Tarnawski (Microsoft Research)
Morteza Zadimoghaddam (Google Research)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors