A deep-unfolded primal-dual power control algorithm reaches about 101 percent of the FPLinQ benchmark in under 10 iterations, but its convergence theorem relies on a false monotonicity lemma.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Deep Unfolding of Fixed-Point Based Algorithm for Weighted Sum Rate Maximization
A deep-unfolded primal-dual power control algorithm reaches about 101 percent of the FPLinQ benchmark in under 10 iterations, but its convergence theorem relies on a false monotonicity lemma.