Randomized Composable Core-Sets for Submodular Maximization

Randomized Composable Core-Sets for Submodular Maximization

Hausdorff Center for Mathematics via YouTube Direct link

Intro

1 of 14

1 of 14

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Randomized Composable Core-Sets for Submodular Maximization

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

  1. 1 Intro
  2. 2 Outline
  3. 3 Processing Big Data
  4. 4 General Framework
  5. 5 Submodular Functions: example
  6. 6 Formal Definition of Composable Core-sets
  7. 7 Randomization Comes to Rescue
  8. 8 Importance of Robust Analysis
  9. 9 Family of B-nice Algorithms
  10. 10 Algorithm Greedy
  11. 11 Warm up: single machine greedy
  12. 12 Analysis of B-nice Algorithms
  13. 13 Upper Bounding A Differences
  14. 14 Remarks and Future work

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.