409 items · Page 3 of 9
Create a free account to keep your reading organized, join thoughtful discussions, and get more from every chapter.
Free to join · Takes less than a minute
Why
I created this space so readers can learn together, ask questions, and make sense of difficult ideas.
Explains how CLIP enables zero-shot classification by connecting vision and language. Examines dual-encoder architecture, contrastive learning.
Explains how Vision Transformers work: from image patching and embeddings to self-attention. Topics include ViT architecture, inductive biases.
Covers LLM throughput optimization with continuous batching, batch size tuning, parallelism strategies, and measuring tokens-per-second under real workloads.
Covers LLM serving latency from TTFT to TPOT. Topics include KV cache management, continuous batching, speculative decoding, streaming responses.
Serve language models in production: weight loading strategies, tensor parallelism, request batching, rate limiting.
Evaluate AI agents with task completion metrics, trajectory analysis, and safety testing. Topics include WebArena, SWE-bench, GAIA, and OSWorld benchmarks.
Explains how AI agents manage short-term context and long-term memory. Examines vector databases, retrieval algorithms.
Explains how layer probing maps linguistic properties across BERT layers, from surface features in lower layers to semantic content in upper layers.
Measure code LLM quality using execution-based evaluation, the pass@k metric, and key benchmarks like HumanEval, APPS, and SWE-bench.
Explains how LLM agents safely execute generated code using sandboxed environments, capture execution feedback.
Covers LLM tool selection through embedding-based routing, hybrid strategies, and semantic interfaces. Build scalable multi-tool agent systems.
Covers LLM agent architectures including control loops, state management strategies, planning mechanisms, and termination conditions for autonomous AI systems.
Transform raw text into structured data using named entity recognition, relation extraction, event extraction, and LLM-based JSON output generation.
Explains how the ReAct pattern enables LLM agents to interleave reasoning with tool execution.
Covers code generation with LLMs, covering docstring-to-code, test-driven generation, sampling strategies, self-repair loops, and generation quality metrics.
Explains how LLM-powered code completion works: context assembly with fill-in-the-middle, candidate ranking, latency optimizations like speculative decoding.
Explains why interpretability matters for language models, covering debugging, trust, safety alignment, scientific understanding.
Language models can explain code, detect bugs, support review, and run semantic code search. Covers dual encoders, contrastive training, and evaluation.
Explains how function calling enables LLMs to invoke external tools and APIs through structured JSON schemas, bridging natural language and executable code.
Explains why LLMs require external tools to overcome knowledge cutoffs, computational limits, and hallucinations. Topics include tool-augmented AI systems.
Covers RAG prompt engineering with strategic context placement, citation formats, and truncation strategies to improve LLM accuracy and reduce hallucinations.
Explains how reranking with cross-encoders solves bi-encoder limitations. Topics include two-stage retrieval, training strategies.
Explains how red teams systematically probe language models for safety failures, covering attack taxonomies, ASR metrics, RL-based automated attack generation.
Covers direct and indirect prompt injection attacks, how RAG pipelines create injection surfaces, and the layered defense strategies used to mitigate them.
Explains how code language models are trained: code data curation, code-specific tokenization, fill-in-the-middle objectives.
Hybrid search combines BM25 keyword ranking with dense vector retrieval. Covers reciprocal rank fusion, weighted scores, recall, and tuning tradeoffs.
Covers systematic strategies for hyperparameter search, how muP enables transfer across model scales.
Explains how steering vectors and activation addition let you modify language model behavior at inference time.
Explains how Product Quantization compresses embeddings up to 100x using learned codebooks and asymmetric distance computation for scalable vector search.
Detect and prevent training instability in deep learning. Topics include loss spikes, gradient norm monitoring, gradient clipping.
Explains how gradient accumulation simulates large batch sizes on limited GPU memory by splitting batches into micro-batches.
Explains how weight decay regularizes neural networks, why AdamW decouples weight decay from adaptive gradients.
Explains how batch size affects gradient noise and generalization, apply the linear scaling rule for learning rates, identify the critical batch size.
Covers IVF indexes for scalable vector search. Topics include clustering-based partitioning, nprobe tuning, and IVF-PQ compression for billion-scale retrieval.
Examines harmful content categories, misuse scenarios, unintended harms, and structured threat models for reasoning about safety in language AI systems.
Covers cosine learning rate schedule used in GPT and LLaMA training: the decay formula, warm restarts, key parameters, and comparison with linear decay.
Covers Hierarchical Navigable Small World (HNSW) graphs for vector search. Topics include graph architecture, construction, and tuning for high-speed retrieval.
Covers question answering systems from span extraction with BERT to retrieval-augmented generation, covering evaluation metrics and open-domain QA pipelines.
Examines vector similarity search for RAG systems. Compare cosine, dot product, and Euclidean metrics, and implement exact vs. approximate search with FAISS.
Explains how learning rate schedules improve neural network training. Topics include step decay, exponential decay, inverse square root with warmup.
Explains how embedding models convert text to vectors for RAG. Topics include bi-encoder architecture, pooling strategies, dimensionality trade-offs.
Covers document chunking for RAG systems. Examines fixed-size, recursive, and semantic strategies to balance retrieval precision with context window limits.
Save and restore complete training state, choose checkpoint frequency, implement asynchronous I/O, and recover distributed LLM training runs from failures.
Covers contrastive learning for dense retrieval. Train models using InfoNCE loss, in-batch negatives, and hard negative mining strategies effectively.
Covers distributed training communication: gradient compression, topology-aware all-reduce, NCCL tuning.
Explains how mixed precision training uses FP16 and BF16 floating point formats to speed up LLM training and cut memory usage without sacrificing accuracy.
Covers dense retrieval for semantic search. Examines bi-encoder architectures, embedding metrics, and contrastive learning to overcome keyword limitations.
How activation checkpointing trades compute for memory by discarding and recomputing activations.
Create a free account to keep your reading organized, join thoughtful discussions, and get more from every chapter.
Free to join · Takes less than a minute
Why
I created this space so readers can learn together, ask questions, and make sense of difficult ideas.