Pith. sign in

REVIEW 3 major objections 3 minor 17 references

Robust Movable-Antenna Position Optimization with Imperfect CSI for MISO Systems

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

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

Pith's one-line read Under imperfect CSI, robust movable-antenna placement reduces to maximizing the estimated channel norm.

desk verdict Norm-bounded part is clean; random-error MRT optimality is conditional and the abstract overstates it. read the letter →

arxiv 2505.07035 v1 pith:FFE4MVUN submitted 2025-05-11 cs.IT eess.SPmath.IT

Haifeng Ma , Weidong Mei , Xin Wei , Boyu Ning , Zhi Chen This is my paper · ORCID
classification cs.ITeess.SPmath.IT
keywords movableantennasrobustoptimizationimperfectCSIBernstein-typeinequalitymaximum-ratiotransmissionantennapositionoutageprobabilityMISOsystems
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

This letter asks whether movable-antenna (MA) systems keep their advantage when the channel estimates used to place the antennas are imperfect. For norm-bounded CSI errors it derives the worst-case received power in closed form, and for Gaussian-distributed errors it uses a Bernstein-type inequality to obtain a tractable lower bound on the non-outage received power. It then shows that in both cases maximum-ratio transmission (MRT) is optimal, so the robust placement problem collapses to the same task as in the perfect-CSI case: maximize the squared norm of the estimated channel over the allowed antenna positions. Because that task has an exact polynomial-time graph-based solution, the robust problem inherits it. A direct consequence argued in the paper is that optimized MA positions under imperfect CSI can outperform fixed-antenna arrays running under perfect CSI.

What carries the argument

The load-bearing identity is the triangle-type lower bound $|\omega^H(\hat{\mathbf h}+\mathbf e)|^2 \ge (|\omega^H\hat{\mathbf h}|-|\omega^H\mathbf e|)^2$, with equality attainable by choosing $\mathbf e=-\delta\hat{\mathbf h}/\|\hat{\mathbf h}\|$, which converts the semi-infinite worst-case constraint into a one-dimensional shrinkage term. For the Gaussian model, the Bernstein-type inequality in Lemma 1 converts the probabilistic constraint into the convex deterministic inequality (16), which in turn becomes the scalar function $F(y)$ of the beamformed estimated-channel power $y$. The reduction works by showing $F$ is monotone in $y$ in the relevant regime, forcing MRT and leaving only the channel-norm maximization that the graph-based algorithm solves.

What would settle it

For a small instance (say $N=3$, $M=20$), enumerate all position subsets satisfying the minimum-distance constraint, compute the exact outage probability of the MRT beamformer for the Gaussian error model by Monte Carlo, and compare against the Bernstein-approximate optimum; if any subset yields a higher true non-outage SNR than the graph-based solution, the optimality claim for the random-error case fails.

Watch

Extended reading notes

Core claim

The central claim is that robust MA position optimization in a MISO downlink has a common reduced form for the two standard imperfect-CSI models. For norm-bounded error with $\|\mathbf e\|\le\delta$, the worst-case received power is $(|\omega^H\hat{\mathbf h}|-\delta\|\omega\|)^2$ when positive and zero otherwise; with MRT this becomes $P_{\max}(\|\hat{\mathbf h}\|-\delta)^2$, so positions should maximize $\|\hat{\mathbf h}\|^2$. For Gaussian error, replacing the outage constraint by the Bernstein-type bound of Lemma 1 turns the problem into maximizing a scalar function $F(y)$ of $y=|\hat{\mathbf h}^H\omega_0|^2$; whenever the feasible region is in the regime where $F$ is increasing (in particular for $\rho\ge e^{-1/2}$, or for small $\rho$ when the estimated channel norm is large enough), the optimum again uses MRT and maximizes $\|\hat{\mathbf h}\|^2$. Thus the robust placement problem is optimally solved by the same graph-based algorithm used for perfect CSI, applied to estimated channels, and the resulting placement can offset the estimation error enough to beat fixed antennas under perfect CSI.

Load-bearing premise

The load-bearing premise is that the Bernstein-type bound in Lemma 1 is tight enough that optimizing the approximate problem (17) still gives genuinely optimal, or near-optimal, MA positions and MRT for the true outage-constrained problem (6); the paper proves only a sufficient condition and does not bound the gap.

Editorial extensions

