Search Results for author: Elena Grigorescu

Found 4 papers, 0 papers with code

Differentially-Private Sublinear-Time Clustering

no code implementations27 Dec 2021 Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee

Clustering is an essential primitive in unsupervised machine learning.

List Learning with Attribute Noise

no code implementations11 Jun 2020 Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie

We introduce and study the model of list learning with attribute noise.

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

Testing $k$-Monotonicity

no code implementations1 Sep 2016 Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer

Our results include the following: - We demonstrate a separation between testing $k$-monotonicity and testing monotonicity, on the hypercube domain $\{0, 1\}^d$, for $k\geq 3$; - We demonstrate a separation between testing and learning on $\{0, 1\}^d$, for $k=\omega(\log d)$: testing $k$-monotonicity can be performed with $2^{O(\sqrt d \cdot \log d\cdot \log{1/\varepsilon})}$ queries, while learning $k$-monotone functions requires $2^{\Omega(k\cdot \sqrt d\cdot{1/\varepsilon})}$ queries (Blais et al. (RANDOM 2015)).

Learning Theory

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