Data Science Briefing #296

Issue #296

November 21, 2025


Book of the Week

Sinan Ozdemir’s "Quick Start Guide to Large Language Models" lives up to its name. It moves quickly from core concepts, tokens, context windows, and prompt structure to working patterns like chat apps, RAG, summarization, and lightweight agents. The sequencing is pragmatic: read a chapter, ship a prototype.

The standout value for DS/ML folks is its treatment of embeddings and retrieval. Ozdemir shows when embeddings beat fine-tuning, how to chunk and index, and how to trade off accuracy, latency, and cost with clear, reusable checklists. His sections on prompt patterns, tool use/function-calling, and interface design treat prompting like API design, constrain inputs, structure outputs, plan for failure modes, making it easy to slot into existing services.

In short: an excellent on-ramp and onboarding text. Pair it with heavier resources for evaluation, alignment, and production-grade deployments.

Quick Start Guide to Large Language Models

Quick Start Guide to Large Language Models


Links of the Week
  1. 1. Building a Resilient Data Platform with Write-Ahead Log at Netflix [netflixtechblog.com]
  2. 2. You Should Write An Agent [fly.io]
  3. 3. Common Crawl Is Doing the AI Industry’s Dirty Work [theatlantic.com]
  4. 4. Yes you should understand backprop [karpathy.medium.com]
  5. 5. What Happened to Piracy? Copyright Enforcement Fades as AI Giants Rise [leefang.com]
  6. 6. Inside the Data Centers That Train A.I. and Drain the Electrical Grid [newyorker.com]
  7. 7. In a First, AI Models Analyze Language As Well As a Human Expert [quantamagazine.org]

Papers of the Week
Video of the Week

But what is a Laplace Transform?

But what is a Laplace Transform?

All our videos are also available in our YouTube playlist.


Enjoy the newsletter?

Forward it to a friend, or subscribe to get it straight to your inbox.

Subscribe Free
← Back to Newsletter

Subscribe to get our latest content by email.
    We won't send you spam. Unsubscribe at any time.