If this is right

  • For norm-bounded CSI errors, the worst-case SNR is computable in closed form and the optimal transmit vector is MRT; the only remaining decision is which sampling points the antennas occupy.
  • For Gaussian CSI errors under the stated conditions, the same MRT-plus-channel-norm-maximization structure holds for the Bernstein approximation, so the graph algorithm returns the optimal approximate positions in $O(NM^2)$ time.
  • Because MA position optimization enlarges the estimated channel norm, the robustness margin $\|\hat{\mathbf h}\|-\delta$ is larger than for fixed antennas, which is why MA systems can beat perfect-CSI fixed antennas when the error threshold is moderate.
  • When the outage probability or CSI variance is large enough that the channel-norm regime condition fails, the approximation can yield a negative non-outage SNR bound, indicating the system should not rely on that placement and beamformer pair.

Reading between the lines

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

  • Going beyond the paper, if the Bernstein bound is loose, a non-MRT beamformer could improve the true outage performance in low-channel-norm regimes; evaluating the exact outage probability at the returned positions would test this.
  • Going beyond the paper, any CSI error model whose lower bound on received power is an increasing function of $\|\hat{\mathbf h}\|$ would inherit the same channel-norm placement rule, extending the graph algorithm's reach.
  • Going beyond the paper, the reduction is unlikely to survive multi-user or MIMO extensions, where beamformers interact; robust placement there would require a joint beamformer-position search.
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 / 3 minor

Summary. This letter considers robust movable-antenna (MA) position optimization for a MISO system under imperfect channel state information (CSI). Two CSI error models are treated: norm-bounded errors and Gaussian-distributed random errors. For the norm-bounded model, the worst-case received signal power is derived in closed form, and it is shown that maximum-ratio transmission (MRT) is optimal; the problem then reduces to maximizing the squared norm of the estimated channel, which is solved by a graph-based algorithm from the authors' prior work. For the random-error model, a Bernstein-type inequality is used to approximate the outage constraint by a deterministic lower bound, and it is argued that, under certain conditions, MRT remains optimal and the same graph-based channel-norm maximization applies. Numerical results show that the proposed MA scheme can outperform some fixed-antenna benchmarks operating under perfect CSI. The paper's core norm-bounded derivation is sound, but the random-error part contains overclaimed optimality and a gap between the approximated and true problems.

Significance. If the claims are properly qualified, the paper makes a useful contribution by extending MA position optimization to imperfect CSI, an important practical issue. The norm-bounded worst-case analysis (Section III) is clean: the lower bound (8) is tight with e = -δĥ/‖ĥ‖, and the reduction to channel-norm maximization via MRT is valid. The use of the graph-based solver from [12] gives an efficient and exact solution for the norm-bounded problem. The random-error part depends on an approximation, and the paper's unconditional statements about MRT optimality and optimal MA placement are not currently justified. With a revised presentation that spells out the conditions under which MRT is optimal and clearly separates the approximated problem from the true outage-constrained problem, the letter would be a solid contribution; as written, the central claim is overstated.

major comments (3)
  1. [Section IV-B, Eqs. (20)-(22); Abstract and Conclusion] The claim that MRT is optimal for randomly distributed CSI errors is only conditional and contradicts the unconditional wording in the abstract ('we show the optimality of the MRT for imperfect CSI in both scenarios') and conclusion ('MRT is optimal for both types of CSI errors in general'). For 0 < ρ < e^{-1/2}, F(y) is convex and decreases on [0, y0] before increasing; hence the maximum of F(y) over [0, ymax] is attained at an endpoint, not necessarily at ymax. The paper itself states that if ymax < y1, the optimal y is either 0 or ymax, and the maximum R0 may be negative. In that case MRT is not optimal for the approximated problem (17), and the graph-based channel-norm maximization solving (12) is not the solution. The paper provides no proof that ymax ≥ y1 for the considered numerical scenarios and no algorithm for the complementary case. The abstract, conclusion, and Section V statements must be qualified, or an explicit condition (and a way to verify it) must be added.
  2. [Section IV-A, Lemma 1 and Eq. (16); Section IV-B, Eq. (17)] The Bernstein-type inequality is only a sufficient condition for the outage constraint (15), so the optimal solution of the approximated problem (17) is not guaranteed to be optimal, or even feasible, for the true non-outage problem (6). The paper does not bound the gap between the two problems. Since the abstract and Section I describe the proposed scheme as obtaining 'the optimal MA positions' for the random-error case, this is a load-bearing gap. The authors should explicitly state that (17) is an approximation, present any available tightness guarantees from [14], or verify through numerical experiments that the approximation is tight in the considered operating regimes.
  3. [Section IV-A, Eq. (16) and Section IV-B, Eq. (18)-(19)] There is an internal inconsistency between Lemma 1 as printed and the subsequent derivation. Equation (16) reads Tr(Q) − √(2 ln(1/ρ))(‖Q‖2 + 2‖r‖2) + s ≥ 0, while Eq. (18) defines ‖Q‖2 and ‖r‖2 as squared norms. Substituting those definitions into (16) gives σ²Pmax − √(2 ln(1/ρ))(σ⁴Pmax² + 2σ²Pmax²|ĥ^H ω0|²) + Pmax|ĥ^H ω0|² ≥ R0, which is not what Eq. (19) states. The standard Bernstein-type concentration inequality (as in [14]) involves the square root of ‖Q‖_F² + 2‖r‖², which is what Eq. (19) appears to use. This needs to be corrected in Lemma 1, and the notation for norms should be made unambiguous; as printed, the stated Lemma does not imply the convex approximation used in the rest of the paper.
