Pith. sign in

REVIEW 3 major objections 6 minor 11 references

Rate Maximization for Fluid Antenna System Assisted Semantic Communication

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

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

Pith's one-line read Jointly optimizing transmit covariance, semantic compression ratio, and fluid-antenna port selection maximizes equivalent rate under a combined power budget; the paper's alternating algorithm reports up to 71% gain over a non-semantic…

desk verdict The novelty is real but the reported 71% gain is computed from a Jensen upper bound, not the true ergodic rate, so the central quantitative claim remains unverified until the bound's tightness is checked. read the letter →

arxiv 2506.22943 v1 pith:ZVVDJJ33 submitted 2025-06-28 eess.SP

Siyun Liang , Chen Zhu , Zhaohui Yang , Changsheng You , Dusit Niyato , Kai-Kit Wong , Zhaoyang Zhang This is my paper · ORCID
classification eess.SP
keywords fluidantennasystemsemanticcommunicationratemaximizationbeamformingoptimizationportselectionnear-fieldDinkelbachtransformequivalent
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 tries to establish that in a near-field downlink where the base station compresses data through semantic extraction and the user has a fluid antenna that can activate any small set of its many ports, the equivalent rate $R=R_0/\rho$ is maximized by jointly choosing the transmit covariance $Q$, the semantic compression ratio $\rho$ (the fraction of the original data size that remains), and the activated ports $r$, subject to a single power budget covering both transmission and computation. Because the exact ergodic rate is hard to optimize, the paper replaces it with a deterministic upper bound obtained by moving the expectation inside the logarithm, then solves the resulting problem with an alternating algorithm: Dinkelbach's transform handles $Q$ and $\rho$, and a one-port-at-a-time enumeration handles $r$. The simulation study, with a 20-antenna base station, a 35-port fluid antenna, and 5 activated ports, shows the scheme converging quickly and exceeding a fluid-antenna system without semantic extraction by 43% at 0 dB and 71% at 15 dB SNR. The practical interest is that semantic compression and movable antennas are two separate proposals for stretching spectrum and energy, and this paper supplies one way to make them work together under a coupled power constraint, with a closed-form compression-ratio update at each step.

What carries the argument

Three pieces carry the argument. The first is the Jensen upper bound of Eqs. (17)-(19): replacing $\mathbb{E}_O[OAQA^HO^H]$ with $\mathrm{tr}(AQA^H)\alpha^2 I_{V_r}$ removes the expectation from the log-determinant and leaves a deterministic ratio of a concave function of $Q$ to a piecewise-linear function of the compression rate. The second is Dinkelbach's transform, which converts the fractional program $\max f(Q)/g(Q)$ into the iterated problem $\max f(Q)-\tau g(Q)$ with $\tau=f(Q)/g(Q)$, making each subproblem convex. The third is the port-selection update, which splits the objective as $\frac{1}{\rho}\log\det(I_{V_r}+\gamma B_mB_m^H)+\frac{1}{\rho}\log(1+\gamma b^H(r_m)(I_{V_r}+\gamma B_mB_m^H)^{-1}b(r_m))$ with $\gamma=\frac{\alpha^2}{\sigma^2}\mathrm{tr}(AQA^H)$, so that the combinatorial choice of $m_a$ ports is reduced to $m_a$ single-port searches over the $M$ available positions.

What would settle it

For the Section IV parameters, compute the true equivalent rate $\frac{1}{\rho}\mathbb{E}_O[\log\det(I_{m_a}+\frac{1}{\sigma^2}G(r)QG^H(r))]$ by Monte Carlo averaging over many realizations of $O$ for the algorithm's output $(Q,\rho,r)$, and compare it with the optimized bound (19); a relative gap of more than a few percent would show that the optimized variables are not maximizing the actual rate. For small $M$, exhaustively checking all legal port selections and comparing with Algorithm 2's choice would directly test the port-selection subproblem.

Watch

Extended reading notes

Core claim

