Pith. sign in

REVIEW 3 major objections 6 minor 30 references

Deep Unfolding of Fixed-Point Based Algorithm for Weighted Sum Rate Maximization

T0 review · 3 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Under log-concavity, a closed-form power update provably converges, and a deep-unfolded version matches FPLinQ in eight iterations.

desk verdict False monotonicity lemma sinks the convergence proof, but the deep-unfolded method and experiments may be worth salvaging. read the letter →

arxiv 2501.12148 v2 pith:M4ALSSAA submitted 2025-01-21 cs.IT math.IT

Jan Christian Hauffen , Chee Wei Tan , Giuseppe Caire This is my paper · ORCID
classification cs.ITmath.IT
keywords weightedsumrateinterferencefunctionlog-concavityfixed-pointalgorithmdeepunfoldingprimal-dualpowercontroldifference-of-convexprogramming
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper attacks the non-convex weighted sum rate (WSR) maximization problem in Gaussian interference channels. It claims that when the interference function is log-concave and its gradient is scale invariant, a closed-form fixed-point update rule derived from difference-of-convex programming is a standard feasible interference function in Yates' sense, so the iteration provably converges. Building on this, the authors propose a primal-dual algorithm and then a deep-unfolded version (LPDA) that runs only eight iterations. Numerical experiments on device-to-device networks suggest LPDA matches the FPLinQ benchmark while converging faster. If the theoretical claim holds, it gives a broader class of interference models, beyond the usual affine linear one, for which WSR maximization has a provably convergent fixed-point algorithm.

What carries the argument

The load-bearing object is the closed-form update (12), obtained by solving the first-order optimality conditions of the difference-of-convex subproblem. The proof checks that this update satisfies the three defining properties of a Yates standard interference function (positivity, scalability, monotonicity) under log-concavity and scale invariance of $\nabla I$. Monotonicity is established via the paper's Lemma 1, which asserts that log-concavity forces the log-gradient map to be componentwise monotone; scalability uses scale invariance of the gradient and the standard property $\alpha I(p) > I(\alpha p)$. The deep-unfolded LPDA replaces the inner primal-dual $q$-update with a fully connected neural network, leaving the $p$-update as the provably convergent interference-function iteration.

What would settle it

Check Lemma 1 on $f(x,y)=e^{-(x-y)^2}$, which is log-concave. At $p=(3,2)$ and $p'=(1,1)$, $p \geq p'$ componentwise, but the second entry of $\nabla \log f$ is $2$ at $p$ and $0$ at $p'$, so the componentwise monotonicity asserted in Lemma 1 fails; this would invalidate the monotonicity proof of update (12).

Watch

Extended reading notes

Core claim

The central claim is Theorem 1: for any standard, feasible interference function whose components are log-concave and whose gradients are scale invariant, the update rule (12), $p_i = \min\left\{ w_i \left[ \sum_j w_j \frac{\nabla_p I_j(p)_i}{I_j(p)} \right]^{-1}, P_{\max} \right\}$, is itself a standard and feasible interference function. Hence the fixed-point iteration $p^{(k+1)} = \text{update}(p^{(k)})$ converges to a fixed point that corresponds to a stationary point of the approximating WSR problem. This extends a known fixed-point algorithm for affine linear interference to arbitrary log-concave interference functions.

Load-bearing premise

The argument rests on the claim that log-concavity forces each ratio $\nabla_p I_j(p)_i / I_j(p)$ to decrease when any entry of $p$ increases; if that specific step fails, the standard-interference-function guarantee is not established.

Editorial extensions

