1
This is a mostly self-contained research-oriented course designed for undergraduate students (but also extremely welcoming to graduate students) with an interest in doing research in theoretical aspects of algorithms that aim to extract information from data.
FREE
This course includes
Hours of videos
333 years, 3 months
Units & Quizzes
12
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
These often lie in overlaps of two or more of the following: Mathematics, Applied Mathematics, Computer Science, Electrical Engineering, Statistics, and / or Operations Research
Course Currilcum
- Overview and Two Open Problems Unlimited
- Principal Component Analysis in High Dimensions and the Spike Model Unlimited
- Graphs, Diffusion Maps, and Semi-supervised Learning Unlimited
- Spectral Clustering and Cheeger’s Inequality Unlimited
- Concentration Inequalities, Scalar and Matrix Versions Unlimited
- Johnson-Lindenstrauss Lemma and Gordon’s Theorem Unlimited
- Local Convergence of Graphs and Enumeration of Spanning Trees Unlimited
- Compressed Sensing and Sparse Recovery Unlimited
- Group Testing and Error-Correcting Codes Unlimited
- Approximation Algorithms and Max-Cut Unlimited
- Community Detection and the Stochastic Block Model Unlimited
- Synchronization Problems and Alignment Unlimited