The paper's central claim is that the equivalent rate of a FAS-assisted semantic downlink is maximized by the joint triple $(Q,\rho,r)$, and that the proposed alternating algorithm attains this maximum on a tractable surrogate. The objective is $R=\frac{1}{\rho}\mathbb{E}_O[\log\det(I_{m_a}+\frac{1}{\sigma^2}G(r)QG^H(r))]$, where $G(r)=B^H(r)OA$ is the near-field channel built from transmit and receive field response matrices and a random path-response matrix $O$. The authors use $\mathbb{E}_O[OAQA^HO^H]=\mathrm{tr}(AQA^H)\alpha^2 I_{V_r}$ to move the expectation inside the logarithm, producing the deterministic upper bound $R\le \frac{1}{\rho}\log\det(I_{m_a}+\frac{\alpha^2}{\sigma^2}\mathrm{tr}(AQA^H)B^H(r)B(r))$, and then optimize this bound by alternating between Dinkelbach-based updates of $(Q,\rho)$ and coordinate-wise enumeration of $r$. On this basis, the paper reports that the proposed scheme outperforms a fluid-antenna system without semantic extraction by 43% at 0 dB and 71% at 15 dB SNR, with the semantic-compression gain amplifying as the channel improves.

Load-bearing premise

The whole optimization is run on an upper-bound formula for the average rate, and the paper never checks how close that formula is to the true average rate; if the bound is loose, the optimized settings and the reported gains may not be real.

Editorial extensions

If this is right

  • Under the paper's model, semantic compression is most valuable when the channel is strong: the reported gain over non-semantic FAS grows from 43% at 0 dB to 71% at 15 dB SNR, because less transmit power is needed and the compression step magnifies the rate.
  • Port selection remains important even with semantic compression: the random-port semantic scheme underperforms the optimized scheme, so choosing which ports to activate and choosing the compression ratio are not separable decisions.
  • The algorithm's fast convergence, with one optimization round already close to the final equivalent rate, means the alternating procedure can serve as a practical resource allocator rather than a one-shot offline design.
  • The worst-case complexity $O(N^{4.5}\log(1/\epsilon_1)M^{m_a}/\epsilon_2)$ keeps the approach feasible for moderate port counts, as in the simulated $M=35$, $m_a=5$ case.

Reading between the lines

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

  • Editorial inference: the same alternating structure, using a deterministic surrogate, Dinkelbach updates, and one-port-at-a-time enumeration, would extend to multiple semantic users or to jointly optimizing the number of activated ports $m_a$, which the paper keeps fixed.
  • Editorial inference: a Monte Carlo comparison between the optimized upper bound (19) and the true averaged rate (16a) would settle whether the reported gains are realized, and the paper does not include that check.
  • Editorial inference: comparing semantic compression on a fixed antenna against the proposed scheme would isolate the value of the fluid antenna itself; the paper's main comparison is against non-semantic FAS, so the two ingredients' separate contributions are not fully separated.
  • Editorial inference: because semantic extraction consumes power through $P_c=c(\rho)p_0$, the optimal compression ratio encodes a computation-versus-transmission tradeoff, with more power spent on compression when the channel is good; this pattern is consistent with the paper's SNR-dependent results but is not stated as a separate result.
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 studies a downlink fluid antenna system (FAS) with semantic communication, where a multi-antenna base station performs semantic compression and a user with a fluid antenna selects activated ports. The central claim is that jointly optimizing the transmit covariance matrix Q, the semantic compression ratio ρ, and the FAS port selection r maximizes the equivalent rate R = R0/ρ under a total power constraint. The authors replace the true ergodic expectation in the objective with a Jensen upper bound, decompose the resulting problem into a beamforming/compression subproblem and a port-selection subproblem, and solve them alternately using Dinkelbach's transform and an enumerate-like coordinate ascent. Simulation results are reported for an SNR sweep, showing faster growth and a 71% gain over a FAS without semantic compression at SNR = 15 dB.

Significance. The integration of semantic compression with fluid antenna systems is timely, and the system model with near-field channels and probability-graph semantic extraction is a reasonable formulation. The algebraic simplification in Eq. (18) is correct for i.i.d. complex Gaussian path responses, and the use of Sylvester's identity in Eq. (26) is sound. The simulation study compares against several baselines and includes convergence plots. If the central claim could be established for the true ergodic rate rather than an upper bound, the proposed alternating algorithm would be a useful design for FAS-assisted semantic networks. However, the current version does not verify the tightness of the Jensen surrogate, and the convergence proof contains a misreference to Eq. (21); these are load-bearing gaps that prevent the main claim from being accepted as stated.

