4 papers
Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection
Tadeusz Dziarmaga, Witold Sikora, Łukasz Struski +2
Top-k selection is a fundamental computational primitive with applications spanning databases, information retrieval, signal processing, and modern machine learning workloads, incl…
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…
LaPrune: Controllable Differentiable Sparsity at Million Scale
Jakub Antczak, Joanna Wojciechowicz, Łukasz Struski +1
Top- selection determines which components of a sparse model remain active. Hard selection blocks gradients, while continuous relaxations often couple mask hardness to the selec…
Tight Bounds for Jensen's Gap with Applications to Variational Inference
Marcin Mazur, Tadeusz Dziarmaga, Piotr KoÅcielniak +1
Since its original formulation, Jensen's inequality has played a fundamental role across mathematics, statistics, and machine learning, with its probabilistic version highlighting…