A spin glass model for reconstructing nonlinearly encrypted signals corrupted by noise
Abstract
An encryption of a signal s∈RN is a random mapping s y=(y1,…,yM)T∈ RM which can be corrupted by an additive noise. Given the Encryption Redundancy Parameter (ERP) μ=M/N 1, the signal strength parameter R=Σi si2/N, and the ('bare') noise-to-signal ratio (NSR) γ 0, we consider the problem of reconstructing s from its corrupted image by a Least Square Scheme for a certain class of random Gaussian mappings. The problem is equivalent to finding the configuration of minimal energy in a certain version of spherical spin glass model, with squared Gaussian-distributed random potential. We use the Parisi replica symmetry breaking scheme to evaluate the mean overlap p∞∈ [0,1] between the original signal and its recovered image (known as 'estimator') as N ∞, which is a measure of the quality of the signal reconstruction. We explicitly analyze the general case of linear-quadratic family of random mappings and discuss the full p∞ (γ) curve. When nonlinearity exceeds a certain threshold but redundancy is not yet too big, the replica symmetric solution is necessarily broken in some interval of NSR. We show that encryptions with a nonvanishing linear component permit reconstructions with p∞>0 for any μ>1 and any γ<∞, with p∞ γ-1/2 as γ ∞. In contrast, for the case of purely quadratic nonlinearity, for any ERP μ>1 there exists a threshold NSR value γc(μ) such that p∞=0 for γ>γc(μ) making the reconstruction impossible. The behaviour close to the threshold is given by p∞ (γc-γ)3/4 and is controlled by the replica symmetry breaking mechanism.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.