major comments (3)
  1. [III-A, Eqs. (17)-(19) and Section IV] The optimization objective in (16a) is the true ergodic equivalent rate R = E_O[(1/ρ) log det(I_ma + (1/σ^2)G(r)Q G^H(r))]. In Eqs. (17)-(19) this is replaced by the Jensen upper bound Rbar = (1/ρ) log det(I_ma + (α^2/σ^2) tr(AQA^H) B^H(r)B(r)). For a random O, Jensen's inequality is strict, so Rbar is an upper bound on the achievable rate, not the achievable rate itself. The paper then optimizes Rbar in Sections III-B and III-C, and in Section IV plots 'Equivalent Rate' without stating whether the curves are R or Rbar. If the curves are Rbar, then the reported 71% gain over FAS-non-semantic is a gain in an upper bound, and the optimized Q and r may be suboptimal for the true objective. The manuscript must either compute the true expectation by Monte Carlo in the simulations, provide a tightness analysis of the bound, or otherwise establish that maximizing Rbar is faithful to maximizing R. Without this, the central claim that the proposed scheme improves the true equivalent rate is not established.
  2. [III-C, convergence paragraph after Algorithm 2] The convergence argument states that 'the value of (21) increases monotonously during the optimization and as (21) is boundary, the overall algorithm is bound to converge.' Equation (21) is the equality constraint P_c = P_max - tr(Q), not an objective function, and there is no reason its value should be monotone during the iterations. A valid convergence proof must show that the objective of the alternating procedure, e.g., η(i)(Q,r) defined in Algorithm 2, is non-decreasing and bounded above, and that the Dinkelbach inner loop achieves the claimed accuracy. The current text does not provide this. This is a load-bearing gap because the algorithm's termination guarantee and the claim of convergence in Fig. 1 are not rigorously supported.
  3. [III-B, Eq. (19) and Eq. (20)] Under the Jensen surrogate, the objective in (20) depends on Q only through the scalar tr(A Q A^H) (see (19)). Consequently, the 'beamforming' optimization in Algorithm 1 does not actually optimize the spatial structure of Q; any Q with the same value of tr(AQA^H) yields the same surrogate value. In the true rate (11), the structure of Q matters through G(r)Q G^H(r). This reinforces that the surrogate is not a faithful proxy for the beamforming problem and should be explicitly acknowledged; the paper's language describing joint design of 'transmit beamforming' overstates what is optimized.
minor comments (6)
  1. [II-B, Eqs. (2)-(7)] The text twice refers to 'Talor's approximation'; this should be 'Taylor's approximation'.
  2. [I, contributions] The abstract and contributions state that the optimal semantic compression ratio is obtained in closed form, but the algorithm enumerates the piecewise segments θ_s and uses Dinkelbach's transform; the phrase 'closed form' overstates the procedure.
  3. [IV, Simulation results] The parameters of the semantic compression model in Eq. (13), namely A_s, B_s, D_s and p_0, are not given numerical values; without these values the simulation results cannot be reproduced.
  4. [III-B, Eq. (22)] The binary variables θ_s are used in Eq. (22) before they are formally defined; please define θ_s and the range of the summation immediately before or after Eq. (22).
  5. [Algorithm 1] The inner loop resets the iteration index with 'Set iteration index i = 0' at the start of each outer iteration; this is confusing because the inner Dinkelbach loop should continue incrementing i until convergence. Please restructure the loop description.
  6. [IV, Fig. 2] The text says 'SNR is defined as Pmax/σ^2' while the average noise power is set to 3 dBm; please clarify the relationship and state whether σ^2 is in linear or dB scale.

Circularity Check

1 steps flagged · score 6.0 of 10

The reported 'Equivalent Rate' in the simulations is the Jensen upper bound (19), the same quantity the algorithm maximizes, not the true ergodic rate (16a); the claimed gains therefore reduce to the optimized surrogate.

  1. self definitional [Section III-A, Eq. (19); Section III-B, Eq. (20a); Section IV, Fig. 2]
    "Our goal is to maximize the equivalent rate R by optimizing Q, ρ and r jointly. Mathematically... R = E_O[1/ρ log det(I_ma + 1/σ^2 G(r)Q G^H(r))] (16a). Moreover, the upper bound for the equivalent rate in (17) can be reduced to: R = 1/ρ log det(I_ma + α^2/σ^2 tr(A Q A^H) B^H(r)B(r)) (19). Fig. 2 demonstrates the performance of the four schemes with varying SNRs."

    The paper defines equivalent rate R in (16a) as an expectation over the random path response O. Equation (19) is a Jensen upper bound, but the paper writes it with the same symbol R and subsequently uses it as the objective in subproblems (20a), (23a), and (25a). Section IV plots 'Equivalent Rate' with no Monte Carlo expectation over O, so the plotted metric is the bound (19), not the true rate (16a). Therefore the reported 71% gain and the convergence 'validation' compare the algorithm against the same surrogate it was designed to maximize; the numerical claim reduces by construction to the optimized upper bound, and the tightness of the Jensen inequality is never checked.

