REVIEW 4 major objections 5 minor 19 references
Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints
T0 review · 4 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash
Pith's one-line read Relaxing a fixed semantic-similarity threshold into a per-user interval lets a base station serve up to 17.1% more users in a semantic-communication uplink.
desk verdict Genuine range-constraint idea, but Algorithm 1 may count infeasible users; worth a serious referee. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the semantic-similarity range $[\xi_{i,\mathrm{thmin}}, \xi_{i,\mathrm{thmax}}]$ substituted for the conventional point constraint $\xi_i \ge \xi_{i,\mathrm{th}}$, together with a lookup table that encodes $\xi_i(O_i,\mathrm{SNR}_i)$ by running the UDeepSC encoder–decoder over a grid of compression rates and SNRs. The range turns the semantic requirement into a negotiating interval: the base station can reduce the offered similarity to a level still inside the user's acceptance zone and use the saved bandwidth and power to admit another user. The argument then moves through a two-step decomposition—F1, a geometric program over bandwidth $\beta_i$ and power $P_i$ at fixed similarity values, and F2, a table search choosing the highest feasible similarity and its compression rate $O_i$ for the current SNR—iterated until the objective stops improving. The lookup table is load-bearing: every feasibility check of the delay constraint (C6) and the similarity constraint (C7) passes through its entries.
What would settle it
Run Algorithm 1 on a random instance with the paper's simulation parameters and record the offered similarity $\xi_i$ and transmission delay $t_i$ after each iteration; if any user's terminal allocation has $\xi_i$ outside $[\xi_{i,\mathrm{thmin}}, \xi_{i,\mathrm{thmax}}]$ or $t_i > \tau_{i,\mathrm{th}}$, the claimed satisfaction gain is an artifact of the loop's unchecked fallback rather than a property of the interval formulation.
Extended reading notes
Core claim
The paper's claim is that the feasible region of a multi-user semantic uplink grows when the semantic-similarity constraint is an interval $[\xi_{i,\mathrm{thmin}}, \xi_{i,\mathrm{thmax}}]$ rather than a single lower bound. In problem (4), the base station minimizes a penalized product of transmission and semantic reliability ratios subject to total-bandwidth, per-user power, minimum-SNR, compression-rate, delay, and similarity-interval constraints. Because the semantic similarity $\xi_i(O_i,\mathrm{SNR}_i)$ has no closed form, the paper decomposes the MINLP into a geometric-programming subproblem for bandwidth and power (F1) and a lookup-table subproblem for compression rate (F2), solved alternately by Algorithm 1 until a stopping condition. Simulations using the UDeepSC encoder–decoder on CIFAR-10 show the algorithm serving up to 17.1% more users than the QoE-aware strict-similarity baseline and raising total network semantic similarity by 14%, at the price of a slightly lower average similarity per user because satisfied users are served near their minimum acceptable similarity rather than their maximum.
Load-bearing premise
The alternating loop that switches between choosing compression rates and allocating bandwidth and power is assumed to settle at a solution where every user still meets their delay and similarity requirements, but the paper does not prove convergence or show that the fallback selection preserves those requirements.
Editorial extensions
If this is right
- Using a similarity interval instead of a fixed threshold means the same total bandwidth can satisfy a larger user population, because resources are spent only to move each user's similarity to the bottom of their interval, not to a prescribed point.
- The strict-similarity variant of the scheme, which keeps a fixed lower bound, serves fewer users; the 17.1% gain is therefore specifically the work of the interval constraint, not of the solution algorithm alone.
- Serving users near their minimum acceptable similarity intentionally lowers the network's average similarity, but the paper reports total network semantic similarity rising by 14% because more users are admitted.
- The QoE-based single-channel baseline underperforms partly because it cannot split a user's traffic across channels, so its assigned-but-unsatisfied users waste spectrum that the flexible allocation can reuse.
- Even with no closed-form expression for semantic similarity, a precomputed table of $\xi(O,\mathrm{SNR})$ supports a polynomial-complexity allocation loop, since the geometric-programming subproblem is convex and the table search is bounded.
Reading between the lines
- The interval-relaxation idea should transfer to other resource dimensions—user association, number of semantic symbols, task selection—wherever the quality metric is monotone in the resource; the paper demonstrates it only for bandwidth, power, and compression rate.
- The 17.1% figure depends on the specific UDeepSC lookup table and the chosen interval widths; a natural testable extension is that widening the intervals keeps raising the served-user count until the delay or SNR constraints bind, a scaling law the paper does not state.
- Because Algorithm 1 has no convergence proof, a practical failure mode is oscillation between F1 and F2 where a user is alternately admitted and dropped; checking for cycles on random channel realizations would tell whether the reported gains survive outside the simulated instances.
- The fallback step that picks the best table entry at $\mathrm{SNR}_{i,\mathrm{th}}$ when no delay-feasible entry exists can return a similarity outside the user's interval; adding a feasibility check inside the loop would make the satisfaction guarantee conditional on the lookup table, a small change the paper leaves implicit.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a semantic-aware resource allocation scheme for uplink semantic communication, in which each user specifies a range for semantic similarity instead of a fixed minimum threshold. The authors formulate a mixed-integer nonlinear program (MINLP) that jointly optimizes bandwidth, power, and compression rate under SNR, bandwidth, power, delay, and semantic-similarity constraints, and decompose it into a geometric-programming subproblem over bandwidth and power and a lookup-table subproblem over the compression rate. An alternating algorithm is presented, and simulations with the UDeepSC model on CIFAR-10 report up to 17.1% more satisfied users and 14% higher total network semantic similarity compared with QoE-aware and strict-similarity baselines. The paper concludes that flexible similarity ranges enable the base station to serve more users at a slight average-similarity cost.
Significance. If the reported gains were established for feasible solutions, the idea of replacing a point constraint on semantic similarity with an acceptable range would be a useful contribution to semantic-communication resource allocation, because it directly addresses the trade-off between user satisfaction and resource scarcity. The paper is also constructive in shipping a tractable decomposition: F1' is a correctly formed geometric program once each ξi is fixed, and the use of a measured lookup table from a pretrained UDeepSC model avoids requiring a closed-form semantic-similarity expression. The main limitation is that the alternating algorithm is not shown to return feasible points of the original MINLP, so the central numerical claim is currently unsupported; the approach is nevertheless promising and repairable within the manuscript's scope.
major comments (4)
- [Section III, Algorithm 1 (lines 8–24)] The algorithm selects ξi and Oi from the similarity table based on the current SNRi,it, solves F1′ over bandwidth and power, and then recomputes SNRi,it; the termination condition checks only ΔF. Because C6 and C7 are hard constraints in problem (4), and no step verifies that the actual ξi(Oi,SNRi) lies in [ξi,thmin, ξi,thmax] or that t_i = d0,i(1−Oi)/(βi log2(1+SNRi)) ≤ τi,th after the GP update, the returned allocation may violate C6 or C7. Consequently, the satisfied-user counts in Fig. 1 include users whose allocations are not known to be feasible, which undermines the reported 17.1% improvement.
- [Section III, Algorithm 1 (lines 15–21)] The fallback for a user with no delay-feasible candidate selects ξi and Oi from the table at SNRith. This fallback is triggered precisely when no candidate satisfying C6 was found, so the algorithm continues while fixing a pair that is known to violate C6; it then solves F1′ with that pair as a constant. In addition, if the GP solution raises SNRi above SNRith, the true ξi(Oi,SNRi) can exceed ξi,thmax even though the selected ξi satisfied C7 at the lower SNR. Problem (4) contains no admission-control or slack variable to accommodate such cases, so the algorithm may return an infeasible point as if it were a solution.
- [Section III, Eqs. (4)–(6)] No convergence or feasibility proof is provided for the alternating procedure. The stopping criterion ΔF measures only the penalty objective; because F1 and F2 optimize different variable sets, a monotone decrease of the objective between alternating updates is not established, and objective convergence would not imply convergence to a feasible point of the MINLP. The claim in Section III that Algorithm 1 reaches a suboptimal solution of (4) therefore requires a fixed-point or monotonicity argument that is absent.
- [Section IV, Figs. 1–2] The objective in (4) is a smooth penalty, Σ (SNRith/SNRi)^a (ξi,thmin/ξi)^a, not a count of satisfied users. Minimizing this penalty does not generally maximize the number of users satisfying C4 and C7, since a user that remains infeasible still contributes a decreasing penalty as its ratios decrease, and no mechanism drops or repairs such a user. Figure 2 itself shows user 8 unsatisfied in the proposed method, which is consistent with this issue but conflicts with the paper's framing of the range constraint as a feasibility enhancement. The 17.1% gain in Fig. 1 is thus not yet attributable to the range-constraint formulation; it may be an artifact of returning points outside the feasible set.
minor comments (5)
- [Eq. (4)] The summation index in C1 is written as n while the term is β_i; it should be Σ_{i=1}^N β_i ≤ M. Similar index inconsistency appears in the objective of (4)–(5), where 'NP n=1' should be a standard summation.
- [Section IV] The phrase 'our method without similarity rang' in the paragraph after Eq. (8) should read 'range'.
- [Section II-A] The transmission delay t_i is defined in prose as d0,i(1−Oi)/(βi log2(1+SNRi)), but C6 in (4) states only t_i ≤ τi,th; include the explicit expression in the constraint listing for self-containedness.
- [Fig. 2 and Section IV] The text says user 8 was not served in the proposed method, but it is not stated whether an unsatisfied user receives zero resources or receives an allocation that simply lies outside its semantic-similarity range; making this convention explicit would help interpret the satisfied-user counts.
- [Section III, Complexity] The complexity expression O(it(kN + (7N + 3)^3)) should be justified: the GP has 2N decision variables, so the origin of the (7N+3)^3 term is unclear and should be derived or referenced.
Circularity Check
No circularity found; the derivation is self-contained given the externally published UDeepSC model, and the only concerns are algorithmic feasibility, not circular reasoning.
full rationale
The paper's central derivation is a resource-allocation optimization whose inputs are channel gains, SNR thresholds, similarity thresholds, delay constraints, and a measured semantic-similarity lookup table. The lookup table is obtained by running UDeepSC, an externally published model from ref. [17] by different authors, over SNR and compression-rate grids; it is not fitted to the reported 17.1% or 14% gains. The GP reformulation in Eq. (6) is a standard variable substitution from Eq. (1), not an equation that assumes its own conclusion. Algorithm 1 is heuristic, and its stopping criterion and fallback can return allocations that are not re-checked against C6 or C7 after the SNR is recomputed; this is a convergence and feasibility risk, not a case where a prediction reduces to its inputs by construction. No load-bearing self-citations appear in the derivation chain: the only external dependency is the UDeepSC black box, which is independent support rather than a fitted parameter. The claimed advantage of the similarity-range formulation is an empirical simulation result and is testable against the strict-threshold baseline, so it is not tautological. Consequently, no specific circular step can be exhibited under the required standard.
Assumptions & free parameters
free parameters (3)
- Penalty exponent a =
2 in simulations
- Lookup table discretization step sizes =
not specified
- Semantic similarity threshold distribution =
uniform in [0.6, 0.9]
assumptions (3)
- domain assumption Semantic similarity xi_i is a deterministic function of (O_i, SNR_i) captured by the UDeepSC lookup table, independent of other users and content.
- domain assumption Orthogonal resource allocation with an AWGN channel, single antennas, and stationary users, so users do not interfere and each SNR is given by equation (1).
- ad hoc to paper The alternating F1/F2 procedure in Algorithm 1 converges to a feasible solution of problem (4).
Cite this review
Pith. "Pith review of Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints." pith.science (2026). https://pith.science/paper/2C472Y46
@misc{pith2026250420939,
author = {Pith},
title = {Pith review of: Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints},
year = {2026},
howpublished = {\url{https://pith.science/paper/2C472Y46}},
note = {Machine review of arXiv:2504.20939}
}
abstract
Semantic communication (SemCom) aims to enhance the resource efficiency of next-generation networks by transmitting the underlying meaning of messages, focusing on information relevant to the end user. Existing literature on SemCom primarily emphasizes learning the encoder and decoder through end-to-end deep learning frameworks, with the objective of minimizing a task-specific semantic loss function. Beyond its influence on the physical and application layer design, semantic variability across users in multi-user systems enables the design of resource allocation schemes that incorporate user-specific semantic requirements. To this end, \emph{a semantic-aware resource allocation} scheme is proposed with the objective of maximizing transmission and semantic reliability, ultimately increasing the number of users whose semantic requirements are met. The resulting resource allocation problem is a non-convex mixed-integer nonlinear program (MINLP), which is known to be NP-hard. To make the problem tractable, it is decomposed into a set of sub-problems, each of which is efficiently solved via geometric programming techniques. Finally, simulations demonstrate that the proposed method improves user satisfaction by up to $17.1\%$ compared to state of the art methods based on quality of experience-aware SemCom methods.
Figures
Reference graph
Works this paper leans on
-
[1]
Y . Wang, M. Chen, T. Luo, W. Saad, D. Niyato, H. V . Poor and S. Cui, ”Performance optimization for semantic communications: An attention- based reinforcement learning approach,” IEEE Journal on Selected Areas in Communications, vol. 40, no. 9, pp. 2598-2613, Sep. 2022
work page 2022
-
[2]
C. Chaccour, W. Saad, M. Debbah, Z. Han and H. V . Poor, ”Less Data, More Knowledge: Building Next Generation Semantic Communication Networks,” in IEEE Communications Surveys & Tutorials, Feb. 2025
work page 2025
-
[3]
S Fiorellino, C Battiloro, EC Strinati, P Di Lorenzo, ”Dynamic Relative Representations for Goal-Oriented Semantic Communications,” arXiv preprint arXiv:2403.16986, Mar 25. 2024
arXiv 2024
-
[4]
L. Yan, Z. Qin, R. Zhang, Y . Li, and G. Y . Li, ”Resource allocation for text semantic communications,” IEEE Wireless Communications Letters, vol. 11, no. 7, Jul. 2022
work page 2022
-
[5]
L. Xia, Y . Sun, X. Li, G. Feng, and M. A. Imran, ”Wireless re- source management in intelligent semantic communication networks,” in IEEE INFOCOM 2022-IEEE Conference on Computer Communica- tions Workshops (INFOCOM WKSHPS), pp. 1-6. 2022,
work page 2022
-
[6]
R. Xu, Z. Yang, Z. Zhao, Q. Yang and Z. Zhang, ”Resource Allocation for Green Probabilistic Semantic Communication with Rate Splitting,” IEEE International Conference on Communications Workshops (ICC Workshops), Denver, CO, USA, 2024
work page 2024
-
[7]
J. Liu et al., ”Optimizing Resource Allocation for Multi-Modal Semantic Communication in Mobile AIGC Networks: A Diffusion-Based Game Approach,” in IEEE Transactions on Cognitive Communications and Networking
-
[8]
H Chen, F Fang, and X Wang. ”Knowledge Sharing-enabled Semantic Rate Maximization for Multi-cell Task-oriented Hybrid Semantic-Bit Communication Networks”, arXiv preprint arXiv:2501.01635, Jan 3. 2025 Fig. 2. Semantic similarity of the satisfied users. Fig. 3. Average similarity VS maximum available bandwidth
work page Pith review arXiv 2025
Show all 19 references
-
[9]
L. Yan, Z. Qin, R. Zhang, Y . Li, and G. Y . Li, ”QoE-aware resource allocation for semantic communication networks,” in GLOBECOM 2022-2022 IEEE Global Communications Conference, 2022: IEEE, pp. 3272-3277
2022
-
[10]
”Semantic- Aware Resource Management for C-V2X Platooning via Multi-Agent Reinforcement Learning”, arXiv preprint arXiv:2411.04672, Nov 7
Z Shao, Q Wu, P Fan, Wang K, Q Fan, W Chen, KB Letaief. ”Semantic- Aware Resource Management for C-V2X Platooning via Multi-Agent Reinforcement Learning”, arXiv preprint arXiv:2411.04672, Nov 7. 2024
2024 arXiv
-
[11]
L. Yan, Z. Qin, R. Zhang, Y . Li, X. Tao, and G. Y . Li, ”QoE-based Semantic-Aware Resource Allocation for Multi-Task Networks,” arXiv preprint arXiv:2305.06543, 2023
2023 arXiv
-
[12]
Z. Yang, M. Chen, Z. Zhang, and C. Huang, ”Energy efficient semantic communication over wireless networks with rate splitting,” IEEE Journal on Selected Areas in Communications, vol. 41, no. 5, pp. 1484-1495, 2023
2023
-
[13]
C. Liu, C. Guo, Y . Yang, and N. Jiang, ”Adaptable semantic compres- sion and resource allocation for task-oriented communications,” arXiv preprint arXiv:2204.08910, 2022
2022 arXiv
-
[14]
Zhang, H
H. Zhang, H. Wang, Y . Li, K. Long, and A. Nallanathan, ”DRL-driven Dynamic Resource Allocation for Task-Oriented Semantic Communica- tion,” IEEE Transactions on Communications, vol. 71, no. 7, pp. 3992- 4004, Jul. 2023
2023
-
[15]
C. Liu, C. Guo, Y . Yang, and J. Chen, ”Bandwidth and power allocation for task-oriented semanticcommunication,” arXiv preprint arXiv:2201.10795, 2022
2022 arXiv
-
[16]
B. Du, H. Du, H. Liu, D. Niyato, P. Xin, J. Yu, et al., ”YOLO- based Semantic Communication with Generative AI-aided Resource Allocation for Digital Twins Construction,” in IEEE Internet of Things Journal, 2023
2023
-
[17]
Zhang, Q
G. Zhang, Q. Hu, Z. Qin, Y . Cai, G. Yu and X. Tao, ”A Unified Multi- Task Semantic Communication System for Multimodal Data,” in IEEE Transactions on Communications, vol. 72, no. 7, Jul. 2024
2024
-
[18]
Nesterov and A
Y . Nesterov and A. Nemirovsky, Interior Point Polynomial Methods in Convex Programming. SIAM Press, 1994
1994
-
[19]
Geometric programming for communication systems
M Chiang. Geometric programming for communication systems. Foun- dations and Trends® in Communications and Information Theory. 2005 Jul 14;2(1–2):1-54
2005
Reviewed August 16, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.