RSS Amplifier

Topic · fall lecture

fall lecture

The 50 most recent episodes and tracks on this topic.

Saves to your Watch queue, to pick up on another day or another device.

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

  1. Numerical Algorithms for Computing & ML, fall 2025 (lecture 26): Leapfrog integration,adjoint methodJustin SolomonNotes
  2. Numerical Algorithms for Computing & ML, fall 2025 (lecture 25): Exponential/RK/Newmark integrationJustin SolomonNotes
  3. Numerical Algorithms for Computing & ML, fall 2025 (lecture 24): Ordinary differential equationsJustin SolomonNotes
  4. Numerical Algorithms for Computing & ML, fall 2025 (lecture 23): Numerical integrals and derivativesJustin SolomonNotes
  5. Numerical Algorithms for Computing & ML, fall 2025 (lecture 22): 1D Quadrature/Numerical IntegrationJustin SolomonNotes
  6. Numerical Algorithms for Computing & ML, fall 2025 (lecture 21): InterpolationJustin SolomonNotes
  7. Numerical Algorithms for Computing & ML, fall 2025 (lecture 20): Alternating optimization and ADMMJustin SolomonNotes
  8. Numerical Algorithms for Computing & ML, fall 2025 (lecture 19): Gauss-Newton, Levenberg-MarquardtJustin SolomonNotes
  9. Numerical Algorithms for Computing & ML, fall 2025 (lecture 18): Conjugate gradient algorithmJustin SolomonNotes
  10. Numerical Algorithms for Computing & ML, fall 2025 (lecture 17): Active set, barrier, intro to CGJustin SolomonNotes
  11. Numerical Algorithms for Computing & ML, fall 2025 (lecture 16): Constrained optim., KKT conditionsJustin SolomonNotes
  12. Numerical Algorithms for Computing & ML, fall 2025 (lecture 15): BFGS and Quasi-Newton MethodsJustin SolomonNotes
  13. Numerical Algorithms for Computing & ML, fall 2025 (lecture 14): Convergence of gradient descentJustin SolomonNotes
  14. Numerical Algorithms for Computing & ML, fall 2025 (lecture 13): Golden sec search, Wolfe conditionsJustin SolomonNotes
  15. Numerical Algorithms for Computing & ML, fall 2025 (lecture 12): Broyden's method, root findingJustin SolomonNotes
  16. MLSP Fall 2024 | Lecture11 - Independent Component AnalysisFall 2024Notes
  17. MLSP Fall 2024 | Lecture12 - ClusteringFall 2024Notes
  18. MLSP Fall 2024 | Lecture 9 - NMFFall 2024Notes
  19. MLSP Fall 2024 | Lecture 5 - Deterministic RepresentationsFall 2024Notes
  20. MLSP Fall 2024 | Lecture 6 - Data Driven RepresentationsFall 2024Notes
  21. MLSP Fall 2024 | Lecture 7 - Classification and MetaclassifierFall 2024Notes
  22. MLSP Fall 2024 | Lecture 8 - Face DetectionFall 2024Notes
  23. MLSP Fall 2024 | Lecture 4 - OptimizationFall 2024Notes
  24. MLSP Fall 2024 | Lecture 2 - Linear Algebra-IFall 2024Notes
  25. MLSP Fall 2024 | Lecture 1 - IntroductionFall 2024Notes
  26. MLSP Fall 2023 | Lecture 3 - Linear Algebra 2Fall 2024Notes
  27. Lovász Local lemma (Randomized algorithms, Fall 2022, Lecture 15)Randomized Algorithms, Fall 2022Notes
  28. PAC learning (Randomized algorithms, Fall 2022, Lecture 13)Randomized Algorithms, Fall 2022Notes
  29. Entropy and codes (Randomized algorithms, Fall 2022, Lecture 14)Randomized Algorithms, Fall 2022Notes
  30. Geometric sampling (Randomized algorithms, Fall 2022, Lecture 12)Randomized Algorithms, Fall 2022Notes
  31. Randomized tree metrics (Randomized algorithms, Fall 2022, Lecture 11)Randomized Algorithms, Fall 2022Notes
  32. Sparsest cut (Randomized algorithms, Fall 2022, Lecture 10)Randomized Algorithms, Fall 2022Notes
  33. Locality-sensitive hashing (Randomized algorithms, Fall 2022, Lecture 9)Randomized Algorithms, Fall 2022Notes
  34. Dimensionality reduction (Randomized algorithms, Fall 2022, Lecture 8)Randomized Algorithms, Fall 2022Notes
  35. Distinct elements (Randomized algorithms, Fall 2022, Lecture 7)Randomized Algorithms, Fall 2022Notes
  36. Randomized rounding (Randomized algorithms, Fall 2022, Lecture 6)Randomized Algorithms, Fall 2022Notes
  37. Random sums and graphs (Randomized algorithms, Fall 2022, Lecture 5)Randomized Algorithms, Fall 2022Notes
  38. Randomized minimum cut (Randomized algorithms, Fall 2022, Lecture 4)Randomized Algorithms, Fall 2022Notes
  39. Hash tables and linear probing (Randomized algorithms, Fall 2022, Lecture 3)Randomized Algorithms, Fall 2022Notes
  40. Hashing and heavy hitters (Randomized algorithms, Fall 2022, Lecture 2)Randomized Algorithms, Fall 2022Notes
  41. Randomized searching and sorting (Randomized algorithms, Fall 2022, Lecture 1)Randomized Algorithms, Fall 2022Notes
  42. CS 106L Fall 2019 - Lecture 3: Sequence Containers (Screencast)Stanford CS 106L Fall 2019 LecturesNotes
  43. CS 106L Fall 2019 - Lecture 3: Sequence Containers (Screencast)Stanford CS 106L Fall 2019 LecturesNotes
  44. CS 106L Fall 2019 - Lecture 4: Associative Containers (Screencast)Stanford CS 106L Fall 2019 LecturesNotes
  45. CS 106L Fall 2019 - Lecture 9: STL Summary (Screencast)Stanford CS 106L Fall 2019 LecturesNotes
  46. CS 106L Winter 2020 - Lecture 8: Functions and AlgorithmsStanford CS 106L Fall 2019 LecturesNotes
  47. CS 106L Fall 2019 - Lecture 6: Templates (Video)Stanford CS 106L Fall 2019 LecturesNotes
  48. CS 106L Fall 2019 - Lecture 5: Advanced Containers (Screencast)Stanford CS 106L Fall 2019 LecturesNotes
  49. CS 106L Fall 2019 - Lecture 2: Streams II (Screencast)Stanford CS 106L Fall 2019 LecturesNotes
  50. CS 106L Fall 2019 - Lecture 2: Streams II (Video)Stanford CS 106L Fall 2019 LecturesNotes