23 citations · 74 across the 22 of their papers we have counts for
4 papers · 1 filter
Hardness of Maximum Likelihood Learning of DPPs
Elena Grigorescu, Brendan Juba, Karl Wimmer +1
Determinantal Point Processes (DPPs) are a widely used probabilistic model for negatively correlated sets. DPPs have been successfully employed in Machine Learning applications to…
Flipping out with many flips: hardness of testing k-monotonicity
Elena Grigorescu, Akash Kumar, Karl Wimmer
A function f : {0, 1}^n -> {0, 1} is said to be k-monotone if it flips between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization o…
Statistical Algorithms and a Lower Bound for Detecting Planted Clique
Vitaly Feldman, Elena Grigorescu, Lev Reyzin +2
We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be implemented using access to a statistical query oracle…
Separations of Matroid Freeness Properties
Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström +1
Properties of Boolean functions on the hypercube invariant with respect to linear transformations of the domain are among the most well-studied properties in the context of propert…