Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
Fast LapSum: Exact Differentiable Top-k at Million Scale
Łukasz Struski, Joanna Wojciechowicz, Jakub Antczak +3
The top- operation is a fundamental building block of modern sparse computation, enabling token routing, expert activation, memory selection, and attention pruning. Yet standard…
cs.AI2025
LapSum -- One Method to Differentiate Them All: Ranking, Sorting and Top-k Selection
Åukasz Struski, MichaÅ B. Bednarczyk, Igor T. Podolak +1
We present a novel technique for constructing differentiable order-type operations, including soft ranking, soft top-k selection, and soft permutations. Our approach leverages an e…