比利时vs摩洛哥足彩
,
university of california san diego
****************************
math 278c - optimization seminar and data science
piya pal
ucsd
structured sampling for covariance compression
abstract:
a number of problems in statistical signal processing model the data as a wide-sense stationary (wss) time series, whose power spectrum (or equivalently, the covariance matrix) acts as a sufficient statistic for inferring parameters of interest. the covariance matrix of such data exhibit toeplitz structure, which can be leveraged to design highly efficient compressive samplers to reduce the dimension of the wss data, without requiring it to have a sparse representation. unlike existing results in compressed sensing, the goal here is to recover the high dimensional covariance matrix (or infer parameters of interest from it), instead of reconstructing the data itself. inspired by our past work on nested sensor arrays, i will describe a new sampling techniques, known as the ``generalized nested sample'' (gns), to acquire compressive measurements in such a way that it becomes possible to perfectly reconstruct the original high dimensional covariance matrix from these compressed sketches. i will focus on lowrank toeplitz covariance matrices and develop an efficient gns-based sampler which allows the recovery of a rank-r toeplitz covariance matrix from a compressed sketch of size $o(√r) x o(√r)$, where the size of the sketch has no dependence on the ambient large dimension n. our reconstruction technique will use a regularizer-free framework, combined with the ability to extrapolate additional “unobserved†entries of the nxn covariance matrix. the algorithm has significantly lower computational complexity (that does not scale with n) compared to recent nuclear-norm based compressive covariance estimators, and is provably robust against bounded errors. finally, i will consider the special case of rank-1 and sparse covariance matrices that arise in the important problem of “phase retrieval†in optical imaging. the role of 2nd order difference sets in complex phase retrieval will be demonstrated, inspiring the design of a new class of non-uniform fourier sampler, that can provably recover a complex signal (upto a global phase ambiguity) from its amplitude measurements with near-minimal number of samples. an interesting connection with the so-called 4n-4 conjecture will also be established, which hypothesizes 4n-4 to be the minimum number of measurements necessary to ensure injectivity in n dimensions for complex phase retrieval. joint work with heng qiao, graduate student, university of california, san diego.
host: jiawang nie
may 17, 2017
4:00 pm
ap&m 5402
****************************