Country
Secretary Ranking with Minimal Inversions
Sepehr Assadi, Eric Balkanski, Renato Leme
Our main result is a matching upper and lower bound for the secretary ranking problem.
Barely Random Algorithms and Collective Metrical Task Systems
Theorem 1.1 relies on two
Differentiable Optimization of Generalized Nondecomposable Functions using Linear Programs: Supplementary Material
Recently, Kleiman and Page [ 2019 ] used the classical U-Statistic to extend the definition to multiclass settings that alleviates such common pitfalls.
Singleshot : a scalable Tucker tensor decomposition
Abraham Traore, Maxime Berar, Alain Rakotomamonjy
This paper introduces a new approach for the scalableTucker decomposition problem.
Strategic Classification under Unknown Personalized Manipulation
However, in reality, this may not always be the case.
Strategic Classification under Unknown Personalized Manipulation
We begin by providing online mistake bounds and P AC sample complexity in these scenarios for ball manipulations.
Recurrent Space-time Graph Neural Networks
Andrei Nicolicioiu, Iulia Duta, Marius Leordeanu
It is not yet well understood how to integrate information in space and time into a single, general model.