Pith. sign in

REVIEW 3 major objections 2 minor 30 references

CALO: Constraint-Aware Learning Optimization for Joint Resource Allocation in Double-Active RIS-Assisted Wireless Networks

T0 review · 3 major / 2 minor · reviewed 2026-07-01 · grok-4.3

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

Pith's one-line read CALO reformulates variables into grouped fractions and constraint-preserving maps to guarantee feasible real-time resource allocation in double-active RIS networks.

desk verdict CALO gives a feasible-by-construction learning method for double-active RIS allocation that runs fast, but the rate gains over BCD are not yet convincing because the training reference and the search space both need checking. read the letter →

arxiv 2606.30803 v1 pith:KQLR7S53 submitted 2026-06-29 cs.NI

Alaa S. Arabiyat , Mohammad J. Abdel-Rahman This is my paper
classification cs.NI
keywords double-activeRISresourceallocationconstraint-awarelearningreconfigurableintelligentsurfacesjointoptimizationwirelessnetworksmachine
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 introduces CALO to handle joint allocation of RIS placement, amplification power, and reflecting elements in networks using two active reconfigurable intelligent surfaces. It converts the mixed continuous-discrete problem into grouped fractional representations that are then mapped through transformations keeping all linear constraints satisfied by construction. A straight-through estimator handles discrete choices during training, and a regret-driven hinge loss uses block coordinate descent outputs as reference while pushing for better rates. This matters because the original problem is non-convex and slow to solve iteratively, whereas the learned model runs quickly and always returns valid allocations.

What carries the argument

Grouped fractional representations mapped via constraint-preserving transformations, paired with a regret-driven hinge objective and straight-through estimator for discrete assignments.

What would settle it

A mixed-integer global solver applied to the original problem formulation finds feasible allocations with strictly higher achievable rates than the trained CALO model in the same urban or rural test cases.

Watch

Extended reading notes

Core claim

CALO reformulates the decision variables into grouped fractional representations and maps them to physical resources through constraint-preserving transformations, ensuring that distance, power, and element-budget constraints are satisfied by construction. A straight-through estimator enables differentiable learning over discrete reflecting-element assignments, while a regret-driven hinge objective uses the BCD solution as a reference and encourages performance improvement beyond solver imitation. Simulation results show that CALO achieves 100% feasibility across all tested configurations, improves the achievable rate over BCD in both urban and rural scenarios, and reduces online inference t

Load-bearing premise

The block coordinate descent solutions used as training references are close enough to global optima that imitating and exceeding them yields allocations at least as good as direct solution methods could produce.

Editorial extensions

If this is right

  • Every output allocation satisfies the linear distance, power, and element constraints without post-processing or repair.
  • Computation moves to offline training, enabling orders-of-magnitude faster inference at deployment time.
  • Achievable rates exceed those obtained from block coordinate descent in both urban and rural propagation environments.
  • The same reformulation and loss structure applies to other coupled resource allocation problems mixing continuous and discrete variables.

Reading between the lines

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

  • The same constraint-preserving mapping technique could be tested on problems with more than two RIS units or with additional mobility constraints.
  • If the learned model generalizes across channel distributions, it could support online re-optimization when user locations or blockages change.
  • Replacing the BCD reference with a weaker but faster heuristic might still produce feasible solutions while cutting training cost.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 2 minor

Summary. The paper claims to introduce the CALO framework for joint resource allocation in double-active RIS-assisted wireless networks. It reformulates variables via grouped fractional representations and constraint-preserving transformations to enforce feasibility by construction, uses a straight-through estimator for discrete assignments, and trains via a regret-driven hinge objective that references BCD solutions to exceed baseline performance. Simulations report 100% feasibility, higher achievable rates than BCD in urban/rural scenarios, and orders-of-magnitude faster inference.

Significance. If the rate gains hold after verification, the work would advance structure-aware learning for real-time constrained optimization in wireless systems, where iterative solvers are impractical. The constraint-preserving transformations guaranteeing feasibility by construction are a clear methodological strength.

major comments (3)
  1. [Abstract and Simulation Results] Abstract and Simulation Results: the headline claims of rate improvement over BCD and 100% feasibility rest on unreported controls (no error bars, dataset details, or optimality verification for the transformations), which are load-bearing for the central performance assertions.
  2. [Method (regret-driven hinge objective)] Method (regret-driven hinge objective): the objective is defined relative to BCD solutions as reference, creating direct dependence on the iterative solver the method aims to replace; without evidence that BCD outputs are near-global optima, the reported rate gains may only indicate improvement over a local solution rather than true superiority.
  3. [Method (grouped fractional representations)] Method (grouped fractional representations): the reformulation and mapping ensure feasibility by construction, but no analysis confirms surjectivity onto the full feasible set, so the rate gains could be an artifact of a restricted search space rather than genuine optimization improvement.
