Skip to main content
PK

Philip Kiely

Philip Kiely and Ali Taha From**cache-aware Routing**speculative Decoding Gains and Limits**quantization Error Cancellation**stacking Optimizations for 4–10x Gains
2episodes
2podcasts

We have 2 summarized appearances for Philip Kiely so far. Browse all podcasts to discover more episodes.

Featured On 2 Podcasts

Top resources Philip Kiely mentions

Books, tools, and gear cited across podcast appearances. Ranked by frequency.

SignalCast may earn commission on purchases via affiliate links on each resource page.

All Appearances

2 episodes

AI Summary

→ WHAT IT COVERS Philip Kiely and Ali Taha from Baseten walk through the full inference engineering stack — from cache-aware routing and prefill/decode disaggregation to speculative decoding, quantization strategies, and hardware parallelism — explaining how providers stack optimizations to achieve 4–10x speed improvements over baseline deployments, while covering video diffusion constraints and the convergence of training and inference workflows. → KEY INSIGHTS - **Cache-Aware Routing:** When a long prompt (e.g., 200,000 tokens) arrives, route it to a replica that already holds a matching KV cache to skip prefill entirely. Baseten checks for cached inputs before assigning a prefill worker. For repeated agentic or coding workloads, this alone delivers significant latency reduction. Disaggregating prefill and decode across separate GPU sets further prevents decode throughput from being bottlenecked by heavy prefill computation on the same hardware. - **Speculative Decoding Gains and Limits:** A small draft model — typically one-sixteenth the size of the target model, around 1B parameters — predicts 3 tokens per step, which the full model verifies in one forward pass. Acceptance rates are traffic-dependent: a coding-specific speculator achieves near-perfect acceptance on coding prompts but degrades on unrelated tasks. For shared endpoints, general-purpose speculators trained on public coding and agentic datasets are the practical default, delivering roughly a 2x decode speed improvement. - **Quantization Error Cancellation:** Baseten's research intern Joshua demonstrated mathematically that quantizing more layers can produce better output fidelity than quantizing fewer, because quantization errors across layers can cancel out. By predicting which layers have offsetting error distributions — one skewed right, the next left — and selectively quantizing those, Baseten achieved 20% higher quantization than NVIDIA's baseline on GLM 5.2 while improving KL divergence between quantized and full-precision logit distributions, yielding both better throughput and better model fidelity simultaneously. - **Stacking Optimizations for 4–10x Gains:** A baseline GLM 5.2 deployment on Hoppers without optimization runs at roughly 30–40 tokens per second. Moving from BF16 to INT8 adds ~30–40%; INT8 to NVFP4 adds another ~30–40% (combined ~2x). A well-trained speculator adds another ~2x. Prefill/decode disaggregation adds a further ~2x under sufficient traffic. Stacking these three optimizations reaches approximately 8–10x over baseline, with the best-configured deployments hitting 300–400 tokens per second on latency-optimized parallelism settings. - **Dedicated vs. Serverless Inference Threshold:** The decision to move from pay-per-token serverless APIs to dedicated GPU deployments is driven by three factors: reliability requirements, traffic volume (millions of tokens per hour make hourly billing substantially cheaper), and workload specificity. Dedicated deployments unlock traffic-specific speculative decoders, custom quantization precision, tuned batch sizes, and parallelism strategies optimized for latency versus throughput — none of which are feasible on shared endpoints where traffic patterns are unknown and hardware is contended. - **Video Diffusion Attention Bottleneck:** Generating five seconds of 480p video at 16 fps produces roughly 35,000 attention tokens after latent compression. Because diffusion attention is quadratic, doubling duration quadruples compute, making full-attention generation beyond ~10 seconds practically infeasible on current hardware. Sparse attention (top 12.5% of tokens) reduces compute but degrades quality. Autoregressive video models would enable streaming generation and allow LLM-style inference optimizations like speculative decoding, but no open-source autoregressive video model currently matches diffusion quality. - **Training–Inference Convergence:** Inference engineers at Baseten now routinely write training pipelines. Two workflows drive this: first, speculative decoder (Eagle-head) training requires running inference on the base model to extract hidden states as training data. Second, when NVFP4 post-training quantization (PTQ) degrades model quality, quantization-aware distillation — running full-precision and NVFP4 model versions in parallel and aligning their logit distributions — recovers fidelity. NVIDIA's quantization distillation paper formalizes this approach, and RL training rollout speed directly depends on inference engine throughput, making inference optimization a training bottleneck. → NOTABLE MOMENT Ali Taha describes a race condition bug where the same model weights on one GPU cluster produced token repetition loops while an identical deployment on a different cluster did not. The root cause traced to KV cache transfer speed between nodes: a slower interconnect exposed a kernel synchronization flaw that faster NVLink connections masked entirely, making the bug hardware-topology-dependent rather than a model or software issue. 💼 SPONSORS None detected 🏷️ Inference Engineering, Speculative Decoding, Model Quantization, GPU Parallelism, Video Diffusion, KV Cache Optimization, LLM Serving Infrastructure

AI Summary

→ WHAT IT COVERS Philip Kiely, Head of AI Education at Base Ten, explains inference engineering as a discipline requiring expertise across CUDA programming, distributed systems, and applied research. He covers the maturity cycle from per-token APIs to dedicated deployments, hardware generations, and why inference optimization becomes critical at scale for agentic AI workloads. → KEY INSIGHTS - **Inference research-to-production timeline:** New inference techniques move from research paper to production implementation in hours, not weeks. Base Ten's team implemented a PoloQuant CUDA kernel 31 hours after the paper published. Engineers should monitor inference research continuously, as techniques dismissed a year ago can become immediately viable when model scales shift. - **Product maturity deployment cycle:** Companies follow a predictable inference path: start with per-token closed APIs, then move to hyperscaler provisioned throughput (AWS Bedrock, GCP Vertex), then dedicated inference providers like Base Ten with weight-owned models, then in-house platforms. The trigger is typically cost overruns or capacity constraints, not company size. - **KV cache prefix optimization:** A single token difference early in a prompt sequence invalidates the entire KV cache, eliminating reuse benefits. Engineers should structure system prompts and chat templates to maximize shared prefixes across requests, ensuring cache hits. This applies regardless of whether inference runs on owned infrastructure or third-party providers. - **Task-model matching for agentic speed:** Agents making hundreds of model calls per user action require specialized runtimes per task type. Running named entity recognition on a frontier LLM costs significantly more versus a specialized runtime. Base Ten's NER runtime runs in 1 millisecond versus 500 milliseconds on a small LLM — a 500x difference that eliminates visible latency in agent pipelines. - **Hopper GPU staying power:** H100 rental prices are higher now than a year ago despite Blackwell availability. Hopper GPUs remain dominant because open-source models from Chinese labs are optimized for Hopper architecture due to export controls, and smaller models (1–8B parameters) run efficiently on MIG-partitioned Hopper slices without requiring full Blackwell NVL72 systems. → NOTABLE MOMENT Kiely describes how text-to-speech models have a hard ceiling of roughly 80–100 tokens per second for real-time audio output. Beyond that threshold, the optimization goal flips entirely — engineers should increase batch size for concurrent streams or reduce hardware costs rather than chasing higher token throughput. 💼 SPONSORS None detected 🏷️ AI Inference Engineering, LLM Deployment, GPU Infrastructure, Agentic AI Systems, Model Serving Optimization

Explore More

Never miss Philip Kiely's insights

Subscribe to get AI-powered summaries of Philip Kiely's podcast appearances delivered to your inbox weekly.

Start Free Today

No credit card required • Free tier available