Understanding Algorithms For Big Data Compsci 229r Lecture 7
Exploring Algorithms For Big Data Compsci 229r Lecture 7 reveals several interesting facts. CountSketch, ℓ0 sampling, graph sketching.
Key Takeaways about Algorithms For Big Data Compsci 229r Lecture 7
- Khintchine, decoupling, Hanson-Wright, proof of distributional JL lemma.
- Communication complexity (indexing, gap hamming) + application to median and F0 lower bounds.
- Amnesic dynamic programming (approximate distance to monotonicity).
- CountMin sketch, point query,
- Analysis of ℓp estimation
Detailed Analysis of Algorithms For Big Data Compsci 229r Lecture 7
Competitive paging, cache-oblivious Logistics, course topics, basic tail bounds (Markov, Chebyshev, Chernoff, Bernstein), Morris' Oblivious subspace embeddings, faster iterative regression, sketch-and-solve regression.
Necessity of randomized/approximate guarantees, linear sketching, AMS sketch, p-stable sketch for p less than 2.
Stay tuned for more updates related to Algorithms For Big Data Compsci 229r Lecture 7.