minor comments (2)
  1. [Abstract] The abstract could more explicitly separate the feasibility guarantee (by construction) from the rate claims (which depend on unverified assumptions about BCD and the mapping).
  2. [Simulation results] Simulation results would be strengthened by reporting the number of Monte Carlo runs, random seeds, and standard deviations on the rate metrics.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments highlighting areas where additional rigor would strengthen the manuscript. We address each major comment below and will incorporate revisions to provide the requested controls, clarifications, and analyses.

read point-by-point responses

  1. Referee: [Abstract and Simulation Results] Abstract and Simulation Results: the headline claims of rate improvement over BCD and 100% feasibility rest on unreported controls (no error bars, dataset details, or optimality verification for the transformations), which are load-bearing for the central performance assertions.

    Authors: We agree that the simulation results require additional controls to support the central claims. In the revised manuscript we will add error bars from multiple independent runs with different random seeds, provide full details on the simulation datasets and parameters (including channel models, RIS configurations, and urban/rural scenarios), and include verification experiments showing that the constraint-preserving transformations can recover arbitrary feasible points. These changes will directly bolster the reported rate improvements and 100% feasibility results. revision: yes

  2. Referee: [Method (regret-driven hinge objective)] Method (regret-driven hinge objective): the objective is defined relative to BCD solutions as reference, creating direct dependence on the iterative solver the method aims to replace; without evidence that BCD outputs are near-global optima, the reported rate gains may only indicate improvement over a local solution rather than true superiority.

    Authors: The referee is correct that the regret-driven hinge loss is defined with respect to BCD outputs. We will revise the method section to explicitly note that BCD may converge only to local optima and to clarify that the performance gains are measured against this practical iterative baseline rather than a proven global optimum. The primary goal remains real-time feasible allocation that exceeds the solver it replaces; we will emphasize this distinction while retaining the hinge formulation. revision: partial

  3. Referee: [Method (grouped fractional representations)] Method (grouped fractional representations): the reformulation and mapping ensure feasibility by construction, but no analysis confirms surjectivity onto the full feasible set, so the rate gains could be an artifact of a restricted search space rather than genuine optimization improvement.

    Authors: We acknowledge the absence of an explicit surjectivity analysis. In the revision we will add a lemma or argument establishing that the grouped fractional representations and constraint-preserving mappings are surjective onto the full feasible set, by showing that any feasible allocation of distances, powers, and element assignments can be expressed in the fractional form and recovered exactly by the inverse mapping. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity detected

full rationale

The paper's derivation relies on explicit reformulation of variables into grouped fractional representations followed by constraint-preserving transformations that enforce feasibility by construction; this is a deliberate design choice rather than a self-referential reduction. The regret-driven hinge objective references BCD solutions for training but is structured to encourage improvement beyond them, with reported gains being empirical simulation outcomes rather than quantities forced to equal the training inputs by definition. No self-citations, uniqueness theorems, or ansatzes imported from prior author work appear as load-bearing elements. The central claims remain independent of the inputs and rest on external benchmarks (BCD solver outputs) without statistical forcing or definitional equivalence.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The framework rests on standard non-convex mixed-integer optimization assumptions and simulation validation; no new physical constants or entities are introduced.

assumptions (1)
  • domain assumption The joint allocation problem is linearly constrained, non-convex, and contains both continuous and discrete variables.
    Stated directly in the abstract as the source of computational difficulty.

how reviews work

0 comments
Cite this review

Pith. "Pith review of CALO: Constraint-Aware Learning Optimization for Joint Resource Allocation in Double-Active RIS-Assisted Wireless Networks." pith.science (2026). https://pith.science/paper/KQLR7S53

@misc{pith2026260630803,
  author       = {Pith},
  title        = {Pith review of: CALO: Constraint-Aware Learning Optimization for Joint Resource Allocation in Double-Active RIS-Assisted Wireless Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KQLR7S53}},
  note         = {Machine review of arXiv:2606.30803}
}
abstract

