Proximal Gradient-Based Unfolding for Massive Random Access in IoT Networks
Pages 14530 - 14545
Abstract
Grant-free random access is an effective technology for enabling low-overhead and low-latency massive access, where joint activity detection and channel estimation (JADCE) is a critical issue. Although existing compressed sensing algorithms can be applied for JADCE, they usually fail to simultaneously harvest the following properties: effective sparsity inducing, fast convergence, robust to different pilot sequences, and adaptive to time-varying networks. To this end, we propose an unfolding framework for JADCE based on the proximal gradient method. Specifically, we formulate the JADCE problem as a group-row-sparse matrix recovery problem and leverage a minimax concave penalty rather than the widely-used <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math></inline-formula>-norm to induce sparsity. We then develop a proximal gradient-based unfolding neural network that parameterizes the algorithmic iterations. To improve convergence rate, we incorporate momentum into the unfolding neural network, and prove the accelerated convergence theoretically. Based on the convergence analysis, we further develop an adaptive-tuning algorithm, which adjusts its parameters to different signal-to-noise ratio settings. Simulations show that the proposed unfolding neural network achieves better recovery performance, convergence rate, and adaptivity than current baselines.
References
[1]
Y. Zou, Y. Zhou, Y. Shi, and X. Chen, “Learning proximal operator methods for massive connectivity in IoT networks,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Dec. 2021, pp. 1–6.
[2]
K. Sharma and X. Wang, “Toward massive machine type communications in ultra-dense cellular IoT networks: Current issues and machine learning-assisted solutions,” IEEE Commun. Surveys Tuts., vol. 22, no. 1, pp. 426–471, 1st Quart., 2019.
[3]
L. Liu, E. G. Larsson, W. Yu, P. Popovski, C. Stefanovic, and E. de Carvalh, “Sparse signal processing for grant-free massive connectivity: A future paradigm for random access protocols in the Internet of Things,” IEEE Signal Process. Mag., vol. 35, no. 5, pp. 88–99, Sep. 2018.
[4]
Y. C. Eldar and G. Kutyniok, Compressed Sensing: Theory and Applications. Cambridge, U.K.: Cambridge Univ. Press, 2012.
[5]
Y. C. Eldar and M. Mishali, “Robust recovery of signals from a structured union of subspaces,” IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 5302–5316, Nov. 2009.
[6]
Y. C. Eldar, P. Kuppinger, and H. Bolcskei, “Block-sparse signals: Uncertainty relations and efficient recovery,” IEEE Trans. Signal Process., vol. 58, no. 6, pp. 3042–3054, Jun. 2010.
[7]
Z. Qin, K. Scheinberg, and D. Goldfarb, “Efficient block-coordinate descent algorithms for the group lasso,” Math. Program. Comput., vol. 5, no. 2, pp. 143–169, Jun. 2013.
[8]
M. Yuan and Y. Lin, “Model selection and estimation in regression with grouped variables,” J. Roy. Stat. Soc. B, Stat. Methodology, vol. 68, no. 1, pp. 49–67, Feb. 2006.
[9]
T. Jiang, Y. Shi, J. Zhang, and K. B. Letaief, “Joint activity detection and channel estimation for IoT networks: Phase transition and computation-estimation tradeoff,” IEEE Internet Things J., vol. 6, no. 4, pp. 6212–6225, Aug. 2019.
[10]
X. Shao, X. Chen, and R. Jia, “A dimension reduction-based joint activity detection and channel estimation algorithm for massive access,” IEEE Trans. Signal Process., vol. 68, no. 2, pp. 420–435, Dec. 2019.
[11]
X. Shao, X. Chen, C. Zhong, and Z. Zhang, “Exploiting simultaneous low-rank and sparsity in delay-angular domain for millimeter-wave/terahertz wideband massive access,” IEEE Trans. Wireless Commun., vol. 21, no. 4, pp. 2336–2351, Apr. 2022.
[12]
Q. He, T. Q. S. Quek, Z. Chen, Q. Zhang, and S. Li, “Compressive channel estimation and multi-user detection in C-RAN with low-complexity methods,” IEEE Trans. Wireless Commun., vol. 17, no. 6, pp. 3931–3944, Jun. 2018.
[13]
L. Liu and W. Yu, “Massive connectivity with massive MIMO—Part I: Device activity detection and channel estimation,” IEEE Trans. Signal Process., vol. 66, no. 11, pp. 2933–2946, Jun. 2018.
[14]
Z. Chen, F. Sohrabi, and W. Yu, “Multi-cell sparse activity detection for massive random access: Massive MIMO versus cooperative MIMO,” IEEE Trans. Wireless Commun., vol. 18, no. 8, pp. 4060–4074, Aug. 2019.
[15]
S. Xia, Y. Shi, Y. Zhou, and X. Yuan, “Reconfigurable intelligent surface for massive connectivity: Joint activity detection and channel estimation,” IEEE Trans. Signal Process., vol. 69, pp. 5693–5707, 2021.
[16]
S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,” IEEE Trans. Inf. Theory, vol. 65, no. 10, pp. 6664–6684, Oct. 2019.
[17]
S. Rangan, P. Schniter, A. K. 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.
[18]
Y. C. Eldar, A. Goldsmith, D. Gündüz, and H. V. Poor, Machine Learning and Wireless Communications. Cambridge, U.K.: Cambridge Univ. Press, 2022.
[19]
V. Monga, Y. Li, and Y. C. Eldar, “Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing,” IEEE Signal Process. Mag., vol. 38, no. 2, pp. 18–44, Mar. 2021.
[20]
J. Scarlett, R. Heckel, M. R. D. Rodrigues, P. Hand, and Y. C. Eldar, “Theoretical perspectives on deep learning methods in inverse problems,” IEEE J. Sel. Areas Inf. Theory, vol. 3, no. 3, pp. 433–453, Sep. 2022.
[21]
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proc. 27th Int. Conf. Mach. Learn. (ICML), Jun. 2010, pp. 399–406.
[22]
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.
[23]
X. Chen, J. Liu, Z. Wang, and W. Yin, “Theoretical linear convergence of unfolded ISTA and its practical weights and thresholds,” in Proc. Adv. Neural Inf. Process. Syst. (NIPS), 2018, pp. 9061–9071.
[24]
J. Liu, X. Chen, Z. Wang, and W. Yin, “ALISTA: Analytic weights are as good as learned weights in LISTA,” in Proc. Int. Conf. Learn. Represent. (ICLR), 2019, pp. 1–33.
[25]
Y. Shi, H. Choi, Y. Shi, and Y. Zhou, “Algorithm unrolling for massive access via deep neural networks with theoretical guarantee,” IEEE Trans. Wireless Commun., vol. 21, no. 2, pp. 945–959, Feb. 2022.
[26]
Y. Cui, S. Li, and W. Zhang, “Jointly sparse signal recovery and support recovery via deep learning with applications in MIMO-based grant-free random access,” IEEE J. Sel. Areas Commun., vol. 39, no. 3, pp. 788–803, Mar. 2021.
[27]
J. Johnston and X. Wang, “Model-based deep learning for joint activity detection and channel estimation in massive and sporadic connectivity,” IEEE Trans. Wireless Commun., vol. 21, no. 11, pp. 9806–9817, Nov. 2022.
[28]
W. Zhu, M. Tao, X. Yuan, and Y. Guan, “Deep-learned approximate message passing for asynchronous massive connectivity,” IEEE Trans. Wireless Commun., vol. 20, no. 8, pp. 5434–5448, Aug. 2021.
[29]
C. Yang, Y. Gu, B. Chen, H. Ma, and H. C. So, “Learning proximal operator methods for nonconvex sparse recovery with theoretical guarantee,” IEEE Trans. Signal Process., vol. 68, pp. 5244–5259, 2020.
[30]
X. Shao, X. Chen, Y. Qiang, C. Zhong, and Z. Zhang, “Feature-aided adaptive-tuning deep learning for massive device detection,” IEEE J. Sel. Areas Commun., vol. 39, no. 7, pp. 1899–1914, Jul. 2021.
[31]
X. Chen, J. Liu, Z. Wang, and W. Yin, “Hyperparameter tuning is all you need for LISTA,” in Proc. Neural Inf. Process. Syst. (NeurIPS), vol. 34, 2021, pp. 11678–11689.
[32]
A. Rajoriya and R. Budhiraja, “Joint AMP-SBL algorithms for device activity detection and channel estimation in massive MIMO mMTC systems,” IEEE Trans. Commun., vol. 71, no. 4, pp. 2136–2152, Apr. 2023.
[33]
X. Shao, X. Chen, C. Zhong, J. Zhao, and Z. Zhang, “A unified design of massive access for cellular Internet of Things,” IEEE Internet Things J., vol. 6, no. 2, pp. 3934–3947, Apr. 2019.
[34]
L. Liu and W. Yu, “Massive connectivity with massive MIMO—Part II: Achievable rate characterization,” IEEE Trans. Signal Process., vol. 66, no. 11, pp. 2947–2959, Jun. 2018.
[35]
Z. Chen, F. Sohrabi, and W. Yu, “Sparse activity detection for massive connectivity,” IEEE Trans. Signal Process., vol. 66, no. 7, pp. 1890–1904, Apr. 2018.
[36]
Y. Jiang, J. Su, Y. Shi, and B. Houska, “Distributed optimization for massive connectivity,” IEEE Wireless Commun. Lett., vol. 9, no. 9, pp. 1412–1416, Sep. 2020.
[37]
C.-H. Zhang, “Nearly unbiased variable selection under minimax concave penalty,” Ann. Statist., vol. 38, no. 2, pp. 894–942, 2010.
[38]
P. Breheny and J. Huang, “Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors,” Statist. Comput., vol. 25, no. 2, pp. 173–187, Mar. 2015.
[39]
N. Parikh and S. Boyd, “Proximal algorithms,” Found. Trends Optim., vol. 1, no. 3, pp. 127–239, Nov. 2014.
[40]
A. Beck, First-order Methods in Optimization. Philadelphia, PA, USA: SIAM, 2017.
[41]
P. Breheny and J. Huang, “Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection,” Ann. Appl. Statist., vol. 5, no. 1, p. 232, Mar. 2011.
[42]
B. T. Polyak, “Some methods of speeding up the convergence of iteration methods,” USSR Comput. Math. Math. Phys., vol. 4, no. 5, pp. 1–17, Jan. 1964.
[43]
C. Lu, H. Li, and Z. Lin, “Optimized projections for compressed sensing via direct mutual coherence minimization,” Signal Process., vol. 151, pp. 45–55, Oct. 2018.
[44]
D. G. Luenberger and Y. Ye, Linear and Nonlinear Programming, vol. 2. New York, NY, USA: Springer, 1984.
[45]
D. Chu, “Polyphase codes with good periodic correlation properties (corresp.),” IEEE Trans. Inf. Theory, vol. IT-18, no. 4, pp. 531–532, Jul. 1972.
[46]
J. H. I. de Souza and T. Abrão, “Deep learning-based activity detection for grant-free random access,” IEEE Syst. J., vol. 17, no. 1, pp. 940–951, Mar. 2023.
[47]
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183–202, Jan. 2009.
[48]
C. Steffens, M. Pesavento, and M. E. Pfetsch, “A compact formulation for the ℓ 2,1 mixed-norm minimization problem,” IEEE Trans. Signal Process., vol. 66, no. 6, pp. 1483–1497, Mar. 2018.
[49]
G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD, USA: JHU Press, 2013.
Index Terms
- Proximal Gradient-Based Unfolding for Massive Random Access in IoT Networks
Index terms have been assigned to the content through auto-classification.
Recommendations
Decomposable norm minimization with proximal-gradient homotopy algorithm
We study the convergence rate of the proximal-gradient homotopy algorithm applied to norm-regularized linear least squares problems, for a general class of norms. The homotopy algorithm reduces the regularization parameter in a series of steps, and uses ...
Alternating Proximal Gradient Method for Convex Minimization
In this paper, we apply the idea of alternating proximal gradient to solve separable convex minimization problems with three or more blocks of variables linked by some linear constraints. The method proposed in this paper is to firstly group the ...
Smoothing proximal gradient method for general structured sparse learning
UAI'11: Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial IntelligenceWe study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input or output sides. We consider two widely adopted types of such penalties ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
1536-1276 © 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 25 June 2024
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in