minor comments (3)
  1. [Eq. (18)] The notation ‖Q‖2 is overloaded: Eq. (18) computes ‖Q‖2 = σ⁴Pmax², which is the squared Frobenius norm, not a standard norm. Please use ‖Q‖_F² and ‖r‖² explicitly to avoid confusion.
  2. [Abstract and Section V, Fig. 4] The abstract claims the proposed scheme can outperform 'other benchmark schemes implemented under perfect CSI conditions,' but the numerical results in Fig. 4 only demonstrate outperformance relative to FPAs without antenna selection under perfect CSI. Please clarify the scope of the claim.
  3. [Section IV-B, final paragraph] The sentence 'the MA position optimization helps enhance the channel norm ‖h‖², as well as the robustness against the CSI error for a given y1' is unclear; y1 is not a user-specified parameter but a function of σ² and ρ. Rephrase to state that a larger channel norm makes it more likely that ymax ≥ y1.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity found; the robust-to-channel-norm reductions are derived in-paper, and the cited graph solver is independent prior work.

full rationale

The paper's claimed derivations are self-contained. For the norm-bounded model, the worst-case power identity (Eqs. (7)-(10)) is proven in-paper via the reverse triangle inequality plus an explicit maximally destructive error choice, and MRT optimality follows from maximizing (|w^H h| - delta||w||) for fixed h. The subsequent reduction to maximizing ||h||^2 is algebraic, not an input assumption. For the random-error model, Lemma 1 is an externally known Bernstein-type bound cited to [14]; replacing the outage constraint (15) with (16) is a clearly labeled sufficient approximation, and maximizing F(y) is then a calculus exercise. The graph-based solver of [12] is reused to solve the channel-norm maximization subproblem, which is a previously published algorithm for a different (perfect-CSI) problem; this self-citation is load-bearing only for the solver's optimality, not for the robust-to-nominal reduction, and it does not smuggle in the paper's conclusion. The paper does contain a correctness gap: in Section IV-B, for 0<rho<e^{-1/2}, MRT is optimal only if ymax>=y1, a condition not proven or stated in the abstract; this is an overclaim, not circularity. No fitted parameter is relabeled as a prediction, and no uniqueness theorem from the authors is used to forbid alternatives.

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

No free parameters are fitted to data; simulation parameters (N, L, dmin, λ, path counts) are standard settings. The central derivation is self-contained aside from the cited graph algorithm and Bernstein inequality.

assumptions (4)
  • domain assumption The transmitter has access to channel estimates ĥ_m for every sampling point, with errors modeled as norm-bounded (‖e‖≤δ) or i.i.d. complex Gaussian (e~CN(0,σ²I)).
    Section II-A/B: the robust optimization operates on the estimated channel map; if the estimation error model is wrong (e.g., spatially correlated), the robust guarantees do not hold.
  • domain assumption The graph-based algorithm from the authors' prior work [12] exactly solves the discrete channel-norm maximization problem (12) in O(NM²) time.
    Section III: the optimal MA positions for (11)/(17) are inherited from [12]; the proof is not reproduced in this letter.
  • standard math Bernstein-type inequality (Lemma 1) holds in the stated form for complex Gaussian quadratic forms.
    Section IV-A: the paper relies on [14] for the inequality; it is a known sufficient condition, not proved here.
  • domain assumption The channel is slowly varying so antenna movement delay is negligible, and the linear transmit array can be uniformly sampled into M discrete positions with minimum spacing avoiding mutual coupling.
    Section II-A: these modeling choices define the feasible set of the optimization.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Robust Movable-Antenna Position Optimization with Imperfect CSI for MISO Systems." pith.science (2026). https://pith.science/paper/FFE4MVUN

