CMPSCI 791 TP (Spring 2012)

Topics in Optimization

Mondays, 3:45-5:00pm
Room CS 140

Syllabus

  1. January 23rd, 2012: Introduction - Andrew McCallum
    • Paper(s): None
  2. January 31st, 2012: Convex Optimization - Brian Martin
  3. February 6th, 2012: Linear Programming/Duality/Conjugate Duality, Part 1 - Sebastian Riedel, David Belanger
  4. February 13th, 2012: Linear Programming/Duality/Conjugate Duality, Part 2 - Sebastian Riedel, David Belanger
  5. February 23th, 2012: Subgradient Algos, Stochastic Approx, Part 1 - Alexandre Passos, Sameer Singh
  6. February 27th, 2012: Subgradient Algos, Stochastic Approx, Part 2 - Alexandre Passos, Sameer Singh
  7. March 5th, 2012: Cutting-plane methods, Branch and Bound, Part 1 - Sebastian Riedel, Jiaping Zheng
  8. March 12th, 2012: Class cancelled
  9. March 19th, 2012: Spring Break
  10. March 26th, 2012: Class cancelled
  11. April 2nd, 2012: Cutting-plane methods, Branch and Bound, Part 2 - Sebastian Riedel, Jiaping Zheng
  12. April 9th, 2012: MCMC and Optimization - Michael Wick, Sameer Singh
  13. April 17th, 2012: Bayesian/Global Optimization - Anton Bakalov
  14. April 23rd, 2012: Sub-modularity - Alexandre Passos, Limin Yao
    1. Noisy-or gates, as a function of the input features (a noisy or gate is 1 with probability = 1 - prod_i (1 - p_i) , where p_i is a specific parameter for each source).
    2. mutual information MI(X;Y), as you choose which variables to add to X
    3. training-set likelihood of a logistic regression classifier as a function of which features you're using
    4. the k-means score as a function of which points you're using as means (the k-means score is the sum of the distances from points to the closest mean)
    5. the score of a pairwise binary clustering model as a function of which points go into the positive cluster
    1. April 30th, 2012: A* Search - David Belanger, Brian Martin
      • Paper(s): 
    Additional Topics: Dynamic Programming, Integer linear programming + relaxations