We consider the problem of unsourced random access (U-RA), a grant-free uncoordinated
form of random access, in a wireless channel with a massive MIMO base station equipped …

In this work, we consider the optimization formulation for symmetric tensor decomposition
recently introduced in the Subspace Power Method (SPM) of Kileel and Pereira. Unlike …

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into
symmetric factors with binary entries, either ±1\} or 0,1\}. This research answers fundamental …

We introduce a new method for building higher-degree sum-of-squares lower bounds over
the hypercube $\mathbf {x}\in\{\pm 1\}^ N $ from a given degree 2 lower bound. Our method …

The related tasks of certifying bounds on optimization problems and refuting unsatisfiable
systems of constraints have a long history in computer science and optimization, and deep …

This dissertation treats a recently introduced modern random access protocol known as
unsourced random access (U-RA). This protocol belongs to the family of grant-free random …

In this work, we provide non-asymptotic, probabilistic guarantees for successful recovery of
the common nonzero support of jointly sparse Gaussian sources in the multiple …

In this work, we provide non-asymptotic, probabilistic guarantees for successful recovery of
the common nonzero support of jointly sparse Gaussian sources in the multiple …

Chemical imaging provides information about the distribution of chemicals within a target.
When combined with structural information about the target, in situ chemical imaging opens …

This dissertation can be coarsely divided into two parts: Chapters 1 and 2 study the problem
of the multidimensional filter bank design and data-driven adaptation, while Chapters 3 to 5 …