Search Results for author: Krzysztof Onak

Found 3 papers, 1 papers with code

Compression Barriers for Autoregressive Transformers

no code implementations21 Feb 2025 Themistoklis Haris, Krzysztof Onak

For the low-dimensional regime $d = o(\log n)$, we show that any algorithm requires $\Omega(d\cdot e^d)$ space and prove, using tight bounds on covering numbers, that SubGen, proposed by Zandieh, Han, Mirrokni and Karbasi, matches this bound.

LEMMA

Scalable Fair Clustering

1 code implementation10 Feb 2019 Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner

In the fair variant of $k$-median, the points are colored, and the goal is to minimize the same average distance objective while ensuring that all clusters have an "approximately equal" number of points of each color.

Clustering Fairness

Communication-Efficient Distributed Learning of Discrete Distributions

no code implementations NeurIPS 2017 Ilias Diakonikolas, Elena Grigorescu, Jerry Li, Abhiram Natarajan, Krzysztof Onak, Ludwig Schmidt

For the case of structured distributions, such as k-histograms and monotone distributions, we design distributed learning algorithms that achieve significantly better communication guarantees than the naive ones, and obtain tight upper and lower bounds in several regimes.

Density Estimation

Cannot find the paper you are looking for? You can Submit a new open access paper.