Meta Adaptive Ranking Model: Bending the Inference Scaling Curve to Serve LLM-Scale Models for Ads
Meta’s Adaptive Ranking Model scales ad recommendation models toward LLM-level complexity without sacrificing sub-second latency or cost efficiency. It replaces uniform inference with intelligent request routing, selecting the most appropriate model for each user context. Since launching on Instagram in Q4 2025, it reportedly increased ad conversions by 3% and click-through rates by 5% among targeted users. ## The Inference Trilemma - More complex models require substantially more compute and memory. - Ads must still be selected and delivered within a sub-second latency budget. - Simply adding hardware is too expensive for a service operating at global scale. - Adaptive Ranking Model addresses these competing demands by matching model complexity to each request’s context and intent. ## Three Core Innovations - **Inference-efficient model scaling** - Reaches complexity comparable to roughly 10 GFLOPs per token in advanced LLMs. - Maintains approximately 100 ms bounded latency—an order of magnitude faster than standard LLM inference. - **Model/system co-design** - Aligns model architectures with hardware and silicon capabilities. - Achieves approximately 35% model FLOPs utilization across different hardware types. - **Reimagined serving infrastructure** - Uses multi-card GPU systems to overcome the memory limits of individual devices. - Supports models with roughly one trillion parameters. ## Request-Oriented Computation - Traditional ranking processes each user-ad pair independently, duplicating expensive user-side computations. - Request-Oriented Optimization computes dense user signals once per request and reuses them across all candidate ads. - Request-Oriented Computation Sharing and In-Kernel Broadcast distribute shared embeddings directly within GPU kernels. - These techniques change scaling behavior from linear toward sub-linear while reducing memory-bandwidth pressure. - Long user behavior sequences can also be processed once per request and reused across candidates. - A centralized key-value store avoids duplicating user logs and joins them with training data when needed, reducing storage and serving costs. ## Wukong Turbo Architecture - Wukong Turbo builds on Meta’s Wukong architecture, which combines: - Stackable factorization machines - Sequence learning - Cross-layer attention - A **No-Bias** design removes unstable terms, improving throughput without increasing parameter counts or FLOPs. - Small parameter delegation moves selected parameters from Fully Sharded Data Parallel (FSDP) to Distributed Data Parallel (DDP), reducing network and memory overhead. - Sparsity-based simplification removes redundant linear-layer components. - Together, these changes improve numerical stability and throughput while preserving the sub-second inference target. ## Holistic Latency Optimization - The system also targets feature preprocessing, which can create client-memory pressure and leave GPUs waiting for data. - The article indicates that Adaptive Ranking Model addresses this bottleneck through end-to-end latency optimization and GPU-based preprocessing, though the provided text ends before detailing the implementation. Adaptive Ranking Model demonstrates that LLM-scale recommendation intelligence can be practical in real-time advertising when model architecture, request execution, hardware, and serving infrastructure are designed together. Its central recommendation is to avoid one-size-fits-all inference and instead allocate computation dynamically according to each request’s value and complexity.
Read original(opens in new tab)