RTop-K: Ultra-Fast Row-Wise Top-K Selection for Neural Network Acceleration on GPUs
Not on the map. Why?
Abstract (arXiv)
Top-k selection algorithms are fundamental in a wide range of applications, including high-performance computing, information retrieval, big data processing, and neural network model training. In this paper, we present RTop-K, a highly efficient parallel row-wise top-k selection algorithm specifically designed for GPUs. RTop-K leverages a binary search-based approach to optimize row-wise top-k selection, providing a scalable and accelerated solution. We conduct a detailed analysis of early stopping in our algorithm, showing that it effectively maintains the testing accuracy of neural network models while substantially improving performance. Our GPU implementation of RTop-K demonstrates superior performance over state-of-the-art row-wise top-k GPU implementations, achieving an average speed-up of up to 11.49× with early stopping and 7.29× without early stopping. Moreover, RTop-K accelerates the overall training workflow of MaxK-GNNs, delivering speed-ups ranging from 11.97% to 33.29% across different models and datasets.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Sep 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 3; 2026: 4.
7 papers.
- 2025SonicMoE: Accelerating MoE with IO and Tile-aware Optimizationscited by 20
- 2025MamNet: A Novel Hybrid Model for Time-Series Forecasting and Frequency Pattern Analysis in Network Trafficcited by 3
- 2026Qrita: High-performance Top-k and Top-p using Pivot-based Truncation and Selectioncited by 1
- 2026Scaling Attention via Feature Sparsitycited by 1
- 2026Stochastic Sparse Attention for Memory-Bound Inferencecited by 1
- 2025A Faster Generalized Two-Stage Approximate Top-Kcited by 0
- 2026Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selectioncited by 0
- 2026Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection12 Aug 2026
- 2026Stochastic Sparse Attention for Memory-Bound Inference3 May 2026
- 2026Scaling Attention via Feature Sparsity17 Mar 2026
- 2026Qrita: High-performance Top-k and Top-p using Pivot-based Truncation and Selection2 Feb 2026
- 2025SonicMoE: Accelerating MoE with IO and Tile-aware Optimizations16 Dec 2025
- 2025MamNet: A Novel Hybrid Model for Time-Series Forecasting and Frequency Pattern Analysis in Network Traffic30 Jun 2025
- 2025A Faster Generalized Two-Stage Approximate Top-K4 Jun 2025