[Home] [Lectures] [Assignments] [Project]

- Use this template when scribing.
- Each student may have to scribe 1-2 lectures, depending on class size.
- Pick a date below when you are available to scribe and send your
choice to
. First-come first-served.`cs229r-f13-staff@seas.harvard.edu` - Submit scribe notes (pdf + source) to
.`cs229r-f13-staff@seas.harvard.edu` - Please give real bibliographical citations for the papers that we mention in class (DBLP can help you collect bibliographic info).
- Scribe notes are due
**by 9pm on the day after lecture**. They are posted immediately without proofreading (though we may proofread later and ask for some changes to be made.) - More scribe notes for each lecture here, courtesy of Sam Elder.

- Tuesday, Sept. 3 — logistics, course topics, basic tail bounds (Markov, Chebyshev, Chernoff), Morris' algorithm.

Scribes: Andrew Liu, Andrew Wang. [PDF][TeX] - Thursday, Sept. 5 — distinct elements, k-wise independence, necessity of randomized/approximate guarantees, AMS sketch in notes.

Scribe: William Chen, Sebastian Chiu. [PDF][TeX] - Tuesday, Sept. 10 — linear sketching, p-stable sketch 0<p<2, Nisan's PRG, high ℓ
_{p}norms (p>2) via max-stability.

Scribe: Christopher Musco. [PDF][TeX] - Thursday, Sept. 12 — analysis of ℓ
_{p}estimation algorithm via max-stability, deterministic point query via incoherent matrices.

Scribe: Brenton Partridge. [PDF][TeX][LyX] - Tuesday, Sept. 17 — CountMin sketch, CountSketch, point query, heavy hitters, sparse approximation.

Scribe: Cameron Musco. [PDF][TeX] - Thursday, Sept. 19 — graph sketching, connectivity, k-connectivity.

Scribe: Martin Camacho. [PDF][TeX] - Tuesday, Sept. 24 — amnesic dynamic programming (approximate distance to monotonicity).

Scribe: David Liu. [PDF][TeX] - Thursday, Sept. 26 — communication complexity (indexing, gap hamming, disjointness) + applications to median and F
_{p}space lower bounds.

Scribe: Anudhyan Boral. [PDF][TeX] - Tuesday, Oct. 1 — L
_{p}/Minkowski's inequality, Lipschitz concentration, decoupling, Hanson-Wright inequality, Johnson-Lindenstrauss (JL) lemma.

Scribe: Colin Lu. [PDF][TeX][LyX] - Thursday, Oct. 3 — proofs of Lipschitz concentration and decoupling, Alon's JL lower bound, Gordon/Klartag-Mendelson refined JL bounds.

Scribe: Yong Wook Kwon. [PDF][TeX] - Tuesday, Oct. 8 — sparse Johnson-Lindenstrauss transform.

Scribe: Arthur Safira. [PDF][TeX] - Thursday, Oct. 10 — fast Johnson-Lindenstrauss transform, conjecture concerning doubling dimension.

Scribe: Thomas Morgan. [PDF][TeX] - Tuesday, Oct. 15 — approximate matrix multiplication via sampling and via JL moment property, matrix median trick, subspace embeddings.

Scribe: Samuel Elder. [PDF][TeX] - Thursday, Oct. 17 — subspace embeddings from approximate matrix mult./Thorup-Zhang and FJLT, iterative and non-iterative regression methods.

Scribe: Aleksandar Makelov. [PDF][TeX] - Tuesday, Oct. 22 — low-rank approx. via subspace embeddings, column-based matrix reconstruction, subspace embeddings via moment method.

Scribe: Chiheon Kim. [PDF][TeX] - Thursday, Oct. 24 — compressed sensing, restricted isometry property (RIP), basis pursuit, ℓ
_{2}/ℓ_{1}recovery guarantee.

Scribe: Mark Bun. [PDF][TeX] - Tuesday, Oct. 29 — Krahmer-Ward theorem (JL from RIP matrices).

Scribe: Ludwig Schmidt. [PDF][TeX] - Thursday, Oct. 31 — Iterative Hard Thresholding, RIP
_{1}from expanders, restricted nullspace property, ℓ_{1}/ℓ_{1}recovery.

Scribe: Cyril Stark. [PDF][TeX] - Tuesday, Nov. 5 — Sparse Matching Pursuit, matrix completion.

Scribe: Kristan Temme. [PDF][TeX] - Thursday, Nov. 7 — matrix completion via trace norm minimization.

Scribe: Yun William Yu. [PDF][TeX] - Tuesday, Nov. 12 — external memory model: linked list, matrix multiplication, B-tree, buffered repository tree, sorting.

Scribe: Perry Green. [PDF][TeX] - Thursday, Nov. 14 — competitive paging, cache-oblivious algorithms: matrix multiplication, self-organizing linked list, static B-tree, lazy funnelsort.

Scribe: Arpon Raksit. [PDF][TeX] - Tuesday, Nov. 19 — cache-oblivious lookahead array, dynamic cache-oblivious B-trees from exponential trees, MapReduce.

Scribe: Thomas Steinke. [PDF][TeX][FIG] - Thursday, Nov. 21 — MapReduce: minimum spanning tree, triangle counting, MR-parallelizability (frequency moments example).

Scribe: Malcolm Granville. [PDF][TeX] - Tuesday, Nov. 26 — MapReduce: "Solve-And-Sketch" geometric MST, brief mentions of sorting and k-means||.

Scribe: Thomas Steinke. [PDF][TeX] - Thursday, Nov. 28.
**NO CLASS (Happy Thanksgiving!).** - Tuesday, Dec. 3 —
**project presentations**.

Project teams: Martin Camacho and Andrew Liu, Sam Elder, Perry Green, Chiheon Kim,

Cameron Musco and Christopher Musco, Yun William Yu. - Thursday, Dec. 5 —
**project presentations**.

Project teams: Anudhyan Boral, Mark Bun and Thomas Morgan, Malcolm Granville,

Yong Wook Kwon and Colin Lu, David Liu and Andrew Wang, Aleksander Makelov and Arpon Raksit, Arthur Safira.