no code implementations • 3 Feb 2020 • Matthew L. Malloy, Ardhendu Tripathy, Robert D. Nowak
More precisely, consider an empirical distribution $\widehat{\boldsymbol{p}}$ generated from $n$ iid realizations of a random variable that takes one of $k$ possible values according to an unknown distribution $\boldsymbol{p}$.
no code implementations • 13 Jun 2015 • Matthew L. Malloy, Scott Alfeld, Paul Barford
Our approach considers the normal condition of the data to be specified by a model consisting of a set of distributions.
no code implementations • 26 Jun 2013 • Matthew L. Malloy, Robert D. Nowak
The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible signal-to-noise-ratio (SNR) levels, improving on previous work in adaptive compressed sensing.
no code implementations • 6 Sep 2012 • Matthew L. Malloy, Gongguo Tang, Robert D. Nowak
We consider a large number of populations, each corresponding to either distribution P0 or P1.