
EP 60 | MIT 6.036: Logistic Regression & ML as Optimization
Welcome to Week 4 of MIT 6.036! This week we transition from heuristic rules to the formal framework of Machine Learning as Optimization. We explore why traditional step-function loss fails calculus, introduce smooth Sigmoid probabilities, and derive the Negative Log-Likelihood loss function.
Key Topics:
Framing ML as Loss Minimization plus $L_2$ Regularization.
Why $0\text{--}1$ Loss fails (zero gradients & NP-hardness).
The Linear Logistic Classifier and the Sigmoid function ($\sigma(z)$).
Deriving Negative Log-Likelihood (NLL) and cross-entropy loss.
Disclaimer: Note: This is an AI-generated discussion created using Google's NotebookLM, Gemini, and other AI tools, based on the freely and publicly available MIT 6.036 - Introduction to Machine Learning course material and personal study notes.
Altri episodi di "AI Bites: The Academic Series"



Non perdere nemmeno un episodio di “AI Bites: The Academic Series”. Iscriviti all'app gratuita GetPodcast.