@misc{pith2026250507035,
  author       = {Pith},
  title        = {Pith review of: Robust Movable-Antenna Position Optimization with Imperfect CSI for MISO Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FFE4MVUN}},
  note         = {Machine review of arXiv:2505.07035}
}
read the original abstract

Movable antenna (MA) technology has emerged as a promising solution for reconfiguring wireless channel conditions through local antenna movement within confined regions. Unlike previous works assuming perfect channel state information (CSI), this letter addresses the robust MA position optimization problem under imperfect CSI conditions for a multiple-input single-output (MISO) MA system. Specifically, we consider two types of CSI errors: norm-bounded and randomly distributed errors, aiming to maximize the worst-case and non-outage received signal power, respectively. For norm-bounded CSI errors, we derive the worst-case received signal power in closed-form. For randomly distributed CSI errors, due to the intractability of the probabilistic constraints, we apply the Bernstein-type inequality to obtain a closed-form lower bound for the non-outage received signal power. Based on these results, we show the optimality of the maximum-ratio transmission for imperfect CSI in both scenarios and employ a graph-based algorithm to obtain the optimal MA positions. Numerical results show that our proposed scheme can even outperform other benchmark schemes implemented under perfect CSI conditions.

Figures

Figures reproduced from arXiv: 2505.07035 by the authors.

