Learning Proximal Operator Methods for Massive Connectivity in IoT Networks
Grant-free random access has the potential to support massive connectivity in Internet of Things (IoT) networks, where joint activity detection and channel estimation (JADCE) is a key issue that needs to be tackled. The existing methods for JADCE usually suffer from one of the following limitations: high computational complexity, ineffective in inducing sparsity, and incapable of handling complex matrix estimation. To mitigate all the aforementioned limitations, we in this paper develop an effective unfolding neural network framework built upon the proximal operator method to tackle the JADCE problem in IoT networks, where the base station is equipped with multiple antennas. Specifically, the JADCE problem is formulated as a group-sparse-matrix estimation problem, which is regularized by non-convex minimax concave penalty (MCP). This problem can be iteratively solved by using the proximal operator method, based on which we develop a unfolding neural network structure by parameterizing the algorithmic iterations. By further exploiting the coupling structure among the training parameters as well as the analytical computation, we develop two additional unfolding structures to reduce the training complexity. We prove that the proposed algorithm achieves a linear convergence rate. Results show that our proposed three unfolding structures not only achieve a faster convergence rate but also obtain a higher estimation accuracy than the baseline methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Action DetectionActivity DetectionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Trainable Proximal Gradient Descent Based Channel Estimation for mmWave Massive MIMO Systems
In this letter, we address the problem of millimeter-Wave channel estimation in massive MIMO communication systems. Leveraging the sparsity of the mmWave channel in the beamspace, we formulate the estimation problem as a…
Inexact Proximal Gradient Methods for Non-convex and Non-smooth Optimization
In machine learning research, the proximal gradient methods are popular for solving various optimization problems with non-smooth regularization. Inexact proximal gradient methods are extremely important when exactly sol…
BIG-bench Machine LearningLearning Proximal Operators to Discover Multiple Optima
Finding multiple solutions of non-convex optimization problems is a ubiquitous yet challenging task. Most past algorithms either apply single-solution optimization methods from multiple random initial guesses or search i…
object-detectionObject DetectionDeep learning methods for inverse problems using connections between proximal operators and Hamilton-Jacobi equations
Inverse problems are important mathematical problems that seek to recover model parameters from noisy data. Since inverse problems are often ill-posed, they require regularization or incorporation of prior information ab…
Closed-Form Approximation of the Total Variation Proximal Operator
Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems …
Computed Tomography (CT)DenoisingFormImage Denoising+1