ProxyFormer: A Dual-Stream Proxy Architecture for Ultra-Long Context and High-Resolution Generation
Not on the map. Why?
Abstract (arXiv)
The quadratic growth of attention computation and key-value (KV) cache with respect to sequence length is a central bottleneck for ultra-long-context language models and high-resolution generative models. We propose ProxyFormer, a general dual-stream architecture built upon proxy tokens. In each layer, fine-grained local features are compressed bottom-up into a small set of proxy states; expensive global interactions are performed only in the compressed proxy space; the globally contextualized proxies are then decompressed and injected top-down back into the local stream. Because the local stream persists across layers, fine-grained information that is not captured by one compression step remains accessible for later refinement, alleviating the irreversible information loss of conventional one-shot compression. We further introduce factorized multi-level compression/decompression, layer-wise dynamic compression ratios, asymmetric dual embeddings, and a proxy-only KV-cache inference scheme. On a 16GB GPU with batch size 1, a standard decoder-only model can train sequences of only about 20K tokens, whereas ProxyFormer with a compression ratio of 64 extends the trainable sequence length to about 0.7M. A model trained with a 64K window retains 92%-95% retrieval accuracy on a multi-needle retrieval task with 1,048,576 tokens, and a model trained with an 8K window exceeds 94% accuracy when extrapolated to 256K tokens. Preliminary image-generation experiments demonstrate the feasibility of ProxyFormer for both pixel-space and latent-space flow matching.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 26 references that are in the map. First posted on arXiv 24 Aug 2026.
Builds on
15 of 26 references.
References · 15
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
- 2023Landmark Attention: Random-Access Infinite Context Length for Transformerscited by 206
- 2024Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attentioncited by 194
- 2024Needle in the Haystack for Memory Based Large Language Modelscited by 32
- 2026Mano: Restriking Manifold Optimization for LLM Trainingcited by 12
- 2025Rethinking Transformer Connectivity: TLinFormer, A Path to Exact, Full Context-Aware Linear Attentioncited by 2
3 more
- 2025From TLinFormer to TConstFormer: The Leap to Constant-Time Transformer Attention: Achieving O(1) Computation and O(1) KV Cache during Autoregressive Inferencecited by 1
- 2025Compression is Routing: Reconstruction Error as an Intrinsic Signal for Modular Language Modelscited by 1
- 2026JLT: Clean-Latent Prediction in Latent Diffusion Transformerscited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025RocketKV: Accelerating Long-Context LLM Inference via Two-Stage KV Cache Compression
- 2026End-to-End Context Compression at Scale
- 2025TailorKV: A Hybrid Framework for Long-Context Inference via Tailored KV Cache Optimization
- 2026HybridKV: Hybrid KV Cache Compression for Efficient Multimodal Large Language Model Inference
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs
- 2025KVCompose: Efficient Structured KV Cache Compression with Composite Tokens
- 2024D2O: Dynamic Discriminative Operations for Efficient Long-Context Inference of Large Language Models
- 2025ZSMerge: Zero-Shot KV Cache Compression for Memory-Efficient Long-Context LLMs