Coresets for Robust Submodular Maximization with Deletions

Coresets for Robust Submodular Maximization with Deletions

Finnish Center for Artificial Intelligence FCAI via YouTube Direct link

Running time

13 of 13

13 of 13

Running time

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Coresets for Robust Submodular Maximization with Deletions

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Example
  3. 3 Optimization problem
  4. 4 Submodularity
  5. 5 Constraints
  6. 6 Adversary
  7. 7 Computational complexity
  8. 8 Algorithms
  9. 9 RExc, robust streaming algorithm
  10. 10 Guarantees
  11. 11 Offline algorithm
  12. 12 Experiments
  13. 13 Running time

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.