If this is right

  • For affine linear interference, the algorithm reduces to a known fixed-point power control method, now subsumed as a special case.
  • For a wider class of log-concave interference models, including the concave example in (13), WSR maximization gets a provably convergent fixed-point algorithm.
  • The deep-unfolded LPDA achieves benchmark-level WSR with only 8 iterations, making it suitable for fast, scalable resource allocation.
  • Because the $p$-update is an interference function, standard convergence and feasibility results for power control apply directly to the learned algorithm's architecture.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The fixed-point framework could extend to other nonconvex problems expressible as a difference of log-concave functions, not just WSR.
  • End-to-end training with the WSR objective as the loss suggests a general recipe: unfold any provably convergent interference-function iteration and train only the auxiliary updates.
  • The reported performance above 100% on random weights hints that LPDA exploits the training distribution, so testing on truly unseen weight distributions is a natural next step.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper proposes a deep-unfolding-based primal-dual algorithm (LPDA) for weighted sum rate (WSR) maximization in Gaussian interference channels. The theoretical part derives a closed-form fixed-point update from a difference-of-convex (DCA/CCCP) reformulation and claims that, under log-concavity and gradient scale-invariance of the interference function, the update is a Yates standard and feasible interference function, hence the fixed-point iteration converges. The algorithmic part introduces a learned primal-dual method with a neural-network q-update and reports numerical experiments on a D2D network model showing competitive performance with FPLinQ in about 8 iterations.

Significance. If the theoretical claim were valid, the paper would extend the standard interference function framework to a broader class of log-concave interference functions and provide a principled justification for a practical deep-unfolding algorithm. The numerical results are a genuine strength: the LPDA achieves roughly 101% of the FPLinQ objective on unseen networks with only 8 iterations when trained on random weights, and the experimental setup is described in enough detail to be reproduced. However, the central theoretical guarantee rests on a false lemma, so the advertised convergence result is not established. Since the theory is a major advertised contribution, the paper cannot be accepted in its current form.

major comments (3)
  1. [Appendix, Lemma 1] Lemma 1 is false as stated. The negative semidefiniteness of the Hessian of log f implies only the inner-product inequality (∇ log f(x) − ∇ log f(x′))T(x − x′) ≤ 0 for all x, x′, which does not imply the componentwise inequality claimed in the lemma for x ≥ x′. A concrete counterexample is f(x,y) = e^{-(x-y)^2}, which is log-concave. For x = (3,0) and x′ = (2,0), ∇ log f(x) = (−6,6) and ∇ log f(x′) = (−4,4), so the second component violates the claimed inequality (6 ≤ 4 is false). This lemma is the basis for the monotonicity proof of the candidate interference function in (21) via equations (22)–(25). Without monotonicity, the function in (21) is not a standard interference function, and the convergence guarantee from Theorem 2 of [28] cannot be invoked.
  2. [Appendix, proof of Theorem 1, Feasibility] The feasibility part of the proof is circular. It uses convergence of the CCCP/DCA update (11) to assert the existence of a fixed point p̃ ≥ Ĩ(p̃), but (12) is exactly the closed-form solution of (11), so this argument assumes the convergence that Theorem 1 is meant to establish. The manuscript states in Section III-A that iteration (11) 'is guaranteed to converge to a stable point of (10)' if I_i is log-concave, but no proof or appropriate reference is supplied; the cited Theorem 2 of [30] concerns CCCP convergence under conditions that are not verified here. Thus the feasibility of the interference function in (21) is not independently established.
  3. [Section III-B, Eq. (19) and Algorithm 1] The paper applies Theorem 1 to the primal-dual update (19), but the proof in the appendix only treats the function (21). Equation (19) contains an additional term −q_i γ_i(q)^{-1} and a denominator perturbation λ_i, and the statement that 'the right hand side is again a standard and feasible interference function' if λ and q are constant is asserted without proof. Furthermore, the right-hand side of (19) is evaluated at the outer iterate p^{(k)} and q, not as a function of the current variable p in the manner of (21), so the fixed-point interpretation used in Algorithm 1 is not the same as the one analyzed in Theorem 1. A separate, precise proof of the fixed-point property of (19) is needed.
minor comments (6)
  1. [Section I] There is a typo: 'opitmization' should be 'optimization'.
  2. [Appendix, proof of Lemma 1] There is a typo: 'follwing' should be 'following'. The displayed equivalence arrows in (22)–(25) are not true bi-implications as typeset and should be replaced by directional implications or inequalities.
  3. [Theorem 1 statement] The scale-invariance condition is imprecise: the phrase 'scale invariant as a function in q' is ambiguous. The proof uses the explicit condition ∇p I_i(αq) = ∇p I_i(q) for all α > 0 and q, which should be stated in the theorem.
  4. [Algorithm 1] Line 3 of Algorithm 1 is difficult to parse; the formula for p^{(k+1)}_i, including the term −q_i^{(k)} γ(q^{(k)})^{-1}_i and the min with Pmax, should be written more clearly and connected to equation (19).
  5. [Section V, Table II] The metric (20) is relative to FPLinQ after 100 iterations; values above 100% indicate the LPDA's output is on average slightly better than the benchmark on the test set, but the text says 'same performance.' This should be clarified to avoid overstatement.
  6. [Section IV-B] The training section does not specify the number of training epochs, batch size, or the schedule of the decreasing learning rate; adding these details would improve reproducibility.