full rationale

The core optimization steps—Dinkelbach transform for Q and rho, and the determinant-lemma-based enumeration for port selection—are algebraically sound and not circular. The computation-load model (13) is imported from reference [8], which shares authors with this paper, but it is a modeling assumption rather than a derived conclusion, so it is not a circular step by itself; it does, however, make the numerical results contingent on unstated parameters ('set according to (13)'). Reference [4], also same-group work, is used only as a baseline and not as a load-bearing premise. The one significant circularity is in the evaluation: after deriving the Jensen upper bound, the paper reuses the symbol R for it, optimizes this bound in all subproblems, and then plots 'Equivalent Rate' without indicating that the true expectation (11)/(16a) is computed. Thus the demonstrated 'effectiveness' is self-referential—the reported rate is the very surrogate being maximized—and the central claim about improving the true equivalent rate remains unverified. This warrants a score of 6: partial circularity in the central numerical claim, while the algorithmic derivation retains independent content.

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

The central claim rests on a chain of modeling assumptions: the random channel statistics in Eq. (18), the Jensen upper-bound proxy in Eq. (19), the semantic compression rate/cost model from [8], and the near-field Taylor approximations. The paper contributes an optimization algorithm but does not independently validate any of these assumptions. The only free parameter affecting the simulation outcome is the unstated semantic compression cost function.

free parameters (1)
  • Semantic compression piecewise parameters (A_s, B_s, D_s) and power coefficient p0 = not specified
    Eq. (13) defines computation load as a piecewise linear function of rho, and Section IV states 'Parameters for semantic compression are set according to (13)' without giving numerical values. The simulation results, including the reported rate gains, depend on these unstated choices.
assumptions (4)
  • domain assumption The path response matrix O has i.i.d. entries with zero mean and variance alpha^2.
    Invoked in Eq. (18) to simplify E[O A Q A^H O^H] into tr(AQA^H) alpha^2 I. This statistical model is the basis for the Jensen upper bound and all subsequent derivations.
  • domain assumption Maximizing the Jensen upper bound R-bar in Eq. (19) is an acceptable surrogate for maximizing the true ergodic equivalent rate R in Eq. (16a).
    Section III-A replaces the expectation objective with its upper bound and the paper never quantifies the gap. All performance claims are conditional on this proxy being faithful.
  • domain assumption Semantic compression scales the required rate by exactly 1/rho and costs the piecewise-linear computation power c(rho) in Eq. (13), without semantic distortion constraints.
    Eq. (12) defines equivalent rate as R0/rho and Eq. (13) models computation cost. Both are inherited from the probability graph framework of [8] and are not derived in this paper.
  • domain assumption The near-field channel model using the Taylor-expanded path differences in Eqs. (3) and (7) accurately represents the mmWave propagation environment.
    The field response vectors A and B in Eqs. (5) and (9) are built on these second-order expansions. If the expansion error is significant, the channel model and all numerical results change.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Rate Maximization for Fluid Antenna System Assisted Semantic Communication." pith.science (2026). https://pith.science/paper/ZVVDJJ33

@misc{pith2026250622943,
  author       = {Pith},
  title        = {Pith review of: Rate Maximization for Fluid Antenna System Assisted Semantic Communication},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZVVDJJ33}},
  note         = {Machine review of arXiv:2506.22943}
}
read the original abstract

In this paper, we investigate the problem of rate maximization in a fluid antenna system (FAS) assisted semantic communication system. In the considered model, a base station (BS) with multiple static antennas employs semantic extraction techniques to compress the data ready to be sent to a user. The user equipped with a fluid antenna is located in the near field coverage region of the BS. Our aim is to jointly optimize the transmit beamforming and the semantic compression rate at the BS, as well as the selection of activated ports in FAS, to maximize the equivalent transmission ratio under a specific power budget. We design an alternating algorithm to solve the problem, where we obtain the optimal semantic compression ratio is in closed form at each step. Simulation results validate the effectiveness of the proposed algorithm.

