KuaFu: Compressing Long User Behavior into Understanding at Billion Scale
Not on the map. Why?
Abstract (arXiv)
Conversational agents, generative recommenders, and personalized advertising all rest on one capability: understanding each user from raw behavior. Prevailing industrial practice is task-specific: for each task, a relevant subsequence is extracted from the full history and a dedicated model trained on it. In production it hits two bottlenecks. First, even after filtering, a single-task sequence stays extremely long: content-interest summarization reads several hundred items per user, tens of thousands of tokens once serialized as prompt text. Second, profiles are refreshed routinely: a billion users weekly, roughly 100K QPM in aggregate, which under a fixed GPU budget sets a hard throughput floor. Compression is therefore mandatory, yet truncation or coarse compression can silently distort the profile, introducing four hallucination types (fabrication, omission, date misattribution, broken logic) that, with no way to evaluate the compressed representation itself, surface only as diffuse degradation in downstream metrics. We present KuaFu, a unified behavior-compression layer whose minimal unit is one behavior item. A two-axis projector compresses each item into 2-4 tokens of width 128-256 (about 10x along the token axis, 20x along width; per-item cache 10 KB to 0.5 KB), with fidelity-oriented four-stage training and layered intermediate evaluation. Across four production profiling tasks it matches or exceeds uncompressed single-task production models on all five headline metrics, raises per-GPU throughput by 37%-350%, and saves 190 GPUs. On public benchmarks it nearly always beats prior compressors at the same compression ratio (up to +17.7 EM on out-of-domain MRQA); on RecBench, a 4B model surpasses its 8B counterpart by 1.90 points. KuaFu has run on the Tencent advertising and recommendation platform for ten months, lifting overall GMV by 1.37%.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 29 references that are in the map. First posted on arXiv 25 Sep 2026.
Builds on
16 of 29 references.
References · 16
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
- 2019MRQA 2019 Shared Task: Evaluating Generalization in Reading Comprehensioncited by 184
- 2025PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendationscited by 30
- 2025Autoencoding-Free Context Compression for LLMs via Contextual Semantic Anchorscited by 14
- 2025REFRAG: Rethinking RAG based Decodingcited by 9
- 2025From Reasoning LLMs to BERT: A Two-Stage Distillation Framework for Search Relevancecited by 7
- 2025NEZHA: A Zero-sacrifice and Hyperspeed Decoding Architecture for Generative Recommendationscited by 6
- 2025Multi-Grained Patch Training for Efficient LLM-based Recommendationcited by 5
- 2025Can LLMs Outshine Conventional Recommenders? A Comparative Evaluationcited by 3
- 2026GISTBench: Evaluating LLM User Understanding via Evidence-Based Interest Verificationcited by 3
4 more
- 2024UserSumBench: A Benchmark Framework for Evaluating User Summarization Approachescited by 2
- 2026Unleashing the Potential of Sparse Attention on Long-term Behaviors for CTR Predictioncited by 2
- 2025FOUNDv2: Learning Unified User Quantized Tokenizers for User Representationcited by 1
- 2026Token Factory: Efficiently Integrating Diverse Signals into Large Recommendation Modelscited by 1
Built on by
Not cited yet.