Circularity Check

1 steps flagged · score 6.0 of 10

Theorem 1's convergence guarantee reduces to the assumed convergence of (11): (12) is the closed form of (11), and the feasibility proof invokes CCCP convergence of (11) to exhibit the fixed point.

  1. self definitional [Section III-A (derivation of (12) from (11)); Appendix A, Feasibility paragraph]
    "By isolating p(k+1) in (11), one can obtain closed update rule ... (12) ... Since we assume, that Ij(·) is log-concave for every i it is known from the CCCP framework, that (11) converges to an optimum or saddle-point of (10), see Theorem 2 [30]. This means there exists some ˜p s.t. ˜pi = min{˜Ii(˜p), Pmax} and therefore ˜p ≥ ˜I(˜p)."

    Equation (12) is obtained from (11) by algebra, so the iterates generated by (12) are exactly the DCA/CCCP iterates of (11). To prove that the right-hand side of (12) is a feasible interference function, the appendix invokes the CCCP convergence of (11) to assert existence of a fixed point. Thus the feasibility premise needed for the Yates convergence theorem is supplied by the very convergence result that Theorem 1 is supposed to establish for (12). The claimed convergence guarantee reduces by construction to the statement 'if (11) converges then (12) converges', which is a tautology given that (12) is the closed-form of (11).

full rationale

The numerical comparison of LPDA against FPLinQ is run on 500 unseen networks and is not circular. The circularity is confined to the theoretical derivation. The paper defines (12) as the closed-form solution of the first-order conditions (11), then proves Theorem 1 by showing ilde I is standard and feasible. The scalability and positivity parts are independent, and monotonicity relies on Lemma 1, but that lemma is mathematically false (log-concavity gives only an inner-product inequality, not componentwise monotonicity); this is a correctness defect rather than circularity and does not by itself raise the circularity score. The feasibility part, however, explicitly uses the CCCP convergence of (11) to produce the required fixed point, so the theorem's convergence conclusion is obtained by assuming convergence of the equivalent iteration. This makes the central theoretical guarantee partially circular by construction, while the empirical deep-unfolding results remain independent evidence for the method's practical value.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The paper's theory rests on log-concavity, gradient scale-invariance, and a false lemma about log-concave functions; no new physical entities are introduced. The numerical method depends on a large set of trained FCNN parameters and trainable step sizes.

free parameters (2)
  • FCNN weights Theta = not reported
    All weights of the 7-layer FCNN that replaces the q-update (18b); trained via ADAM on random D2D networks to maximize the WSR objective. Layer sizes are 154, 132, 110, 88, 66, 44 hidden neurons.
  • step sizes alpha^(k) = not reported
    Included in the trainable set at Section IV-B and learned end-to-end for N=8 iterations.
assumptions (5)
  • domain assumption I is a standard interference function (positivity, scalability, monotonicity)
    Definition 1, Section II-A; all theoretical results build on Yates' framework.
  • domain assumption Each I_i is log-concave
    Assumed in Section III-A and Theorem 1; used to apply DCA and the flawed Lemma 1.
  • domain assumption Gradients of I_i are scale-invariant, nabla_p I_i(alpha q) = nabla_p I_i(q)
    Assumed in Theorem 1; verified for two examples but not generally true.
  • standard math CCCP/DCA update (11) converges to a stationary point of (10)
    Invoked in the appendix's feasibility proof via Theorem 2 of [30]; using this to prove convergence of (12) is circular.
  • ad hoc to paper Lemma 1: log-concavity implies componentwise monotonicity of nabla log f
    Stated and 'proved' in the appendix; the proof is invalid and the statement is false, yet it is the key to the monotonicity of the operator in (21).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Deep Unfolding of Fixed-Point Based Algorithm for Weighted Sum Rate Maximization." pith.science (2026). https://pith.science/paper/M4ALSSAA

