Distributed Reconstruction from Compressive Measurements: Nonconvexity and Heterogeneity

Abstract: The compressive sensing (CS) and 1-bit CS demonstrate superior efficiency in signal acquisition and resource conservation, while 1-bit CS achieves maximum resource efficiency through sign-only measurements. With the emergence of massive data, the distributed signal aggregation under CS and 1-bit CS measurements introduces many challenges, including nonconvexity and heterogeneity. The nonconvexity originates from the unidentifiability of signal magnitude under finite-precision measurements. The heterogeneity arises from the signal and noisy measurement on each node. To address these challenges, we propose a framework with a squared cosine similarity penalty. We address nonconvexity by an novel invex relaxation formulation to ensure the uniqueness of the global optimality. For heterogeneous signals and noisy measurements, the proposed estimate adaptively debiases through correction guided by similarity and signal-to-noise ratio (SNR) information. Our method achieves a high probability minimax-optimal convergence rate under sufficient node counts and similarity conditions, improving from $O{(p\log{p}/n_j)<sup>{1/2}}$ to $O{(p\log{p}/N)<sup>{1/2}+p<sup>{1/2}/n_j}$, with signal dimension $p$, local and total sizes $n_j$ and $N$. Extensive simulations validate the method's effectiveness and performance gains in reconstructing heterogeneous signals from 1-bit CS measurements. The proposed framework maintains applicability to CS measurements while reducing communication overhead in distributed setting.