Search Mailing List Archives
[theory-seminar] [theory-lunch] " Algorithmic toolboxes" reading group
rad at cs.stanford.edu
Mon Mar 5 10:56:53 PST 2018
I probably have talked to a couple of you individually about this idea
before, but a mass email seems to be the right way of maximizing total
contributions. We (Nima and I) were wondering if anyone is interested in
attending (or contributing to) a semi-short reading group, starting from
this week (or maybe next week), on a diverse set of topics related to
various algorithmic toolboxes. To start, we have picked a couple of
particular topics listed below, but we are definitely open to suggestions:
1- Sampling and counting, MCMCs and determinantal measures
*e.g. see this set of lecture notes, which I believe is a good guide for
the topics we want to cover:
2- Online learning and it's applications in designing competitive online
*e.g. see these lectures by Sebastien Bubeck on their recent k-server
Time: Here is a Doodle poll to pick a time (please participate!):
Responsibilities: each week one of the attendees gives a two-hour
whiteboard talk. Priorities are given to junior PhD students.
Here is what you need to do:
1- Send me (rad at cs.stanford.edu) or Nima (anar at cs.stanford.edu) an email if
you are willing to attend, in which you mention the times that work for you.
2- Tell us if you don't like any of the above topics and if you want to add
any interesting topics to the list that you wanna learn.
3- We understand the quarter is closing to its end, but it would be great
if we still start at this point and we continue stronger next quarter!
4- Please feel free to forward this email to whoever you think is
Thanks for your attention,
Rad and Nima
Computer Science Department, Stanford University,
484 Gates, 353 Serra Mall, Stanford, CA 94035.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the theory-seminar