Figure 1
Figure 1. MA MISO system with imperfect CSI further performance enhancement. In the context of MA posi￾tion optimization, prior research has predominantly employed gradient-based algorithms to optimize MA positions assuming the field-response channel model [11]. In contrast, the authors in [12] discretized the movable region into multiple sampling points and proposed a graph-based algorithm to select an optimal subset of thes… view at source ↗
Figure 2
Figure 2. Illustrations of F′ (y) under different values of ρ B. Proposed Solution to Problem (17) As r = σWh and Q = σ 2W, we can obtain Tr(Q) = Tr(σ 2ωωH) = σ 2Pmax kQk 2 = kσ 2Wk 2 F = Tr(σ 4WWH) = σ 4P 2 max krk 2 =kσωωHhk 2 = σ 2P 2 max|h H ω0| 2 , (18) where ω0 = ω/ √ Pmax. Hence, the constraints in (16) can be simplified as σ 2Pmax − r 2 ln 1 ρ · q σ 4P2 max + 2σ 2P2 max|h H ω0| 2 +Pmax|h H ω0| 2 ≥ R0. (19) Let y = |h … view at source ↗
Figure 4
Figure 4. Worst-case and non-outage received SNRs versus diffe [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

17 extracted references · 14 canonical work pages

  1. [12]

    Movable-an tenna po- sition optimization: A graph-based approach,

    W. Mei, X. Wei, B. Ning, Z. Chen and R. Zhang, “Movable-an tenna po- sition optimization: A graph-based approach,” IEEE Wireless Commun. Lett., vol. 13, no. 7, pp. 1853-1857, July 2024

    work page 2024

  2. [14]

    Outage constrained robust transmit o ptimization for multiuser MISO downlinks: Tractable approximations by conic optimization,

    K. -Y . Wang et al. “Outage constrained robust transmit o ptimization for multiuser MISO downlinks: Tractable approximations by conic optimization,” IEEE Trans. Signal Process. , vol. 62, no. 21, pp. 5690- 5705, Nov. 2014

    work page 2014

  3. [1]

    An overview of enhanced massive MIMO with array signal processing techniques,

    M. Wang, F. Gao, S. Jin and H. Lin, “An overview of enhanced massive MIMO with array signal processing techniques,” IEEE J. Sel. Top. Signal Process., vol. 13, no. 5, pp. 886-901, Sept. 2019

    work page 2019

  4. [2]

    Movable antennas for wireless commu- nication: Opportunities and challenges,

    L. Zhu, W. Ma and R. Zhang, “Movable antennas for wireless commu- nication: Opportunities and challenges,” IEEE Commun. Mag. , vol. 62, no. 6, pp. 114-120, June 2024

    work page 2024

  5. [3]

    A tutorial on movable antennas for wireles s networks,

    L. Zhu et al., “A tutorial on movable antennas for wireles s networks,” IEEE Commun. Surveys Tuts. , early access

    work page

  6. [4]

    MIMO capacity characterizat ion for movable antenna systems,

    W. Ma, L. Zhu, and R. Zhang, “MIMO capacity characterizat ion for movable antenna systems,” IEEE Trans. Wireless Commun. , vol. 23, no. 4, pp. 3392-3407, Sep. 2024

    work page 2024

  7. [5]

    Flexible pr ecoding for multi-user movable antenna communications,

    S. Y ang, W. Lyu, B. Ning, Z. Zhang and C. Y uen, “Flexible pr ecoding for multi-user movable antenna communications,” IEEE Wireless Commun. Lett., vol. 13, no. 5, pp. 1404-1408, May 2024

    work page 2024

  8. [6]

    Joint beamforming and antenna position op timization for movable antenna-assisted spectrum sharing,

    X. Wei et al., “Joint beamforming and antenna position op timization for movable antenna-assisted spectrum sharing,” IEEE Wireless Commun. Lett. , vol. 13, no. 9, pp. 2502-2506, Sept. 2024

    work page 2024

Show all 17 references
  1. [7]

    Mov able- antenna-array-enabled communications with CoMP receptio n,

    G. Hu, Q. Wu, J. Ouyang, K. Xu, Y . Cai and N. Al-Dhahir, “Mov able- antenna-array-enabled communications with CoMP receptio n,” IEEE Commun. Lett. , vol. 28, no. 4, pp. 947-951, Apr. 2024

    2024

  2. [8]

    Movable antenna-assisted integrated sensing and communication systems,

    C. Jiang, et al., “Movable antenna-assisted integrated sensing and communication systems,” IEEE Trans. Wireless Commun. , early access

  3. [9]

    Rotatable antenna enabled wire- less communication: Modeling and optimization,

    B. Zheng, Q. Wu, and R. Zhang, “Rotatable antenna enabled wire- less communication: Modeling and optimization,” arXiv preprint arXiv:2501.02595, Jan. 2025

    2025

  4. [10]

    6D movable antenna base d on user distribution: Modeling and optimization,

    X. Shao, Q. Jiang, and R. Zhang, “6D movable antenna base d on user distribution: Modeling and optimization,” IEEE Trans. Wireless Commun., vol. 24, no. 1, pp. 355-370, Jan. 2025

    2025

  5. [11]

    Modeling and performance ana lysis for movable antenna enabled wireless communications,

    L. Zhu, W. Ma and R. Zhang, “Modeling and performance ana lysis for movable antenna enabled wireless communications,” IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 6234-6250, June 2024

    2024

  6. [13]

    A framework of robust transmission desi gn for IRS- aided MISO communications with imperfect cascaded channel s,

    G. Zhou et al., “A framework of robust transmission desi gn for IRS- aided MISO communications with imperfect cascaded channel s,” IEEE Trans. Sig. Process. , vol. 68, pp. 5092-5106, 2020

    2020

  7. [15]

    Successive baye sian reconstructor for channel estimation in fluid antenna syste ms,

    Z. Zhang, J. Zhu, L. Dai and R. W. Heath, “Successive baye sian reconstructor for channel estimation in fluid antenna syste ms,” IEEE Trans. Wireless Commun. , vol. 24, no. 3, pp. 1992-2006, Mar. 2025

    1992

  8. [16]

    Channel estimation for FAS-assisted mult iuser mmWave systems,

    H. Xu et al., “Channel estimation for FAS-assisted mult iuser mmWave systems,” IEEE Commun. Lett. , vol. 28, no. 3, pp. 632-636, Mar. 2024

    2024

  9. [17]

    Channel estimation for movable-anten na MIMO systems via tensor decomposition,

    R. Zhang et al., “Channel estimation for movable-anten na MIMO systems via tensor decomposition,” IEEE Wireless Commun. Lett. , vol. 13, no. 11, pp. 3089-3093, Nov. 2024

    2024

Pith tools

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