Description

This is the page for a course at Princeton taught by Profs. Matt Weinberg and Huacheng Yu that I took during Fall 2022. Below is the course description and some resources about the topic.

“Broadly covers algorithmic design ideas of the past few decades, preparing students to understand current research papers in algorithms. Although designed for computer science grads, it may be suitable for advanced undergrads and non-CS grads as well. The course is thematically distinct from undergrad algorithms (such as COS 423) in its extensive use of ideas such as randomness, optimization, approximation, and high dimensional geometry, which are increasingly important in applications. The course also exposes students to modern algorithmic concerns, including dealing with uncertainty and strategic (i.e., game-theoretic) behaviors.”

This was my first serious brush with concentration inequalities, if that tells you anything :)

Reading List

• The course website, complete with lectures and such.

Notes & Problem Sets

• My notes from lecture.
• My problem sets! I don’t think any are really awfully wrong, but some are incorrect for sure. Email me if there’s anything to discuss:
  • PSet 1
  • PSet 2
  • PSet 3
  • PSet 4
• The final project of my friend Jiatong Yu and myself.