EP 47 | CS224N: Efficient Adaptation
from AI Bites: The Academic Series Hosted by Jack Lakkapragada
We know how to build and align massive foundational models, but what if you don't have a $100 million supercomputer? In this episode, we tackle the practical wall of modern AI: compute costs. We explore how researchers are circumventing astronomical expenses to adapt massive models efficiently, pushing the boundaries of what you can train on a single consumer GPU while making AI an environmental imperative. Key Topics: Fixing RLHF with DPO: Why the industry is abandoning complex reinforcement learning for Direct Preference Optimization, and the ethical reality of the "digital sweatshops" providing our preference data. The Power and Limits of Prompting: Unlocking Zero-Shot capabilities and Chain-of-Thought reasoning, while acknowledging the fragile, compute-heavy "dark art" of prompt engineering. The PEFT Revolution & LoRA: The brilliant math behind Low-Rank Adaptation that reduces trainable parameters by 99.9% with zero added inference latency. Adapters & Soft Prompts: How inserting tiny bottleneck networks enables modular, plug-and-play skills—like swapping between different language dialects on the fly without altering the base model. Note: This is an AI-generated discussion created using Google's NotebookLM, based on publicly available Stanford University course material (specifically CS224N) and personal study notes from my learning journey.
Embed this episode
No transcript yet.