CS771: Discussion Hour Content

The following table contains links to discussion hour slides and code.

Week No.	Videos	Slides	Code	Remarks
1.	Getting Started (lec01) [VID] ML Primitives (lec02) [VID] Building Blocks (lec03) [VID]	[PPTX]
2.	Geometry Crash Course (tut01) [VID] Calculus Crash Course (tut01) [VID] How Machine Learning Prevented Countless Cybersecurity Attacks (cst01) [VID]	[PPTX]
3.	Is my Machine Learning model confused? (shr01) [VID] The Most Confident Classifier (lec04) [VID] Calculus of the non-Differentiables (tut03) [VID]	[PPTX]	[IPYNB] [TXT]	The Python notebook shows how to break the XOR-PUF using an SVM. The TXT file contains data for the XOR-PUF problem.
4.		[PPTX]
5.	The Algorithms that make Machine Learning possible (tut04) [VID] One does not simply descend into optimality (tut05) [VID] The dazzling domain of duals (tut06) [VID]	[PPTX]
6.	How do Machine Learning libraries like scikit-learn work? (cst02) [VID] Why do they call it an SVM? (shr02) [VID]	[NOTE1] [NOTE2] [PPTX]	[IPYNB] [ZIP]	The note files are PPTX presentations containing refreshers of probability and statistics basics. The ZIP file contains code to implement the ID3 algorithm to play the hangman game.
7.		[PPTX]
8.		[PPTX]
9.		[PPTX]
10.		[PPTX]
11.		[PPTX]
12.		[PPTX]
13.		[PPTX]
14.		[PPTX]
15.		[PPTX]