no code implementations • 13 Dec 2023 • Bingbing Hu, Evangelos Kosinas, Adam Polak
It is already well understood: previous works [Duan--Pettie STOC'10; Long--Saranurak FOCS'22] achieve query time linear in the number of failed vertices, and it is conditionally optimal as long as we require preprocessing time polynomial in the size of the graph and update time polynomial in the number of failed vertices.
no code implementations • 4 Apr 2023 • Antonios Antoniadis, Christian Coester, Marek Eliáš, Adam Polak, Bertrand Simon
Since the performance of each predictor may vary over time, it is desirable to use not the single best predictor as a benchmark, but rather a dynamic combination which follows different predictors at different times.
no code implementations • 6 Oct 2022 • Antonios Antoniadis, Joan Boyar, Marek Eliáš, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
We consider two natural such setups: (i) discard predictions, in which the predicted bit denotes whether or not it is ``safe'' to evict this page, and (ii) phase predictions, where the bit denotes whether the current page will be requested in the next phase (for an appropriate partitioning of the input into phases).
no code implementations • 26 Jul 2022 • Adam Polak, Maksym Zub
We present an algorithm that, given an $m$-edge flow network and a predicted flow, computes a maximum flow in $O(m\eta)$ time, where $\eta$ is the $\ell_1$ error of the prediction, i. e., the sum over the edges of the absolute difference between the predicted and optimal flow values.
1 code implementation • NeurIPS 2021 • Antonios Antoniadis, Christian Coester, Marek Eliáš, Adam Polak, Bertrand Simon
A key ingredient in our approach is a new algorithm for the online ski rental problem in the learning augmented setting with tight dependence on the prediction error.
no code implementations • NeurIPS 2021 • Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
We give an algorithm that outputs an explainable clustering that loses at most a factor of $O(\log^2 k)$ compared to an optimal (not necessarily explainable) clustering for the $k$-medians objective, and a factor of $O(k \log^2 k)$ for the $k$-means objective.
1 code implementation • 28 Jun 2021 • Jakub Chłędowski, Adam Polak, Bartosz Szabucki, Konrad Zolna
Effective caching is crucial for the performance of modern-day computing systems.
1 code implementation • ICML 2020 • Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, Bertrand Simon
Still, decision-making systems that are based on such predictors need not only to benefit from good predictions but also to achieve a decent performance when the predictions are inadequate.
Data Structures and Algorithms
no code implementations • 22 Dec 2019 • Stanisław Saganowski, Anna Dutkowiak, Adam Dziadek, Maciej Dzieżyc, Joanna Komoszyńska, Weronika Michalska, Adam Polak, Michał Ujma, Przemysław Kazienko
Wearables like smartwatches or wrist bands equipped with pervasive sensors enable us to monitor our physiological signals.