University of Cambridge > > Machine Learning Journal Club > Uniform sampling from various sets

Uniform sampling from various sets

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Carl Scheffler.

This week’s journal club has a computer science flavour. Try to solve the following tasks giving a loose bound on the space and time complexity of your solutions.

Sample uniformly from the following sets:
  1. Subsets of size k (from a larger set of n items)
  2. The set of all permutations with n items
  3. The set of all binary trees with n nodes
  4. The set of all partitions with n items

I will be cheating and presenting some interesting solutions from Chapters 12 and 13 of the book Non-Uniform Random Variate Generation

This talk is part of the Machine Learning Journal Club series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity