
Beam Search vs Sampling: How LLMs Decode
Compare greedy, beam search, top-p sampling, and contrastive search for LLM decoding. Interactive playground shows each strategy picking tokens live.
Loading...
Teach machines to think, learn, and surprise you
56 posts
Showing 13-24 of 56 posts

Compare greedy, beam search, top-p sampling, and contrastive search for LLM decoding. Interactive playground shows each strategy picking tokens live.

GGUF, GPTQ, and AWQ are three ways to shrink LLM weights. Each format makes different tradeoffs between hardware flexibility, accuracy, and speed.

Learn how temperature and top-p control LLM output. Interactive playground lets you tune both and watch the probability distribution change.

Understand how transformers process text from token to prediction. An interactive guide with a live playground to trace the full forward pass.

What are embeddings? See how AI turns text into numbers. Interactive visualizer compares phrases and reveals why similar meanings become nearby vectors.

Why can't you just use a Python list for vector search? Interactive simulator shows how brute force dies at 100K vectors and why you need a vector DB.

HNSW finds nearest neighbors in milliseconds by navigating a multi-layer graph. Interactive navigator shows the search powering every vector database.

LLMs forget everything between API calls. Buffer, summary, and vector memory fix this. Interactive simulator shows what each strategy remembers.

See what Copilot, Cursor, and Claude Code feed their LLMs. Interactive agent simulator lets you build context for a coding task and compare strategies.

Learn how MCP tools turn Python type hints into JSON Schema. See how LLMs pick the right tool and build better definitions with FastMCP.

Deploy an AI agent as a REST API with FastAPI in Python. 11 steps: endpoints, streaming, chat memory, auth, Docker, and unit tests.

Build a ReAct (Reasoning + Acting) AI agent from scratch in pure Python. 10-step interactive tutorial with runnable code, output previews, and hands-on challenges.