RLX: A Unified Multi-Backend Tensor Compiler and Distributed Runtime in Rust
Not on the map. Why?
Abstract (arXiv)
Production machine learning (ML) stacks often split graph compilation and kernel execution across different layers and languages, making backend behavior, deployment guarantees, and performance fallbacks hard to reason about end-to-end. RLX addresses this gap with a single Rust codebase that combines compiler and runtime roles around one primitive-level, three-level intermediate representation (IR), plus a transparent dispatch contract that resolves each operator to native, common-IR, or rewritten lowering and fails compilation when legalization is not possible. The same IR targets fourteen runtime devices (cpu, metal, mlx, ane, cuda, rocm, oneapi, tpu, hexagon, gpu, vulkan, opengl, directx, webgpu) and two specialty codegen paths (Cortex-M INT8 and FPGA), ingests safetensors, GGUF, ONNX, and rten formats, supports F16/BF16/F64/C64 and quantized INT4/INT8 flows with AMP/PTQ/QAT, and scales via tensor-/pipeline-parallel collectives over TCP and RDMA transports. Beyond neural workloads, RLX also extends to scientific/physics-style domains through sparse and dense linear algebra extensions (e.g., CSR LU/CG/matvec and LAPACK- backed factorizations) and 3D Gaussian splatting operators. We evaluate RLX against PyTorch, TensorFlow, JAX, candle, burn, tch, rten, MLX, CoreML, IREE, Glow, TensorRT, and tinygrad under identical input generation and p50 measurement methodology on one host. On all-MiniLM-L6-v2, RLX-Metal is fastest at every batch (e.g., 16.6 ms at batch 32 vs. PyTorch-MPS 26.7 ms). In the MNIST training table, RLX also has the top-throughput entry (graph-fused MLP: 946,487 img/s), above NumPy+BLAS (787,349 img/s), while retaining 100% top-1 parity on reference checks (e.g., Qwen3).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 20 references that are in the map. First posted on arXiv 29 Sep 2026.
Builds on
3 of 20 references.
References · 3
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014cuDNN: Efficient Primitives for Deep Learningcited by 245
- 2018Glow: Graph Lowering Compiler Techniques for Neural Networkscited by 75
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026TensorBench: Benchmarking Coding Agents on a Compiler-Based Tensor Framework
- 2026TensorCast: The Missing Tensor Management Layer in Large Language Model Infrastructure
- 2026PassNet: Scaling Large Language Models for Graph Compiler Pass Generation
- 2026Prism: Symbolic Superoptimization of Tensor Programs
- 2026AI as a Compiler: Compiling Triton kernels without the Triton compiler
- 2026TCL: Enabling Fast and Efficient Cross-Hardware Tensor Program Optimization via Continual Learning
- 2026Spec Sheets Are Not Kernels: An ISA- and Source-Level Audit of INT8 Availability on NVIDIA Blackwell Ultra
- 2025MPK: A Compiler and Runtime for Mega-Kernelizing Tensor Programs