Double-active reconfigurable intelligent surface (RIS)-assisted wireless systems can improve coverage and achievable rate in blockage-dominated environments. Still, their joint resource allocation is challenging due to the coupling among RIS placement, amplification power allocation, and reflecting-element assignment. The resulting problem is linearly constrained, non-convex, and involves both continuous and discrete variables, making conventional iterative solvers such as block coordinate descent (BCD) computationally expensive for real-time deployment. This paper proposes a \underline{c}onstraint-\underline{a}ware \underline{l}earning \underline{o}ptimization (CALO) framework for data-driven joint resource allocation in double-active RIS-assisted networks. CALO reformulates the decision variables into grouped fractional representations and maps them to physical resources through constraint-preserving transformations, ensuring that distance, power, and element-budget constraints are satisfied by construction. A straight-through estimator is incorporated to enable differentiable learning over discrete reflecting-element assignments, while a regret-driven hinge objective uses the BCD solution as a reference and encourages performance improvement beyond solver imitation. Simulation results show that CALO achieves $100\%$ feasibility across all tested configurations, improves the achievable rate over BCD in both urban and rural scenarios, and reduces online inference time by orders of magnitude. These results demonstrate the effectiveness of structure-aware learning for feasible and real-time optimization in active multi-RIS wireless systems.

Figures

Figures reproduced from arXiv: 2606.30803 by the authors.