Figures

Figures reproduced from arXiv: 2506.22943 by the authors.

Figure 1
Figure 1. Number of iterations versus equivalent rate. [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

11 extracted references · 8 canonical work pages

  1. [1]

    Performance limits of fluid antenna systems,

    K. K. Wong, A. Shojaeifard, K.-F. Tong, and Y . Zhang, “Performance limits of fluid antenna systems,” IEEE Communications Letters , vol. 24, no. 11, pp. 2469–2472, 2020

    2020

  2. [2]

    Toward liquid reconfigurable antenna arrays for wireless communications,

    J. O. Mart ´ınez, J. R. Rodr ´ıguez, Y . Shen, K.-F. Tong, K.-K. Wong, and A. G. Armada, “Toward liquid reconfigurable antenna arrays for wireless communications,” IEEE Communications Magazine , vol. 60, no. 12, pp. 145–151, 2022

    work page 2022

  3. [3]

    Fluid antenna enabling secret communications,

    B. Tang, H. Xu, K.-K. Wong, K.-F. Tong, Y . Zhang, and C.-B. Chae, “Fluid antenna enabling secret communications,” IEEE Communications Letters, vol. 27, no. 6, pp. 1491–1495, 2023

    work page 2023

  4. [4]

    Joint beamforming and antenna design for near-field fluid antenna system,

    Y . Chen, M. Chen, H. Xu, Z. Yang, K.-K. Wong, and Z. Zhang, “Joint beamforming and antenna design for near-field fluid antenna system,” IEEE Wireless Communications Letters , vol. 14, no. 2, pp. 415–419, 2025

    work page 2025

  5. [5]

    Full- duplex cooperative noma-based mmwave networks with fluid antenna system (fas) receivers,

    L. Tlebaldiyeva, S. Arzykulov, T. A. Tsiftsis, and G. Nauryzbayev, “Full- duplex cooperative noma-based mmwave networks with fluid antenna system (fas) receivers,” in 2023 International Balkan Conference on Communications and Networking (BalkanCom) , 2023, pp. 1–6

    work page 2023

  6. [6]

    Rate Maximization for Fluid Antenna System Assisted Semantic Communication

    and semantic communication (SC). Instead of bit-level correctness, SC aims at guaranteeing the meaning of the information being conveyed correctly. There has been various artificial intelligence (AI) driven implement for SC for text, speech and multi-media [7]. To further express the semantic information hidden, knowledge graph and probability graph S. Li...

    work page Pith review arXiv 2025

  7. [7]

    A universal framework of superimposed ris-phase modulation for miso communication,

    J. Yao, J. Xu, W. Xu, C. Yuen, and X. You, “A universal framework of superimposed ris-phase modulation for miso communication,” IEEE Transactions on V ehicular Technology, vol. 72, no. 4, pp. 5413–5418, 2023

    work page 2023

  8. [8]

    Generative ai-driven semantic communication networks: Architecture, technologies, and applications,

    C. Liang, H. Du, Y . Sun, D. Niyato, J. Kang, D. Zhao, and M. A. Imran, “Generative ai-driven semantic communication networks: Architecture, technologies, and applications,” IEEE Transactions on Cognitive Com- munications and Networking , vol. 11, no. 1, pp. 27–47, 2025

    work page 2025

Show all 11 references
  1. [9]

    Semantic communication with probability graph: A joint communication and com- putation design,

    Z. Zhao, Z. Yang, Q.-V . Pham, Q. Yang, and Z. Zhang, “Semantic communication with probability graph: A joint communication and com- putation design,” in 2023 IEEE 98th V ehicular Technology Conference (VTC2023-Fall), 2023, pp. 1–5

    2023

  2. [10]

    Compression ratio allocation for probabilistic semantic communication with RSMA,

    Z. Zhao, Z. Yang, Y . Hu, C. Zhu, M. Shikh-Bahaei, W. Xu, Z. Zhang, and K. Huang, “Compression ratio allocation for probabilistic semantic communication with RSMA,” IEEE Trans. Commun. , pp. 1–1, 2025

    2025

  3. [11]

    On nonlinear fractional programming,

    W. Dinkelbach, “On nonlinear fractional programming,” Manage. Sci., vol. 13, no. 7, p. 492–498, Mar. 1967. [Online]. Available: https://doi.org/10.1287/mnsc.13.7.492

    1967 doi

Pith tools

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