1 code implementation • ICML 2020 • Sebastian Prillo, Julian Eisenschlos
In this work we propose a simple continuous relaxation for the argsort operator.
no code implementations • 27 Feb 2024 • Michael Celentano, William S. DeWitt, Sebastian Prillo, Yun S. Song
Consequently, the computational cost is determined not by the size of the final simulated tree, but by the size of the population tree in which it is embedded.
1 code implementation • 29 Jun 2020 • Sebastian Prillo, Julian Martin Eisenschlos
While sorting is an important procedure in computer science, the argsort operator - which takes as input a vector and returns its sorting permutation - has a discrete image and thus zero gradients almost everywhere.
