Orthogonal Approximate Message-Passing for Spatially Coupled Linear Models
نویسندگان
چکیده
Orthogonal approximate message-passing (OAMP) is proposed for signal recovery from right-orthogonally invariant linear measurements with spatial coupling. Conventional state evolution generalized to a unified framework of the coupling and long-memory case. The used formulate so-called Onsager correction in OAMP spatially coupled systems. recursion Bayes-optimal proved converge systems via its evolution. This paper proves information-theoretic optimality noiseless sensing matrices.
منابع مشابه
Approximate Message Passing for Bilinear Models
Approach: We take a Bayesian approach to the inference problems (in particular, posterior estimation) that revolve around the bilinear model (1). In particular, we leverage the approximate message passing (AMP) framework of [2], [3] and extend it to the bilinear domain. Compared to Bayesian approaches that rely on Gibbs sampling methods or variational inference, the AMP framework allows us to f...
متن کاملApproximate Message Passing
In this note, I summarize Sections 5.1 and 5.2 of Arian Maleki’s PhD thesis. 1 Notation We denote scalars by small letters e.g. a, b, c, . . ., vectors by boldface small letters e.g. λ,α,x, . . ., matrices by boldface capital letter e.g. A,B,C, . . ., (subsets of) natural numbers by capital letters e.g. N,M, . . .. We denote i’th element of a vector a by ai and (i, j)’th entry of a matrix A by ...
متن کاملOrthogonal Processor Groups for Message-Passing Programs
We consider a generalization of the SPMD programming model to orthogonal processor groups. In this model different partitions of the processors into disjoint processor groups can be exploited in a single parallel implementation. The parallel programming model is appropriate for grid based applications with computations and dependence pattern mainly aligned in horizontal or vertical directions. ...
متن کاملParameterless Optimal Approximate Message Passing
Iterative thresholding algorithms are well-suited for high-dimensional problems in sparse recovery and compressive sensing. The performance of this class of algorithms depends heavily on the tuning of certain threshold parameters. In particular, both the final reconstruction error and the convergence rate of the algorithm crucially rely on how the threshold parameter is set at each step of the ...
متن کاملBilinear Generalized Approximate Message Passing
We extend the generalized approximate message passing (G-AMP) approach, originally proposed for highdimensional generalized-linear regression in the context of compressive sensing, to the generalized-bilinear case, which enables its application to matrix completion, robust PCA, dictionary learning, and related matrix-factorization problems. In the first part of the paper, we derive our Bilinear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3311408