Figure 1
Figure 1. Double-active RIS-assisted wireless communication system. [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Overall proposed learning framework. The neural network predicts [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Architecture of the proposed neural framework. The multilayer perceptron produces grouped logits that are transformed by separate softmax heads [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (3 more)
Figure 5
Figure 5. Figure 5: Distribution of the rate difference (RCALO − RBCD) under urban and rural environments. (MRI) as: MRI = 1 N X N i=1 R (i) CALO − R (i) BCD R (i) BCD ! × 100 The resulting MRI values are approximately 1.29% in the urban scenario and 0.98% in the rural scenario. Table V s…
Figure 6
Figure 6. Figure 6: illustrates the achievable data rate and the correspond￾ing rate gain over the BCD baseline as a function of D. As shown in Fig. 6a, the achievable data rate decreases monotoni￾cally with increasing distance for all considered methods. This behavior is expected due to …
Figure 7
Figure 7. Figure 7: Performance versus the number of reflecting elements. [PITH_FULL_IMAGE:figures/full_fig_p012_7.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

30 extracted references · 30 canonical work pages

  1. [1]

    Medical digital twin and IoT devices: Monitoring patients through human-centered technologies,

    G. Araniti, C. Garibotto, A. Jose, F. Marcello, V . Pilloni, A. Sciarrone, C. Suraci, P. Zema, and M. Zerbino, “Medical digital twin and IoT devices: Monitoring patients through human-centered technologies,” IEEE Internet Things Mag., vol. 5, no. 1, pp. 1–7, 2025

    work page 2025

  2. [2]

    MADQN-enhanced computation offloading and resource allocation for 6G low-altitude economy vehicular networks,

    B. Hu, H. Liu, J. Du, M. L ´opez-Ben´ıtez, C. Wu, X. Chu, and D. Niyato, “MADQN-enhanced computation offloading and resource allocation for 6G low-altitude economy vehicular networks,”IEEE Trans. Cogn. Commun. Netw., vol. 11, no. 3, pp. 1–1, 2025

    work page 2025

  3. [3]

    On the road to 6G: Visions, requirements, key technologies, and testbeds,

    C.-X. Wang, X. You, X. Gao, X. Zhu, Z. Li, C. Zhang, H. Wang, Y . Huang, Y . Chen, H. Haas, J. S. Thompson, E. G. Larsson, M. D. Renzo, W. Tong, P. Zhu, X. Shen, H. V . Poor, and L. Hanzo, “On the road to 6G: Visions, requirements, key technologies, and testbeds,”IEEE Commun. Surv. Tutor., vol. 25, no. 2, pp. 905–974, 2023

    work page 2023

  4. [4]

    Multisensory metaverse-6G: A new paradigm of commerce and education,

    M. H. Alsamh, A. Hawbani, S. Kumar, and S. H. Alsamhi, “Multisensory metaverse-6G: A new paradigm of commerce and education,”IEEE Access, vol. 12, pp. 75 657–75 677, 2024

    work page 2024

  5. [5]

    A survey on physical layer security of ultra/hyper reliable low latency communication in 5G and 6G networks: Recent advancements, challenges, and future directions,

    A. Pradhan, S. Das, M. J. Piran, and Z. Han, “A survey on physical layer security of ultra/hyper reliable low latency communication in 5G and 6G networks: Recent advancements, challenges, and future directions,” IEEE Access, vol. 12, pp. 112 320–112 353, 2024

    work page 2024

  6. [6]

    A vision of 6G wireless systems: Applications, trends, technologies, and open research problems,

    W. Saad, M. Bennis, and M. Chen, “A vision of 6G wireless systems: Applications, trends, technologies, and open research problems,”IEEE Network, vol. 34, no. 3, pp. 134–142, 2020

    work page 2020

  7. [7]

    Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network,

    Q. Wu and R. Zhang, “Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network,”IEEE Commun. Mag., vol. 58, no. 1, pp. 106–112, 2020

    work page 2020

  8. [8]

    Reconfigurable intelligent surfaces for 6G: A comprehensive overview and electromagnetic analysis,

    S. E. Chakkaravarthy, D. Rayaroth, V . B. Kumaravelu, T. S. Jayaraman, V . P. G. Sivabalan, V . C. Thirumavalavan, R. Venkatesan, A. Muru- gadass, and A. L. Imoize, “Reconfigurable intelligent surfaces for 6G: A comprehensive overview and electromagnetic analysis,” inReconfig- urable Intelligent Surfaces for 6G and Beyond Wireless Networks, 2025, pp. 71–112

    work page 2025

Show all 30 references
  1. [9]

    Spatial multiplexing oriented channel reconfiguration in multi-IRS aided MIMO systems,

    Y . Chen, Q. Wu, G. Chen, and W. Chen, “Spatial multiplexing oriented channel reconfiguration in multi-IRS aided MIMO systems,”IEEE Trans. Veh. Technol., vol. 74, no. 6, pp. 9840–9845, 2025

    2025

  2. [10]

    SLNR-based joint RIS- UE association and beamforming design for multi-RIS aided wireless communications,

    Q. Sun, Y . Wu, X. Chen, and J. Zhang, “SLNR-based joint RIS- UE association and beamforming design for multi-RIS aided wireless communications,”IEEE Trans. Veh. Technol., vol. 73, no. 6, pp. 8660– 8670, 2024

    2024

  3. [11]

    Double-IRS aided MIMO communication under LoS channels: Capacity maximization and scal- ing,

    Y . Han, S. Zhang, L. Duan, and R. Zhang, “Double-IRS aided MIMO communication under LoS channels: Capacity maximization and scal- ing,”IEEE Trans. Commun., vol. 70, no. 4, pp. 2820–2837, 2022

    2022

  4. [12]

    A survey of recent advances in optimization methods for wireless communications,

    Y .-F. Liu, T.-H. Chang, M. Hong, Z. Wu, A. M.-C. So, E. A. Jorswieck, and W. Yu, “A survey of recent advances in optimization methods for wireless communications,”IEEE J. Sel. Areas Commun., vol. 42, no. 11, pp. 2992–3031, 2024

    2024

  5. [13]

    Nonconvex min-max optimization: Applications, challenges, and recent theoretical advances,

    M. Razaviyayn, T. Huang, S. Lu, M. Nouiehed, M. Sanjabi, and M. Hong, “Nonconvex min-max optimization: Applications, challenges, and recent theoretical advances,”IEEE Signal Process. Mag., vol. 37, no. 5, pp. 55–66, 2020

    2020

  6. [14]

    Active reconfigurable intelligent surfaces: Expanding the frontiers of wireless communication–A survey,

    M. Ahmed, S. Raza, A. Amin Soofi, F. Khan, W. Ullah Khan, S. Zain Ul Abideen, F. Xu, and Z. Han, “Active reconfigurable intelligent surfaces: Expanding the frontiers of wireless communication–A survey,” IEEE Commun. Surv. Tutor., vol. 27, no. 2, pp. 839–869, Apr. 2025

    2025

  7. [15]

    Active reconfigurable intelligent surfaces: Circuit modeling and reflection amplification optimization,

    P. Gavriilidis, D. Mishra, B. Smida, E. Basar, C. Yuen, and G. C. Alexandropoulos, “Active reconfigurable intelligent surfaces: Circuit modeling and reflection amplification optimization,”IEEE Open J. Commun. Soc., vol. 6, pp. 5692–5710, 2025

    2025

  8. [16]

    Active RIS versus passive RIS: Which is superior with the same power budget?

    K. Zhi, C. Pan, H. Ren, K. K. Chai, and M. Elkashlan, “Active RIS versus passive RIS: Which is superior with the same power budget?” IEEE Commun. Lett., vol. 26, no. 5, pp. 1150–1154, 2022

    2022

  9. [17]

    WMMSE-based joint transceiver design for multi-RIS-assisted cell-free networks using hybrid CSI,

    X. Pan, Z. Zheng, X. Huang, and Z. Fei, “WMMSE-based joint transceiver design for multi-RIS-assisted cell-free networks using hybrid CSI,”IEEE Trans. Wireless Commun., vol. 24, no. 9, pp. 7654–7669, 2025

    2025

  10. [18]

    Joint user association and cooperative beamforming for multi-IRSs aided mmWave communication systems,

    Q. Xue, J. Mu, F. Wei, M. Hua, and Q. Chen, “Joint user association and cooperative beamforming for multi-IRSs aided mmWave communication systems,”Digit. Commun. Netw., vol. 12, no. 2, pp. 252–261, 2026

    2026

  11. [19]

    Double-active-IRS aided wireless communication: Deployment optimization and capacity scaling,

    Z. Kang, C. You, and R. Zhang, “Double-active-IRS aided wireless communication: Deployment optimization and capacity scaling,”IEEE Wireless Communications Letters, vol. 12, no. 11, pp. 1821–1825, 2023

    2023

  12. [21]

    A survey of recent advances in optimization methods for wireless communications,

    Y .-F. Liu, T.-H. Chang, M. Hong, Z. Wu, A. M.-C. So, E. A. Jorswieck, and W. Yu, “A survey of recent advances in optimization methods for wireless communications,”IEEE J. Sel. Areas Commun., vol. 42, no. 11, pp. 2992–3031, Nov. 2024

    2024

  13. [22]

    RIS-driven resource allocation strategies for diverse network environments: A comprehensive review,

    M. Ahmed, F. Xu, Y . Lyu, A. A. Soofi, Y . Li, F. Khan, W. U. Khan, M. Sheraz, T. C. Chuah, and M. Deng, “RIS-driven resource allocation strategies for diverse network environments: A comprehensive review,” Trans. Emerg. Telecommun. Technol., vol. 36, no. 6, 2025

    2025

  14. [23]

    Robust and secure multi-user STAR-RIS-aided communications: Op- timization versus machine learning,

    S. Pala, K. Singh, O. Taghizadeh, C. Pan, O. A. Dobre, and T. Q. Duong, “Robust and secure multi-user STAR-RIS-aided communications: Op- timization versus machine learning,”IEEE Trans. Commun., vol. 73, no. 9, pp. 7517–7534, 2025

    2025

  15. [24]

    A comprehensive survey of machine learning applied to resource allocation in wireless communications,

    D. G. S. Pivoto, F. A. P. de Figueiredo, C. Cavdar, G. R. d. L. Tejerina, and L. L. Mendes, “A comprehensive survey of machine learning applied to resource allocation in wireless communications,”IEEE Commun. Surv. Tutor., vol. 28, pp. 1986–2053, 2026

    1986

  16. [25]

    A survey of graph-based resource management in wireless networks–Part II: Learning approaches,

    Y . Dai, L. Lyu, N. Cheng, M. Sheng, J. Liu, X. Wang, S. Cui, L. Cai, and X. Shen, “A survey of graph-based resource management in wireless networks–Part II: Learning approaches,”IEEE Trans. Cogn. Commun. Netw., vol. 11, no. 4, pp. 2101–2122, 2025

    2025

  17. [26]

    Learning to optimize resource allocation in dynamic wireless environments: Embracing the new while engaging the old,

    Z. Liu, Y . Li, Y .-C. Wu, and Y . Gong, “Learning to optimize resource allocation in dynamic wireless environments: Embracing the new while engaging the old,”IEEE Trans. Wireless Commun., vol. 24, no. 9, pp. 7346–7359, 2025

    2025

  18. [27]

    Double-active-IRS aided wireless communication with total amplification power constraint,

    X. Li, C. You, Z. Kang, Y . Zhang, and B. Zheng, “Double-active-IRS aided wireless communication with total amplification power constraint,” IEEE Commun. Lett., vol. 27, no. 10, pp. 2817–2821, 2023

    2023

  19. [28]

    R. B. D’Agostino and M. A. Stephens, Eds.,Goodness-of-Fit Tech- niques. New York, NY , USA: Marcel Dekker, 1986

    1986

  20. [29]

    W. J. Conover,Practical Nonparametric Statistics, 3rd ed. New York, NY , USA: John Wiley & Sons, 1999

    1999

  21. [30]

    Hollander, D

    M. Hollander, D. A. Wolfe, and E. Chicken,Nonparametric Statistical Methods, 3rd ed. Hoboken, NJ, USA: John Wiley & Sons, 2014

    2014

  22. [31]

    R. J. Grissom and J. J. Kim,Effect Sizes for Research: Univariate and Multivariate Applications, 2nd ed. New York, NY , USA: Routledge, 2012

    2012

Pith tools

Reviewed July 1, 2026 · model on record in the stance chip above.