Fetching the paper…
Reading the bibliography…
This paper proposes Bayes-optimal convolutional approximate message-passing (CAMP) for signal recovery in compressed sensing.
A. Rényi, “On the dimension and entropy of probability distributions,” Acta Math. Acad. Sci. Hung. , vol. 10, no. 1–2, pp. 193–215, Mar. 1959
1959
Earlier work this paper cites.
1972
Earlier work this paper cites.
L. R. Welch, “Lower bounds on the maximum cross correlation of signals,” IEEE Trans. Inf. Theory , vol. 20, no. 3, pp. 397–399, May 1974
1974
Earlier work this paper cites.
D. Sherrington and S. Kirkpatrick, “Solvable model of a spin-glass,” Phys. Rev. Lett. , vol. 35, no. 26, pp. 1792–1796, Dec. 1975
1975
Earlier work this paper cites.
D. J. Thouless, P. W. Anderson, and R. G. Palmer, “Solution of ‘solvable model of a spin glass’,” Philos. Mag. , vol. 35, no. 3, pp. 593–601, 1977
1977
Earlier work this paper cites.
Mézard, G. Parisi, and M. A. Virasoro, Spin Glass Theory and Beyond . Singapore: World Scientific, 1987
1987
Earlier work this paper cites.
M. Rupf and J. L. Massey, “Optimum sequence multisets for synchronous code-division multiple-access channels,” IEEE Trans. Inf. Theory , vol. 40, no. 4, pp. 1261–1266, Jul. 1994
1994
Earlier work this paper cites.
F. Hiai and D. Petz, The Semicircle Law, Free Random Variables and Entropy . Providence, RI, USA: Amer. Math. Soc., 2000
2000
Earlier work this paper cites.
H. Nishimori, Statistical Physics of Spin Glasses and Information Processing . New York: Oxford University Press, 2001
2001
Earlier work this paper cites.
T. P. Minka, “Expectation propagation for approximate Bayesian inference,” in Proc. 17th Conf. Uncertainty Artif. Intell. , Seattle, WA, USA, Aug. 2001, pp. 362–369
2001
Earlier work this paper cites.
——, “Adaptive and self-averaging Thouless-Anderson-Palmer mean-field theory for probabilistic modeling,” Phys. Rev. E , vol. 64, no. 5, pp. 056 131–1–14, Nov. 2001
2001
Earlier work this paper cites.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors,” IEEE Trans. Inf. Theory , vol. 48, no. 11, pp. 2888–2910, Nov. 2002
2002
Earlier work this paper cites.
Y. Kabashima, “A CDMA multiuser detection algorithm on the basis of belief propagation,” J. Phys. A: Math. Gen. , vol. 36, no. 43, pp. 11 111–11 121, Oct. 2003
2003
Earlier work this paper cites.
A. M. Tulino and S. Verdú, Random Matrix Theory and Wireless Communications . Hanover, MA USA: Now Publishers Inc., 2004
2004
Earlier work this paper cites.
E. J. Candes and T. Tao, “Decoding by linear programming,” IEEE Trans. Inf. Theory , vol. 51, no. 12, pp. 4203–4215, Dec. 2005
2005
Earlier work this paper cites.
D. Guo and S. Verdú, “Randomly spread CDMA: Asymptotics via statistical physics,” IEEE Trans. Inf. Theory , vol. 51, no. 6, pp. 1983–2010, Jun. 2005
2005
Earlier work this paper cites.
D. N. C. Tse and P. Viswanath, Fundamentals of Wireless Communication . Cambridge, UK: Cambridge University Press, 2005
2005
Earlier work this paper cites.
A. Goldsmith, Wireless Communications . New York: Cambridge University Press, 2005
2005
Earlier work this paper cites.
M. Opper and O. Winther, “Expectation consistent approximate inference,” J. Mach. Learn. Res. , vol. 6, pp. 2177–2204, Dec. 2005
2005
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory , vol. 52, no. 4, pp. 1289–1306, Apr. 2006
2006
Earlier work this paper cites.
E. J. Candés, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006
2006
Earlier work this paper cites.
——, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Inf. Theory , vol. 52, no. 12, pp. 5406–5425, Dec. 2006
2006
Cited alongside, same era.
K. Takeda, S. Uda, and Y. Kabashima, “Analysis of CDMA systems that are characterized by eigenvalue spectrum,” Europhys. Lett. , vol. 76, no. 6, pp. 1193–1199, 2006
2006
Cited alongside, same era.
T. Richardson and R. Urbanke, Modern Coding Theory . New York: Cambridge University Press, 2008
2008
Cited alongside, same era.
2008
Cited alongside, same era.
K. Takeuchi, “Bayes-optimal convolutional AMP,” submitted to 2021 IEEE Int. Symp. Inf. Theory
G. Reeves and H. D. Pfister, “The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact,” in Proc. 2016 IEEE Int. Symp. Inf. Theory , Barcelona, Spain, Jul. 2016, pp. 665–669
2016
Later among the works it cites.
J. Barbier, M. Dia, N. Macris, and F. Krzakala, “The mutual information in random linear estimation,” in Proc. 54th Annual Allerton Conf. Commun. Control & Computing , Urbana-Champaign, IL, USA, Sep. 2016, pp. 625–632
2016
Later among the works it cites.
M. Opper, B. Çakmak, and O. Winther, “A theory of solving TAP equations for Ising models with general invariant random matrices,” J. Phys. A: Math. Theor. , vol. 49, no. 11, p. 114002, Feb. 2016
2016
Later among the works it cites.
J. Ma and L. Ping, “Orthogonal AMP,” IEEE Access , vol. 5, pp. 2020–2033, Jan. 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, Nov. 2009
2009
Cited alongside, same era.
Y. Wu and S. Verdú, “Rényi information dimension: Fundamental limits of almost lossless analog compression,” IEEE Trans. Inf. Theory , vol. 56, no. 8, pp. 3721–3748, Aug. 2010
2010
Cited alongside, same era.
K. Kitagawa and T. Tanaka, “Optimization of sequences in CDMA systems: A statistical-mechanics approach,” Comput. Netw. , vol. 54, no. 6, pp. 917–924, Apr. 2010
2010
Cited alongside, same era.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proc. 27th Int. Conf. Mach. Learn. , Haifa, Israel, Jun. 2010, pp. 399–406
2010
Cited alongside, same era.
Y. Wu and S. Verdú, “MMSE dimension,” IEEE Trans. Inf. Theory , vol. 57, no. 8, pp. 4857–4879, Aug. 2011
2011
Cited alongside, same era.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Trans. Inf. Theory , vol. 57, no. 2, pp. 764–785, Feb. 2011
2011
Cited alongside, same era.
S. Kudekar, T. Richardson, and R. Urbanke, “Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC,” IEEE Trans. Inf. Theory , vol. 57, no. 2, pp. 803–834, Feb. 2011
2011
Cited alongside, same era.
S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,” in Proc. 2017 IEEE Int. Symp. Inf. Theory , Aachen, Germany, Jun. 2017, pp. 1588–1592
2017
Later among the works it cites.
K. Takeuchi, “Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements,” in Proc. 2017 IEEE Int. Symp. Inf. Theory , Aachen, Germany, Jun. 2017, pp. 501–505
2017
Later among the works it cites.
K. Takeuchi and C.-K. Wen, “Rigorous dynamics of expectation-propagation signal detection via the conjugate gradient method,” in Proc. 18th IEEE Int. Workshop Sig. Process. Advances Wirel. Commun. , Sapporo, Japan, Jul. 2017, pp. 88–92
2017
Later among the works it cites.
M. Borgerding, P. Schniter, and S. Rangan, “AMP-inspired deep networks for sparse linear inverse problems,” IEEE Trans. Signal Process. , vol. 65, no. 16, pp. 4293–4308, Aug. 2017
2017
Later among the works it cites.
J. Barbier, N. Macris, A. Maillard, and F. Krzakala, “The mutual information in random linear estimation beyond i.i.d. matrices,” in Proc. 2018 IEEE Int. Symp. Inf. Theory , Vail, CO, USA, Jun. 2018, pp. 1390–1394
2018
Later among the works it cites.
——, “The replica-symmetric prediction for random linear estimation with Gaussian matrices is exact,” IEEE Trans. Inf. Theory , vol. 65, no. 4, pp. 2252–2283, Apr. 2019
2019
Later among the works it cites.
J. Barbier and N. Macris, “The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference,” Probab. Theory Relat. Fields , vol. 174, no. 3–4, pp. 1133–1185, Aug. 2019
2019
Later among the works it cites.
S. Rangan, P. Schniter, A. Fletcher, and S. Sarkar, “On the convergence of approximate message passing with arbitrary matrices,” IEEE Trans. Inf. Theory , vol. 65, no. 9, pp. 5339–5351, Sep. 2019
2019
Later among the works it cites.
——, “Vector approximate message passing,” IEEE Trans. Inf. Theory , vol. 65, no. 10, pp. 6664–6684, Oct. 2019
2019
Later among the works it cites.
K. Takeuchi, “A unified framework of state evolution for message-passing algorithms,” in Proc. 2019 IEEE Int. Symp. Inf. Theory , Paris, France, Jul. 2019, pp. 151–155
2019
Later among the works it cites.
R. Berthier, A. Montanari, and P.-M. Nguyen, “State evolution for approximate message passing with non-separable functions,” Inf. Inference: A Journal of the IMA , 2019, doi:10.1093/imaiai/iay021
2019
Later among the works it cites.
Y. Ma, C. Rush, and D. Baron, “Analysis of approximate message passing with non-separable denoisers and Markov random field priors,” IEEE Trans. Inf. Theory , vol. 65, no. 11, pp. 7367–7389, Nov. 2019
2019
Later among the works it cites.
A. K. Fletcher, P. Pandit, S. Rangan, S. Sarkar, and P. Schniter, “Plug-in estimation in high-dimensional linear inverse problems a rigorous analysis,” J. Stat. Mech.: Theory Exp. , vol. 2019, pp. 124 021–1–15, Dec. 2019
2019
Later among the works it cites.
——, “Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements,” IEEE Trans. Inf. Theory , vol. 66, no. 1, pp. 368–386, Jan. 2020
2020
Closest in time.
K. Takeuchi, “Convolutional approximate message-passing,” IEEE Signal Process. Lett. , vol. 27, pp. 416–420, 2020
2020
Closest in time.
W. Tatsuno and K. Takeuchi, “Pilot decontamination in spatially correlated massive MIMO uplink via expectation propagation,” IEICE Trans. Fundamentals. , vol. E104-A, no. 4, Apr. 2021
2021
Closest in time.