2 citations · 4 across the 4 of their papers we have counts for
9 papers
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…
Identity testing under label mismatch
Clément L. Canonne, Karl Wimmer
Testing whether the observed data conforms to a purported model (probability distribution) is a basic and fundamental statistical task, and one that is by now well understood. Howe…
List Learning with Attribute Noise
Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba +2
We introduce and study the model of list learning with attribute noise. Learning with attribute noise was introduced by Shackelford and Volper (COLT 1988) as a variant of PAC learn…
Testing Data Binnings
Clément L. Canonne, Karl Wimmer
Motivated by the question of data quantization and "binning," we revisit the problem of identity testing of discrete probability distributions. Identity testing (a.k.a. one-sample…
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…
Testing -Monotonicity
Clément L. Canonne, Elena Grigorescu, Siyao Guo +2
A Boolean -monotone function defined over a finite poset domain alternates between the values and at most times on any ascending chain in . Ther…
Invariance principle on the slice
Yuval Filmus, Guy Kindler, Elchanan Mossel +1
We prove an invariance principle for functions on a slice of the Boolean cube, which is the set of all vectors {0,1}^n with Hamming weight k. Our invariance principle shows that a…
Optimal query complexity for estimating the trace of a matrix
Karl Wimmer, Yi Wu, Peng Zhang
Given an implicit matrix with oracle access for any , we study the query complexity of randomized algorithms for estimating the trace of…
Approximate resilience, monotonicity, and the complexity of agnostic learning
Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan +2
A function is -resilient if all its Fourier coefficients of degree at most are zero, i.e., is uncorrelated with all low-degree parities. We study the notion of $\mat…