@misc{pith2026250112148,
  author       = {Pith},
  title        = {Pith review of: Deep Unfolding of Fixed-Point Based Algorithm for Weighted Sum Rate Maximization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/M4ALSSAA}},
  note         = {Machine review of arXiv:2501.12148}
}
read the original abstract

In this paper, we propose a novel approach that harnesses the standard interference function, specifically tailored to address the unique challenges of non-convex optimization in wireless networks. We begin by establishing theoretical guarantees for our method under the assumption that the interference function exhibits log-concavity. Building on this foundation, we develop a Primal-Dual Algorithm (PDA) to approximate the solution to the Weighted Sum Rate (WSR) maximization problem. To further enhance computational efficiency, we leverage the deep unfolding technique, significantly reducing the complexity of the proposed algorithm. Through numerical experiments, we demonstrate the competitiveness of our method compared to the state-of-the-art fractional programming benchmark, commonly referred to as FPLinQ.

Figures

Figures reproduced from arXiv: 2501.12148 by the authors.

Figure 1
Figure 1. Mean WSR versus iterations of the benchmark FPLinQ and the trained [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 27 canonical work pages

  1. [28]

    R. D. Yates. A framework for uplink power control in cellular radio systems. IEEE Journal on selected areas in communications , 13(7):1341–1347, 1995

    work page 1995

  2. [30]

    A. L. Yuille and A. Rangarajan. The concave-convex procedure (cccp). Advances in neural information processing systems , 14, 2001. APPENDIX A. Proof of Theorem 1 As a first step to the main result a general property of log-concave functions is stated. Lemma 1. Let f : Ω 7→ R be a non-negative and log-concave function, where Ω ⊂ RK + a convex subset, then ...

    work page 2001

  3. [1]

    Al-Shatri and T

    H. Al-Shatri and T. Weber. Achieving the maximum sum rate using dc programming in cellular networks. IEEE Transactions on signal processing, 60(3):1331–1341, 2011

    work page 2011

  4. [2]

    W. Cui, K. Shen, and W. Yu. Spatial Deep Learning for Wireless Scheduling. IEEE Journal on Selected Areas in Communications , 37(6):1248–1261, June 2019. arXiv: 1808.01486

    work page Pith review arXiv 2019

  5. [3]

    Dahrouj, W

    H. Dahrouj, W. Yu, and T. Tang. Power spectrum optimization for interference mitigation via iterative function evaluation. EURASIP Journal on Wireless Communications and Networking, 2012:1–14, 2012

    work page 2012

  6. [4]

    H. R. Feyzmahdavian, M. Johansson, and T. Charalambous. Contractive interference functions and rates of convergence of distributed power con- trol laws. In 2012 IEEE International Conference on Communications (ICC), pages 4395–4399, Ottawa, ON, Canada, 2012

    work page 2012

  7. [5]

    C. Geng, N. Naderializadeh, A. S. Avestimehr, and S. A. Jafar. On the Optimality of Treating Interference as Noise. IEEE Transactions on Information Theory, 61(4):1753–1767, Apr. 2015

    work page 2015

  8. [6]

    Gregor and Y

    K. Gregor and Y . LeCun. Learning fast approximations of sparse coding. In Proceedings of the 27th international conference on international conference on machine learning , pages 399–406, 2010

    work page 2010

Show all 30 references
  1. [7]

    D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 , 2014

    2014 arXiv

  2. [8]

    Lanckriet and B

    G. Lanckriet and B. K. Sriperumbudur. On the convergence of the concave-convex procedure. Advances in neural information processing systems, 22, 2009

    2009

  3. [9]

    H. A. Le Thi and T. Pham Dinh. Dc programming and dca: thirty years of developments. Mathematical Programming, 169(1):5–68, 2018

    2018

  4. [10]

    M. Lee, G. Yu, and G. Y . Li. Graph Embedding based Wireless Link Scheduling with Few Training Samples. arXiv:1906.02871 [cs, eess] , Nov. 2020. arXiv: 1906.02871

    1906 arXiv

  5. [11]

    W. Lee, M. Kim, and D.-H. Cho. Deep learning based transmit power control in underlaid device-to-device communication. IEEE Systems Journal, 13(3):2551–2554, 2018

    2018

  6. [12]

    B. Li, G. Verma, and S. Segarra. Graph-based Algorithm Un- folding for Energy-aware Power Allocation in Wireless Networks. arXiv:2201.11799 [cs, eess] , Jan. 2022. arXiv: 2201.11799

    2022 arXiv

  7. [13]

    Lipp and S

    T. Lipp and S. Boyd. Variations and extension of the convex–concave procedure. Optim Eng, 17:263–287, 2016

    2016

  8. [14]

    Naderializadeh and A

    N. Naderializadeh and A. S. Avestimehr. ITLinQ: A New Approach for Spectrum Sharing in Device-to-Device Communication Systems. arXiv:1311.5527 [cs, math] , June 2014. arXiv: 1311.5527

    2014 arXiv

  9. [15]

    Papandriopoulos, J

    J. Papandriopoulos, J. Evans, and S. Dey. Optimal power control for rayleigh-faded multiuser systems with outage constraints. IEEE Transactions on Wireless Communications , 4(6):2705–2715, 2005

    2005

  10. [16]

    Shelim and A

    R. Shelim and A. S. Ibrahim. Geometric Machine Learning Over Riemannian Manifolds for Wireless Link Scheduling. IEEE Access , 10:22854–22864, 2022. Conference Name: IEEE Access

    2022

  11. [17]

    Shen and W

    K. Shen and W. Yu. FPLinQ: A cooperative spectrum sharing strategy for device-to-device communications. In 2017 IEEE International Symposium on Information Theory (ISIT) , pages 2323–2327, Aachen, Germany, June 2017. IEEE

    2017

  12. [18]

    Shen and W

    K. Shen and W. Yu. Fractional Programming for Communication Systems—Part I: Power Control and Beamforming. IEEE Transactions on Signal Processing , 66(10):2616–2630, May 2018

    2018

  13. [19]

    Shen and W

    K. Shen and W. Yu. Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching. IEEE Transactions on Signal Processing , 66(10):2631–2644, May 2018

    2018

  14. [20]

    X. Shen, S. Diamond, Y . Gu, and S. Boyd. Disciplined convex- concave programming. In Proceedings IEEE Conference on Decision and Control, pages 1009–1014, December 2016

    2016

  15. [21]

    Y . Sun, P. Babu, and D. P. Palomar. Majorization-minimization al- gorithms in signal processing, communications, and machine learning. IEEE Transactions on Signal Processing , 65(3):794–816, 2016

    2016

  16. [22]

    C. W. Tan. Optimal power control in rayleigh-fading heterogeneous wireless networks. IEEE/ACM Transactions on Networking, 24(2):940– 953, 2015

    2015

  17. [23]

    C. W. Tan, M. Chiang, and R. Srikant. Fast algorithms and performance bounds for sum rate maximization in wireless networks. IEEE/ACM Transactions on Networking , 21(3):706–719, 2012

    2012

  18. [24]

    P. D. Tao and E. B. Souad. Algorithms for solving a class of nonconvex optimization problems. methods of subgradients. In North-Holland Mathematics Studies, volume 129, pages 249–271. Elsevier, 1986

    1986

  19. [25]

    Vucic, S

    N. Vucic, S. Shi, and M. Schubert. Dc programming approach for resource allocation in wireless networks. In 8th international symposium on modeling and optimization in mobile, ad hoc, and wireless networks , pages 380–386. IEEE, 2010

    2010

  20. [26]

    X. Wu, S. Tavildar, S. Shakkottai, T. Richardson, J. Li, R. Laroia, and A. Jovicic. Flashlinq: A synchronous distributed scheduler for peer-to-peer ad hoc networks. IEEE/ACM Transactions on Networking , 21(4):1215–1228, 2013

    2013

  21. [27]

    Yao and X

    C. Yao and X. Jiang. A globally convergent difference-of-convex algorithmic framework and application to log-determinant optimization problems. arXiv preprint arXiv:2306.02001 , 2023

    2023 arXiv

  22. [29]

    Yi and G

    X. Yi and G. Caire. Optimality of Treating Interference as Noise: A Combinatorial Perspective. arXiv:1504.00041 [cs, math] , Sept. 2015. arXiv: 1504.00041

    2015 arXiv

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.