Faster Polytope Rounding, Sampling, and Volume Computation via a Sublinear Ball Walk

Faster Polytope Rounding, Sampling, and Volume Computation via a Sublinear Ball Walk

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Results

4 of 14

4 of 14

Results

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Faster Polytope Rounding, Sampling, and Volume Computation via a Sublinear Ball Walk

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

  1. 1 Intro
  2. 2 Current bottleneck
  3. 3 Markov chains
  4. 4 Results
  5. 5 Algorithm overview
  6. 6 Sublinear implementation
  7. 7 Why does it work
  8. 8 High probability
  9. 9 Faster implementation
  10. 10 Running time
  11. 11 Expected cost
  12. 12 Bound expected waiting time
  13. 13 Anti concentration lemma
  14. 14 Future directions

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.