betaFeedback

WorksEngineering

Joint Movable Antenna Positioning and Precoding for ISAC via a Two-Timescale Model-Based GNN

Abstract

Movable antennas (MAs) allow an integrated sensing and communication (ISAC) base station (BS) to reshape multiuser channels and angular sensitivity. For monostatic multiuser communication and multi-target elevation and azimuth estimation, we minimize the expected target-averaged angular Bayesian Cramér-Rao bound (BCRB) subject to per-user block-level and long-term rate requirements. To avoid repeated online optimization, we propose a two-timescale model-based graph neural network (TT-MBGNN) over antennas, users, and targets. The slow policy selects positions from long-term statistics to reduce movement overhead, while the fast policy learns complex corrections to a regularized zero-forcing (RZF) reference using post-movement channels and target-angle priors. We jointly train both policies through a differentiable model of rates and BCRB, without optimization-generated labels. Across tested rate requirements, the network yields lower sensing bounds than variants using a fixed array, RZF, or both, with any-user fast-rate violations in 0.31-2.63% of test blocks. Frozen policies provide competitive sensing bounds for unseen user and target counts, and ten fine-tuning epochs improve communication reliability at higher user counts. Across tested network sizes, our framework achieves up to 3 dB lower BCRB than an idealized alternating-optimization benchmark that uses known target reflection coefficients. The network computes precoders approximately 50-fold faster in matched batch-one tests.

Introduction

Integrated sensing and communication (ISAC) supports communication and environmental sensing through shared radio frequency (RF) components, transmitted signals, and spectral resources [1, 2]. This integration can improve spectral and hardware efficiency, while the base station (BS) array geometry shapes both communication and sensing performance. Most existing systems employ fixed-position antennas (FPAs) whose element locations remain unchanged after deployment. Digital precoding controls the complex antenna excitations, while the spatial sampling positions remain set by the deployed geometry. Consequently, fixed geometries limit the flexibility to reshape multiuser channel correlations, mitigate interference, and adjust the effective sensing aperture.

Movable antenna (MA) technology addresses this limitation by allowing antenna elements or subarrays to change their positions within prescribed movement regions [3, 4]. Closely related position-reconfigurable architectures are also studied under the fluid antenna system (FAS) terminology [4]–[6]. The FAS concept includes liquid conductors, switchable ports, reconfigurable pixels, and mechanically repositioned antennas. This paper specifically considers MAs with continuously adjustable physical coordinates. Such reconfiguration can improve channel gains, reduce multiuser interference, and reshape the sensing response without increasing the number of RF chains. These benefits have motivated joint position and beamforming designs for communication systems [3, 7] and for ISAC systems based on sensing signal to interference and noise ratio (SINR), beampattern, or Cramér-Rao bound (CRB) objectives [8]–[11]. However, antenna positions enter the communication channels and sensing steering vectors through nonlinear phase terms and are tightly coupled with the precoders. The resulting nonconvex problems are commonly addressed using iterative combinations of alternating optimization (AO), successive convex approximation (SCA), majorization-minimization (MM), penalty or dual-decomposition methods, and gradient-based updates [7]–[9], [11, 12].

A further challenge arises from the different adaptation rates of mechanical positioning and electronic precoding. Moving the antennas in every coherence block can incur excessive delay and positioning overhead [10, 13]. Moreover, directly measuring instantaneous channels across many candidate antenna positions entails additional acquisition overhead. These limitations motivate slow-timescale positioning using user equipment (UE)-location distributions and long-term propagation statistics, followed by fast precoding using instantaneous channel state information (CSI) acquired at the selected geometry [10, 14]. In our formulation, the slow inputs additionally include target-prior statistics. The sensing objective must also account for block-dependent uncertainty in the target directions. The Bayesian Cramér-Rao bound (BCRB) incorporates prior information into estimation-error bounds [15]. We use this bound as a common sensing criterion, with the slow geometry evaluated across block states and the fast precoder adapted to the current prior.

Existing optimization-based studies address complementary aspects of joint positioning and beamforming. The hybrid architecture in [7] jointly optimizes movable-subarray positions and analog and digital beamformers. Slow positioning based on localized user regions and statistical CSI is studied in [10], while discrete and continuous two-timescale designs are developed in [13, 14]. A recent cell-free multiple-input multiple-output (MIMO) design also optimizes antenna positions and

A. Fadakar and A. F. Molisch are with the Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, California, USA; E-mail: {fadakarg,molisch}@usc.edu.

Y. Zhang is with the Electrical and Computer Engineering Program, Computer, Electrical and Mathematical Sciences and Engineering (CEMSE), King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Kingdom of Saudi Arabia; E-mail: [email protected].

This work is supported by the National Science Foundation (Grants 2504811, 2292535 and 2433981). (Corresponding author: Yuchen Zhang.) orientations using global statistical CSI, while updating decentralized beamformers on a faster timescale [16]. These studies establish the value of coordinating mechanical positioning and electronic precoding across different timescales.

Existing iterative designs typically require repeated optimization as operating conditions change, increasing online computational cost. Learning-based methods address this limitation by transferring much of the optimization effort to offline training [17], [18]. In particular, graph neural networks (GNNs) represent interactions among network entities through shared message functions and have been applied to beamforming, power allocation, and energy-efficiency optimization [19], [20]. Shared parameters also allow the same graph-layer structure to accommodate different numbers of users and targets. Heterogeneous graph architectures for cell-free and cooperative ISAC generally assume fixed antenna geometries [21]–[23].

For MA and FAS systems, learning-based studies have explored multi-agent and deep reinforcement learning, generative learning, and hierarchical policies for movement, port selection, and beamforming [24]–[27]. The graph-based designs in [28], [29] address positioning and beamforming without separating statistical geometry selection from block-adaptive precoding, while the two-timescale deep-unfolding method in [30] considers communication objectives. Supervised alternatives based on optimization-generated labels also incur the cost of repeatedly executing a numerical solver. A model-based graph neural network (MBGNN) can embed differentiable physical models into training [20], enabling direct objective evaluation without these labels. A gap therefore remains in jointly learning long-term positioning and geometry-dependent precoding for Bayesian multi-target angle estimation under communication requirements at both timescales.

Motivated by these observations, we propose a two-timescale model-based graph neural network (TT-MBGNN) for monostatic MA-assisted ISAC. The slow-timescale model-based graph neural network (S-MBGNN) selects a common geometry from long-term statistics, and the fast-timescale model-based graph neural network (F-MBGNN) adapts the precoder to current block information. Both policies are trained jointly without optimization-generated labels through a differentiable model that evaluates communication rates and target-averaged angular BCRBs. The KK user data streams also support sensing, without dedicated sensing streams [1], [11], [12]. Target ranges and reflection coefficients enter only the sensing model and are excluded from the policy inputs.

Main Contributions

The main contributions are summarized as follows.

  • We formulate a two-timescale stochastic design for monostatic MA-assisted ISAC. One continuous antenna geometry is chosen per slow interval from UE-location and channel statistics, target-angle prior statistics, and long-term rate requirements. Each block precoder adapts to post-movement CSI, current target priors, and fast-timescale rate requirements. The objective minimizes the expected target-averaged angular BCRB subject to per-UE block and long-term rate requirements, transmit power, antenna movement, and minimum-spacing constraints.

  • We develop a heterogeneous TT-MBGNN with an S-MBGNN for geometry selection and an F-MBGNN for block-adaptive precoding. Relation-specific messages combine attention and mean aggregation over MA, UE, and target nodes, and complex MA-UE channels affect the fast policy as edge features. The proposed decoder learns entrywise complex corrections to a regularized zero-forcing (RZF) reference and normalizes the resulting precoder to meet the power limit. Shared parameters make the graph layers equivariant to consistent node relabeling at inference and support different node counts without changing the layer parameterization.

  • We train both policies jointly without optimization-generated labels. A differentiable communication-sensing model evaluates block rates and angular BCRBs, providing block-specific precoder gradients and a sample-average sensing objective for the common geometry. One-sided augmented-Lagrangian losses and projected multiplier updates address fast and slow quality-of-service (QoS) requirements and raw antenna spacing. Structured outputs satisfy the power and movement-region limits. Although the proposed finite geometry repair does not provide a universal spacing guarantee, every repaired geometry checked in the reported simulations met the minimum antenna spacing requirement.

  • Simulations on unseen realizations demonstrate lower sensing bounds than learned-component ablations and fixed-array RZF across the tested QoS levels. Across the evaluated network-size configurations, including fine-tuned policies, the proposed framework achieves up to 3 dB lower angular BCRB than the idealized sample-average-approximation-based alternating optimization (SAA-AO) benchmark. Frozen policies provide competitive sensing bounds at unseen user and target counts, while ten additional epochs improve communication reliability at larger user counts. Batch-one per-block precoder computation is approximately 50 times faster than iterative refinement in the considered scenario.

Notation: Scalars, vectors, and matrices are denoted by regular lowercase, boldface lowercase, and boldface uppercase letters, respectively, while calligraphic letters denote sets or mappings as defined in context. The superscripts (⋅)T(\cdot)^{\mathsf{T}} and (⋅)H(\cdot)^{\mathsf{H}} represent transpose and Hermitian transpose, respectively, and j=−1j=\sqrt{-1}. The operators ℜ{⋅}\Re\{\cdot\}, ℑ{⋅}\Im\{\cdot\}, and ∣⋅∣|\cdot| return the real part, imaginary part, and scalar magnitude. The symbols ∥⋅∥2\|\cdot\|_{2} and ∥⋅∥F\|\cdot\|_{\mathrm{F}} denote the Euclidean and Frobenius norms, respectively. The n×nn\times n identity matrix is denoted by In\mathbf{I}_{n}, and 1n\mathbf{1}_{n} is the nn-dimensional all-ones vector. We use col⁡(⋅)\operatorname{col}(\cdot) for vertical stacking of scalar or vector arguments, ∥\| for concatenation, and ⊙\odot for the Hadamard product. Finally, [x]+=max⁡{x,0}[x]_{+}=\max\{x,0\} denotes the positive-part operator, ∣S∣|S| is the cardinality of set SS, and ΠC(⋅)\Pi_{\mathcal{C}}(\cdot) denotes Euclidean projection onto the set C\mathcal{C}.

System and Signal Model

As illustrated in Figure 1, we consider a monostatic ISAC system in which a dual-functional BS, equipped with NN continuously adjustable MAs and NN dedicated RF chains, serves KK single-antenna UEs while supporting two-dimensional (2D) direction of arrival (DOA) estimation for QQ point targets in elevation and azimuth1. The corresponding index sets are N≜{1,…,N}\mathcal{N} \triangleq\{1,\ldots,N\}, K≜{1,…,K}\mathcal{K} \triangleq\{1,\ldots,K\}, and Q≜{1,…,Q}\mathcal{Q} \triangleq\{1,\ldots,Q\}. We adopt a two-timescale positioning and precoding design in which the antenna geometry is selected using long-term statistical information and held fixed over a positioning interval of BB transmission blocks, indexed by B≜{1,…,B}\mathcal{B} \triangleq\{1,\ldots,B\}. Each block contains TT symbol intervals, indexed by T≜{1,…,T}\mathcal{T} \triangleq\{1,\ldots,T\}. The digital precoder is updated in each block using the selected geometry and current block information. The statistical inputs remain valid throughout the positioning interval, whereas the instantaneous conditions are approximated as constant within each block and may vary between blocks. To describe spatial variability, we associate UE kk and target qq with spherical location regions

Figure 1. Considered monostatic MA-assisted ISAC with a continuous YZYZ-plane aperture. Shaded spheres denote long-term location regions, and markers illustrate block-dependent UE and nominal target locations. Teal arrows represent downlink transmission, while solid and dashed purple arrows denote probing and echoes, respectively. The common geometry R\mathbf{R} is selected from long-term statistics and held fixed for BB coherence blocks, whereas the precoder Wb\mathbf{W}_b is updated per block using current CSI and target-angle priors.

Gkue≜{p∈R3:∥p−pˉkue∥2≤rkue},(1)\mathcal{G}^{\mathrm{ue}}_k \triangleq\left\{\mathbf{p}\in\mathbb{R}^{3}:\|\mathbf{p}-\bar{\mathbf{p}}^{\mathrm{ue}}_k\|_2\le r^{\mathrm{ue}}_k\right\}, \tag*{(1)}
Gqtgt≜{p∈R3:∥p−pˉqtgt∥2≤rqtgt},(2)\mathcal{G}^{\mathrm{tgt}}_q \triangleq\left\{\mathbf{p}\in\mathbb{R}^{3}:\|\mathbf{p}-\bar{\mathbf{p}}^{\mathrm{tgt}}_q\|_2\le r^{\mathrm{tgt}}_q\right\}, \tag*{(2)}

where pˉkue,pˉqtgt∈R3\bar{\mathbf{p}}^{\mathrm{ue}}_k,\bar{\mathbf{p}}^{\mathrm{tgt}}_q\in\mathbb{R}^{3} are the region centers and rkue,rqtgt≥0r^{\mathrm{ue}}_k,r^{\mathrm{tgt}}_q\ge0 are their radii. These parameters specify the regional distributions, which remain unchanged within each positioning interval. In block bb, the UE and nominal target locations are sampled independently across users, targets, and blocks as

pk,bue∼Uvol(Gkue),pq,btgt∼Uvol(Gqtgt),(3)\mathbf{p}^{\mathrm{ue}}_{k,b}\sim\mathcal{U}_{\mathrm{vol}}(\mathcal{G}^{\mathrm{ue}}_k),\quad\mathbf{p}^{\mathrm{tgt}}_{q,b}\sim\mathcal{U}_{\mathrm{vol}}(\mathcal{G}^{\mathrm{tgt}}_q), \tag*{(3)}

where Uvol\mathcal{U}_{\mathrm{vol}} denotes the uniform distribution with respect to volume over the specified region. The sampled locations remain unchanged within a block. The nominal target location determines the center of the block-dependent angular prior introduced in Section II-D. Residual transmitter leakage and hardware-induced self-interference are assumed sufficiently suppressed and are omitted from the signal model [10].

Remark 1 (Statistical inputs and temporal information). As detailed in Section IV, we provide the F-MBGNN with current block information and the S-MBGNN with long-term statistical summaries available before antenna positioning. These summaries may be estimated from historical observations. Neither network explicitly processes an ordered block sequence or maintains a recurrent state. Under the stationary model, we use independent snapshots to estimate the statistical summaries and expected training loss. We leave explicit trajectory modeling and history-dependent policy learning for future work.

Movable-Antenna Array Architecture

A local Cartesian coordinate system is considered at the BS, with its boresight aligned with the positive XX-axis and the continuous antenna-movement region C⊂R2\mathcal{C}\subset\mathbb{R}^{2} located on the YZYZ-plane. The position of the nnth MA is rn=[yn,zn]T∈C\mathbf{r}_n=[y_n,z_n]^{\mathrm{T}}\in\mathcal{C}, with the corresponding three-dimensional coordinate rˉn=[0,yn,zn]T\bar{\mathbf{r}}_n=[0,y_n,z_n]^{\mathrm{T}}. The complete array geometry is collected as R≜[r1,…,rN]∈R2×N\mathbf{R}\triangleq[\mathbf{r}_1,\ldots,\mathbf{r}_N]\in\mathbb{R}^{2\times N}. The movement-region boundaries, minimum inter-antenna separation, and other physical constraints are specified in the optimization formulation. Let

ϑ=[ϑel,ϑaz]T\boldsymbol{\vartheta}=[\vartheta^{\mathrm{el}},\vartheta^{\mathrm{az}}]^{\mathrm{T}} denote a far-field 2D DOA, where ϑel∈[−π/2,π/2]\vartheta^{\mathrm{el}}\in[-\pi/2,\pi/2] is measured from the XYXY-plane toward the positive ZZ-axis and ϑaz∈[−π,π)\vartheta^{\mathrm{az}}\in[-\pi,\pi) is measured in the XYXY-plane from the positive XX-axis toward the positive YY-axis. The corresponding unit direction vector is defined as u(ϑ)=[cos⁡(ϑel)cos⁡(ϑaz),cos⁡(ϑel)sin⁡(ϑaz),sin⁡(ϑel)]T\mathbf{u}(\boldsymbol{\vartheta})=[\cos(\vartheta^{\mathrm{el}})\cos(\vartheta^{\mathrm{az}}),\cos(\vartheta^{\mathrm{el}})\sin(\vartheta^{\mathrm{az}}),\sin(\vartheta^{\mathrm{el}})]^{\mathrm{T}}. Because the antennas move only on the YZYZ-plane, define the projected direction vector as uˉ(ϑ)=[cos⁡(ϑel)sin⁡(ϑaz),sin⁡(ϑel)]T\bar{\mathbf{u}}(\boldsymbol{\vartheta})=[\cos(\vartheta^{\mathrm{el}})\sin(\vartheta^{\mathrm{az}}),\sin(\vartheta^{\mathrm{el}})]^{\mathrm{T}}. Hence, u(ϑ)Trˉn=uˉ(ϑ)Trn\mathbf{u}(\boldsymbol{\vartheta})^{\mathrm{T}}\bar{\mathbf{r}}_n=\bar{\mathbf{u}}(\boldsymbol{\vartheta})^{\mathrm{T}}\mathbf{r}_n. Under the far-field plane wave model, the position-dependent steering vector is

a(R,ϑ)=exp⁡(j2πλRTuˉ(ϑ))∈CN,(4)\mathbf{a}(\mathbf{R},\boldsymbol{\vartheta})=\exp\left(j\frac{2\pi}{\lambda}\mathbf{R}^{\mathrm{T}}\bar{\mathbf{u}}(\boldsymbol{\vartheta})\right)\in\mathbb{C}^{N}, \tag*{(4)}

where λ\lambda is the carrier wavelength and the exponential is applied element-wise. Unlike a conventional fixed array, the manifold in (4) is directly controlled by R\mathbf{R}. Consequently, moving the antennas modifies both the spatial correlations of the communication channels and the effective aperture and angular sensitivity available for target sensing.

Position-Dependent Geometric Rician Channel

For the downlink to UE kk, located at pk,bue∈Gkue\mathbf{p}^{\mathrm{ue}}_{k,b}\in\mathcal{G}^{\mathrm{ue}}_k in block bb, we adopt a narrowband far-field geometric Rician model for continuous MA coordinates [9, 10, 31]. Let βk,b>0\beta_{k,b}>0 denote the large-scale power gain, dk,bd_{k,b} the distance from the BS reference point to the UE, and ϑk,bLoS∈R2\boldsymbol{\vartheta}^{\mathrm{LoS}}_{k,b}\in\mathbb{R}^{2} the line-of-sight (LoS) departure direction. The corresponding propagation phase is ϕk,b=2πdk,b/λ\phi_{k,b}=2\pi d_{k,b}/\lambda, and the steering vector is ak,bLoS=a(R,ϑk,bLoS)∈CN\mathbf{a}^{\mathrm{LoS}}_{k,b}=\mathbf{a}(\mathbf{R},\boldsymbol{\vartheta}^{\mathrm{LoS}}_{k,b})\in\mathbb{C}^{N}. The scattered field is approximated by LNL_N effective non-line-of-sight (NLoS) clusters. For cluster ℓ\ell, let ϑk,b,ℓNLoS∈R2\boldsymbol{\vartheta}^{\mathrm{NLoS}}_{k,b,\ell}\in\mathbb{R}^{2} denote the nominal departure direction and gk,b,ℓ∼CN(0,1)g_{k,b,\ell}\sim\mathcal{CN}(0,1) the aggregate gain of unresolved diffuse contributions. Independent gains are assumed across clusters.2 Each cluster is represented by the nominal steering vector ak,b,ℓNLoS=a(R,ϑk,b,ℓNLoS)∈CN\mathbf{a}_{k,b,\ell}^{\mathrm{NLoS}}=\mathbf{a}(\mathbf{R},\vartheta_{k,b,\ell}^{\mathrm{NLoS}})\in\mathbb{C}^{N}. The channel vector hk,b∈CN\mathbf{h}_{k,b}\in\mathbb{C}^{N} is

hk,bH=βk,b(κk,bκk,b+1e−jϕk,b(ak,bLoS)T+1(κk,b+1)LN∑ℓ=1LNgk,b,ℓ(ak,b,ℓNLoS)T),(5)\mathbf{h}_{k,b}^{\mathrm{H}}=\sqrt{\beta_{k,b}}\left(\sqrt{\frac{\kappa_{k,b}}{\kappa_{k,b}+1}}e^{-j\phi_{k,b}}\left(\mathbf{a}_{k,b}^{\mathrm{LoS}}\right)^{\mathrm{T}}+\sqrt{\frac{1}{(\kappa_{k,b}+1)L_N}}\sum_{\ell=1}^{L_N}g_{k,b,\ell}\left(\mathbf{a}_{k,b,\ell}^{\mathrm{NLoS}}\right)^{\mathrm{T}}\right), \tag*{(5)}

where κk,b≥0\kappa_{k,b}\ge0 is the Rician factor in linear units, drawn from the prescribed long-term distribution. For ν∈{el,az}\nu\in\{\mathrm{el},\mathrm{az}\}, the angular-offset vector ϵk,bν∈RLN\boldsymbol{\epsilon}_{k,b}^{\nu}\in\mathbb{R}^{L_N} is drawn from N(0,(σNν)2ILN)\mathcal{N}(\mathbf{0},(\sigma_N^\nu)^2\mathbf{I}_{L_N}), independently between elevation and azimuth. Here, σNν>0\sigma_N^\nu>0 is the offset standard deviation in radians, and each offset has support on R\mathbb{R}. The ℓ\ellth offset is added to ϑk,bLoS,ν\vartheta_{k,b}^{\mathrm{LoS},\nu} to generate the corresponding cluster direction. The resulting azimuth is wrapped modulo 2π2\pi onto the adopted azimuth interval, while elevation is restricted to the valid domain of the elevation convention. Thus, the Gaussian law specifies the offsets before these domain mappings. Since the steering vectors are explicitly parameterized by the antenna coordinate matrix R\mathbf{R}, any modification to the MA geometry dynamically alters the phase of every geometric path. Ultimately, upon establishing R\mathbf{R}, the BS acquires the aggregate block-level channel matrix

Hb=[h1,b,…,hK,b]∈CN×K.(6)\mathbf{H}_b=[\mathbf{h}_{1,b},\ldots,\mathbf{h}_{K,b}]\in\mathbb{C}^{N\times K}. \tag*{(6)}

Transmitted and Received Signals

The UEs are served simultaneously using linear spatial division multiple access (SDMA). Let wk,b∈CN\mathbf{w}_{k,b}\in\mathbb{C}^{N} denote the precoder for UE kk and Wb=[w1,b,…,wK,b]∈CN×K\mathbf{W}_b=[\mathbf{w}_{1,b},\ldots,\mathbf{w}_{K,b}]\in\mathbb{C}^{N\times K} the block precoding matrix. The independent Gaussian data symbols are collected in db[t]∼CN(0,IK)\mathbf{d}_b[t]\sim\mathcal{CN}(\mathbf{0},\mathbf{I}_K), with independent draws across symbol intervals. The transmitted signal is

xb[t]=Wbdb[t]∈CN.(7)\mathbf{x}_b[t]=\mathbf{W}_b\mathbf{d}_b[t]\in\mathbb{C}^{N}. \tag*{(7)}

Conditioned on Wb\mathbf{W}_b, the signal covariance and average transmit-power constraint in each block are

Qx,b≜E[xb[t]xbH[t]∣Wb]=WbWbH,\mathbf{Q}_{x,b}\triangleq\mathbb{E}\left[\mathbf{x}_b[t]\mathbf{x}_b^{\mathrm{H}}[t]\mid\mathbf{W}_b\right]=\mathbf{W}_b\mathbf{W}_b^{\mathrm{H}},
tr⁡(Qx,b)=∥Wb∥F2≤Pmax⁡.(8)\operatorname{tr}(\mathbf{Q}_{x,b})=\|\mathbf{W}_b\|_{\mathrm{F}}^2\le P_{\max}. \tag*{(8)}

The same data-bearing signal is used for sensing, without additional dedicated sensing streams [11, 12]. The received signal at UE kk is

yk,b[t]=hk,bHWbdb[t]+zk,b[t],(9)y_{k,b}[t]=\mathbf{h}_{k,b}^{\mathrm{H}}\mathbf{W}_b\mathbf{d}_b[t]+z_{k,b}[t], \tag*{(9)}

where zk,b[t]∼CN(0,σc,k2)z_{k,b}[t]\sim\mathcal{CN}(0,\sigma_{c,k}^2) is additive noise independent of the transmitted data.

Instantaneous and Long-Term Rate Metrics

With Gaussian signaling and the other users’ streams treated as noise, the block-level SINR and spectral efficiency of UE kk are

γk,b=∣hk,bHwk,b∣2∑i≠k∣hk,bHwi,b∣2+σc,k2,Rk,binst=log⁡2(1+γk,b).(10)\gamma_{k,b}=\frac{|\mathbf{h}_{k,b}^{\mathrm{H}}\mathbf{w}_{k,b}|^2}{\sum_{i\ne k}|\mathbf{h}_{k,b}^{\mathrm{H}}\mathbf{w}_{i,b}|^2+\sigma_{c,k}^2},\qquad R_{k,b}^{\mathrm{inst}}=\log_2(1+\gamma_{k,b}). \tag*{(10)}

The rate is measured in bit/s/Hz. Both quantities remain constant within a block under the assumed channel and precoder model. To describe block-to-block randomness, define

Ξb≜(Ξbc,Ξbs),Ξbc≜{pk,bue,κk,b,gk,b,ϵk,bel,ϵk,baz}k=1K.(11)\boldsymbol{\Xi}_b\triangleq(\boldsymbol{\Xi}_b^{\mathrm{c}},\boldsymbol{\Xi}_b^{\mathrm{s}}),\quad\boldsymbol{\Xi}_b^{\mathrm{c}}\triangleq\left\{p_{k,b}^{\mathrm{ue}},\kappa_{k,b},g_{k,b},\boldsymbol{\epsilon}_{k,b}^{\mathrm{el}},\boldsymbol{\epsilon}_{k,b}^{\mathrm{az}}\right\}_{k=1}^{K}. \tag*{(11)}

Here, gk,b∈CLNg_{k,b}\in\mathbb{C}^{L_N} collects the aggregate diffuse cluster gains, and ϵk,bν∈RLN\boldsymbol{\epsilon}_{k,b}^{\nu}\in\mathbb{R}^{L_N} collects the angular offsets defined above. The sensing state Ξbs\boldsymbol{\Xi}_b^{\mathrm{s}} and the resulting target-prior information are specified in Section II-D1. The location distribution is given in (3), while the gain and angular-offset laws are specified in the preceding channel subsection. The Rician factor is generated as

κk,bdB∼U(κmin⁡dB,κmax⁡dB),κk,b=10κk,bdB/10.(12)\kappa_{k,b}^{\mathrm{dB}}\sim\mathcal{U}(\kappa_{\min}^{\mathrm{dB}},\kappa_{\max}^{\mathrm{dB}}),\qquad\kappa_{k,b}=10^{\kappa_{k,b}^{\mathrm{dB}}/10}. \tag*{(12)}

The limits and angular spreads are listed in Table I. Independent draws are used for the random communication inputs across users and blocks in the simulations. The generative state is used for sampling and performance evaluation. During deployment, the fast policy receives the resulting post-movement CSI and current target-prior information, without requiring the individual cluster gains or angular offsets. For an integrable function f(Ξ)f(\boldsymbol{\Xi}), the Monte Carlo estimator is obtained as:

System and ChannelTraining and Evaluation
DimensionsMA/UE/target counts (N,K,Q)=(30,3,2)(N, K, Q) = (30, 3, 2)Node/relation MLPstwo affine layers, hidden width 256, SiLU.
Frequencyfc=28f_c = 28 GHz, λ=10.7\lambda= 10.7 mm, dF=9.6d_F = 9.6 m (far-field boundary)Optimizer / budgetAdamW, learning rate 7.5×10−57.5 \times10^{-5}, 200 epochs, 100 steps/epoch
Bandwidth / power10 MHz, T=32T = 32 symbols/block, Pmax⁡=30P_{\max} = 30 dBmInput scalingGain offset cβ=10c_\beta= 10, Rician scale cκ=10c_\kappa= 10; rate scale cR=10c_R = 10 bit/s/Hz; dropout pdrop=0.05p_{\mathrm{drop}} = 0.05
Noiseσc2=σs2=2.007×10−13\sigma_c^2 = \sigma_s^2 = 2.007 \times10^{-13} W; 290 K; communication/sensing noise figures 7 dB eachClipping / decaySlow/fast gradient-norm caps 0.5/1; weight decay 0
Array / referenceC=[−7.5λ,7.5λ]C = [-7.5\lambda, 7.5\lambda], minimum spacing Dmin⁡=0.5λD_{\min} = 0.5\lambda; reference: 5×65 \times6 URA over [−7.2λ,7.2λ]2[-7.2\lambda, 7.2\lambda]^2QoS pairs(Rmin⁡F,Rmin⁡S)∈{(1,2),…,(6,7)}(R^{\mathrm{F}}_{\min}, R^{\mathrm{S}}_{\min}) \in\{(1, 2), \ldots, (6, 7)\} bit/s/Hz
Default UEsCenters pkpre\mathbf{p}^{\mathrm{pre}}_k: (100,65,20)(100, 65, 20), (100,−65,25)(100, -65, 25), (125,25,30)(125, 25, 30) m; radii rkUEr^{\mathrm{UE}}_k: (10,10,12)(10, 10, 12) mMargins / tails(ϵF,ϵS)=(0.25,0.10)(\epsilon_F, \epsilon_S) = (0.25, 0.10) bit/s/Hz; (τF,τd)=(0.25,0.10)(\tau_F, \tau_d) = (0.25, 0.10)
Added UEs (k=4,5)(k = 4, 5)Centers (111.58,−42.83,22.64)(111.58, -42.83, 22.64), (119.41,14.80,21.37)(119.41, 14.80, 21.37) m; radii (10,10)(10, 10) mPHR / dual steps(ϱF,ϱS,ϱd)=(10,10,20)(\varrho_F, \varrho_S, \varrho_d) = (10, 10, 20); (ηF,ηS,ηd)=(0.01,0.01,0.02)(\eta_F, \eta_S, \eta_d) = (0.01, 0.01, 0.02)
Default targetsCenters pqtgt\mathbf{p}^{\mathrm{tgt}}_q: (100,0,75)(100, 0, 75), (115,−25,65)(115, -25, 65) m; radii rqtgtr^{\mathrm{tgt}}_q: (10,10)(10, 10) mMultiplier valuesInitially 0; (υFmax⁡,υSmax⁡,υdmax⁡)=(50,50,100)(\upsilon_F^{\max}, \upsilon_S^{\max}, \upsilon_d^{\max}) = (50, 50, 100)
Added target (q=3)(q = 3)Center (107.51,−6.44,67.59)(107.51, -6.44, 67.59) m; radius 10 mSpacing repairTargets Dtar=0.52λD_{\mathrm{tar}} = 0.52\lambda, Dproj=0.521λD_{\mathrm{proj}} = 0.521\lambda; Ip=96I_p = 96 iterations, step ηp=1\eta_p = 1, tolerance ϵproj=10−5λ\epsilon_{\mathrm{proj}} = 10^{-5}\lambda
Rician / diffuse10log⁡10κk,b∼U[3,10]10\log_{10}\kappa_{k,b} \sim U[3, 10], LN=4L_N = 4 clusters, gk,b,ℓ∼CN(0,1)g_{k,b,\ell} \sim\mathcal{CN}(0, 1); spreads (σNel,σNaz)=(8∘,12∘)(\sigma_N^{\mathrm{el}}, \sigma_N^{\mathrm{az}}) = (8^\circ, 12^\circ)Training / validationMs=1024M_s = 1024 statistics samples; training: Mtr=24M_{\mathrm{tr}} = 24 blocks, Sa=32S_a = 32 angles/block; validation: 256 blocks, 64 angular samples/block, every epoch
Target prior / phaseRaised-cosine full widths Δqel=Δqaz=0.20\Delta^{\mathrm{el}}_q = \Delta^{\mathrm{az}}_q = 0.20 rad, cross section σq=1\sigma_q = 1 m2^2, ϕq,b∼U[0,2π)\phi_{q,b} \sim U[0, 2\pi)Final test200 slow intervals, B=64B = 64 blocks/interval, 96 angular samples/block
Gains / lossesAll element/UE gains 0 dBi; system/noise losses 0 dBSize adaptation10 epochs, 100 steps/epoch; learning rate 2.5×10−52.5 \times10^{-5}
Network and Numerical SettingsSAA-AOSAA-AO (Adam, learning rate 0.02)
Graph layersNode width d=256d = 256; slow/fast depths (Ls,Lf)=(3,4)(L_s, L_f) = (3, 4); A=4A = 4 attention headsSamples / updates64 blocks, 48 angular samples/block; 30 outer iterations, each with 5 geometry and 30 precoder updates
Decoder MLPsPosition ϕR\phi_R: 256→256→128→2256 \to256 \to128 \to2; precoder ϕW\phi_W: 518→256→256→128→2518 \to256 \to256 \to128 \to2Initialization20 starts: reference array and 19 layouts with independent N(0,0.252)\mathcal{N}(0, 0.25^2) perturbations of coordinate logits; RZF precoders
Output / lossGains γR=γW=γRZF=1\gamma_R = \gamma_W = \gamma_{\mathrm{RZF}} = 1; clipping ϵr=10−4\epsilon_r = 10^{-4}, power/log floors ϵp=ϵB=10−12\epsilon_p = \epsilon_B = 10^{-12}, sensing weight cB=1c_B = 1Primal updatesGeometry/precoder gradient-norm cap 1/5
Constraint termsRate margins 0; fast/slow/spacing penalties (10,10,20)(10, 10, 20) and dual steps $(0.01, 0.01, 0.02); multipliers initially 0, cap 100
Test refinement100 precoder updates, gradient-norm cap 5, penalty coefficient 10; dual step 0.05, initial value 0, cap 100

Table I. Simulation and Implementation Parameters. MLP widths are listed from input to output.

E^M[f(Ξ)]≜1M∑m=1Mf(ξ(m)),ξ(m)∼i.i.d.pΞ,(13)\widehat{\mathbb{E}}_M[f(\boldsymbol{\Xi})]\triangleq\frac{1}{M}\sum_{m=1}^{M}f(\boldsymbol{\xi}^{(m)}),\qquad\boldsymbol{\xi}^{(m)}\mathrel{\mathop{\sim}^{\mathrm{i.i.d.}}}p_{\boldsymbol{\Xi}}, \tag*{(13)}

where m=1,…,Mm=1,\ldots,M indexes independent numerical samples and bb indexes physical transmission blocks. The realized rate averaged over one positioning interval is RkSI,(B)≜B−1∑b=1BRk,binstR_k^{\mathrm{SI},(B)}\triangleq B^{-1}\sum_{b=1}^{B}R_{k,b}^{\mathrm{inst}}. For a given geometry and a fixed rule for block-adaptive precoding, a stationary block-state process yields the ensemble-average rate and its numerical estimate as

R‾k≜E[RkSI,(B)]=E[Rkinst(Ξ)],\overline{R}_k\triangleq\mathbb{E}[R_k^{\mathrm{SI},(B)}]=\mathbb{E}[R_k^{\mathrm{inst}}(\boldsymbol{\Xi})],
R^k,M≜E^M[Rkinst(Ξ)].(14)\widehat{R}_{k,M}\triangleq\widehat{\mathbb{E}}_M[R_k^{\mathrm{inst}}(\boldsymbol{\Xi})]. \tag*{(14)}

The equality follows from the common marginal distribution and does not require independent physical blocks. The slow-timescale QoS criterion constrains this ensemble mean, without guaranteeing the realized average in every finite interval. Thus, BB specifies the geometry persistence in physical blocks, whereas MM specifies the numerical sample count.

Monostatic Multi-Target Sensing Model

Following representative MA-assisted ISAC models [10, 12, 13], each target is modeled as a far-field point scatterer with a LoS round-trip path. Clutter, target-induced multipath, external interference, and residual transmitter leakage are neglected as previously assumed. The targets are stationary within each coherence block, such that their angles and reflection coefficients remain constant over its TT snapshots but may vary across blocks. Doppler is therefore ignored, and block-dependent angular uncertainty intervals are assumed available from a preceding sensing or tracking stage.

Let ϑq,b=[ϑq,bel,ϑq,baz]T\boldsymbol{\vartheta}_{q,b}=[\vartheta_{q,b}^{\mathrm{el}},\vartheta_{q,b}^{\mathrm{az}}]^{\mathrm{T}} and aq,b≜a(R,ϑq,b)\mathbf{a}_{q,b}\triangleq\mathbf{a}(\mathbf{R},\boldsymbol{\vartheta}_{q,b}) denote the direction and position-dependent steering vector of target qq in block bb, respectively. Since the same array is used for transmission and reception, we obtain the monostatic spatial response as Aq,b≜aq,baq,bT\mathbf{A}_{q,b}\triangleq\mathbf{a}_{q,b}\mathbf{a}_{q,b}^{\mathrm{T}}. Let αq,b∈C\alpha_{q,b}\in\mathbb{C} denote the unknown complex reflection coefficient, which absorbs the round-trip path loss, propagation delay, common phase, and radar cross section (RCS). It is treated as a deterministic nuisance parameter within each block. Defining ϑb=[ϑ1,b,…,ϑQ,b]T\boldsymbol{\vartheta}_b=[\vartheta_{1,b},\ldots,\vartheta_{Q,b}]^{\mathrm{T}} and αb=[α1,b,…,αQ,b]T\boldsymbol{\alpha}_b=[\alpha_{1,b},\ldots,\alpha_{Q,b}]^{\mathrm{T}}, the aggregate sensing channel is:

Hs,b(R,ϑb,αb)=∑q=1Qαq,bAq,b.(15)\mathbf{H}_{\mathrm{s},b}(\mathbf{R},\boldsymbol{\vartheta}_b,\boldsymbol{\alpha}_b)=\sum_{q=1}^{Q}\alpha_{q,b}\mathbf{A}_{q,b}. \tag*{(15)}

The known data-bearing signal in (7) is reused as the sensing probe. The echo received in symbol interval tt is obtained as

ys,b[t]=Hs,bxb[t]+zs,b[t]=∑q=1Qαq,bAq,bWbdb[t]+zs,b[t],(16)y_{\mathrm{s},b}[t] = H_{\mathrm{s},b}x_b[t] + z_{\mathrm{s},b}[t] = \sum_{q=1}^{Q} \alpha_{q,b}A_{q,b}W_b d_b[t] + z_{\mathrm{s},b}[t], \tag*{(16)}

where zs,b[t]∼CN(0,σs2IN)z_{\mathrm{s},b}[t] \sim\mathcal{CN}(0,\sigma_{\mathrm{s}}^2 I_N) is independent across blocks and symbol intervals. Define Db=[db[1],…,db[T]]D_b = [d_b[1],\ldots,d_b[T]] and Xb=[xb[1],…,xb[T]]=WbDbX_b = [x_b[1],\ldots,x_b[T]] = W_bD_b. Stacking the TT sensing snapshots gives

Ys,b=Hs,bXb+Zs,b,(17)Y_{\mathrm{s},b} = H_{\mathrm{s},b}X_b + Z_{\mathrm{s},b}, \tag*{(17)}

where vec⁡(Zs,b)∼CN(0,σs2INT)\operatorname{vec}(Z_{\mathrm{s},b}) \sim\mathcal{CN}(0,\sigma_{\mathrm{s}}^2 I_{NT}).

FIM and BCRB Analysis for 2D-DOA Estimation

We construct a separate angular BCRB for each block using a hybrid information formulation with random target angles and deterministic nuisance reflection coefficients [32]. The standard regularity and local-unbiasedness conditions for the deterministic-parameter directions are assumed. We define the block-level parameter vectors as ρb=col⁡{ℜ{αq,b},ℑ{αq,b}}q=1Q∈R2Q\rho_b = \operatorname{col}\{\Re\{\alpha_{q,b}\},\Im\{\alpha_{q,b}\}\}_{q=1}^{Q} \in\mathbb{R}^{2Q} and ηb=col⁡(ϑb,ρb)∈R4Q\eta_b = \operatorname{col}(\vartheta_b,\rho_b) \in\mathbb{R}^{4Q}, where ϑb∈R2Q\vartheta_b \in\mathbb{R}^{2Q} stacks the elevation and azimuth angles of all QQ targets. Letting Gi,b≜∂Hs,b/∂ηi,bG_{i,b} \triangleq\partial H_{\mathrm{s},b}/\partial\eta_{i,b} denote the sensing-channel derivative with respect to the ii-th entry of ηb\eta_b, the block-level data Fisher information matrix (FIM), accumulated over TT transmitted symbols and averaged over the unit-power data symbols, can be obtained via the Slepian–Bangs formula [6, 33] as

[JD,b]i,j=2Tσs2ℜ{tr⁡(Qx,bGi,bHGj,b)}.(18)[J_{\mathrm{D},b}]_{i,j} = \frac{2T}{\sigma_{\mathrm{s}}^2}\Re\left\{\operatorname{tr}\left(Q_{x,b}G_{i,b}^{\mathrm{H}}G_{j,b}\right)\right\}. \tag*{(18)}

Consequently, JD,bJ_{\mathrm{D},b} depends on the fast-timescale precoder through Qx,bQ_{x,b} and on the slow-timescale MA geometry through the target steering responses and their angular derivatives.

Block-Dependent Target-Angle Priors

We distinguish the block-to-block distribution of the target prior from the conditional distribution of the unknown target angles within a given block. The former generates diverse target contexts for offline training, while the latter governs the Bayesian sensing model. For the nominal target location sampled in (3), the angular-prior center is given by:

μq,bν=ϑν(pq,btgt),ν∈{el,az},(19)\mu_{q,b}^{\nu} = \vartheta^{\nu}\left(p_{q,b}^{\mathrm{tgt}}\right), \qquad\nu\in\{\mathrm{el},\mathrm{az}\}, \tag*{(19)}

where ϑν(⋅)\vartheta^{\nu}(\cdot) maps a Cartesian location to its elevation or azimuth direction from the BS. We collect the sensing variables used for block generation and bound evaluation as

Ξbs≜{pq,btgt,Δq,bel,Δq,baz,αq,b}q=1Q.(20)\Xi_b^{\mathrm{s}} \triangleq\left\{p_{q,b}^{\mathrm{tgt}},\Delta_{q,b}^{\mathrm{el}},\Delta_{q,b}^{\mathrm{az}},\alpha_{q,b}\right\}_{q=1}^{Q}. \tag*{(20)}

The reflection coefficients enter the outer block-state average but are excluded from both policy inputs. The prior information available at the beginning of block bb is collected as

ζb≜col⁡(μq,bel,μq,baz,Δq,bel,Δq,baz)q=1Q∈R4Q.(21)\zeta_b \triangleq\operatorname{col}\left(\mu_{q,b}^{\mathrm{el}},\mu_{q,b}^{\mathrm{az}},\Delta_{q,b}^{\mathrm{el}},\Delta_{q,b}^{\mathrm{az}}\right)_{q=1}^{Q} \in\mathbb{R}^{4Q}. \tag*{(21)}

Thus, the across-block distribution of ζb\zeta_b is induced by the Cartesian target-location distributions through the nonlinear angle mapping in (19); the prior centers are not assumed to be uniformly distributed in angle. In the considered implementation, each target has configured support widths that remain constant throughout the slow interval, i.e., Δq,bν=Δqν\Delta_{q,b}^{\nu} = \Delta_q^{\nu}. Hence, only the prior centers vary across blocks. Conditional on ζb\zeta_b, the local uncertainty around each prior center is modeled by a raised-cosine density. This compactly supported prior approaches zero smoothly at its boundaries and satisfies the regularity conditions of the Van Trees inequality [15, 34]. Defining Iq,bν=[μq,bν−Δq,bν2,μq,bν+Δq,bν2]\mathcal{I}_{q,b}^{\nu} = \left[\mu_{q,b}^{\nu} - \frac{\Delta_{q,b}^{\nu}}{2},\mu_{q,b}^{\nu} + \frac{\Delta_{q,b}^{\nu}}{2}\right], the conditional density of angular component ϑq,bν\vartheta_{q,b}^{\nu} is

pq,bν(ψ∣ζb)=1+cos⁡(2π(ψ−μq,bν)Δq,bν)Δq,bνI{∣ψ−μq,bν∣≤Δq,bν2}.(22)p_{q,b}^{\nu}(\psi\mid\zeta_b) = \frac{1+\cos\left(\frac{2\pi(\psi-\mu_{q,b}^{\nu})}{\Delta_{q,b}^{\nu}}\right)} {\Delta_{q,b}^{\nu}} \mathbb{I}\left\{\left|\psi-\mu_{q,b}^{\nu}\right|\leq\frac{\Delta_{q,b}^{\nu}}{2}\right\}. \tag*{(22)}

Assuming conditional independence among targets and angular components, the joint within-block prior is obtained as pb(ϑb∣ζb)=∏q=1Q∏ν∈{el,az}pq,bν(ϑq,bν∣ζb)p_b(\vartheta_b\mid\zeta_b) = \prod_{q=1}^{Q}\prod_{\nu\in\{\mathrm{el},\mathrm{az}\}}p_{q,b}^{\nu}(\vartheta_{q,b}^{\nu}\mid\zeta_b). The resulting prior FIM is obtained as:

JP,b=diag⁡({4π2(Δq,bν)2}q=1,…,Q,ν∈{el,az})∈R2Q×2Q,(23)J_{\mathrm{P},b} = \operatorname{diag}\left(\left\{\frac{4\pi^2}{(\Delta_{q,b}^{\nu})^2}\right\}_{q=1,\ldots,Q,\nu\in\{\mathrm{el},\mathrm{az}\}}\right) \in\mathbb{R}^{2Q\times2Q}, \tag*{(23)}

with diagonal entries ordered consistently with ϑb\vartheta_b.

Fast-Timescale Per-Block BCRB

For a fixed geometry R\mathbf{R}, precoder WbW_b, and prior parameter set ζb\zeta_b, the data FIM must be averaged over the joint target-angle prior corresponding to block bb. Because the resulting 2Q2Q-dimensional expectation lacks a tractable closed form, it is approximated using SaS_a joint angle samples:

J‾D,b=Eϑb∼pb[JD,b(R,Wb,ηb)]≈∑s=1SaJD,b(R,Wb,ηb(s))Sa,(24)\overline{J}_{\mathrm{D},b} = \mathbb{E}_{\vartheta_b\sim p_b}\left[J_{\mathrm{D},b}(\mathbf{R},W_b,\eta_b)\right] \approx\frac{\sum_{s=1}^{S_a}J_{\mathrm{D},b}\left(\mathbf{R},W_b,\eta_b^{(s)}\right)}{S_a}, \tag*{(24)}

where ηb(s)=col⁡(ϑb(s),ρb)∈R4Q\eta_b^{(s)} = \operatorname{col}(\vartheta_b^{(s)},\rho_b) \in\mathbb{R}^{4Q}. The deterministic nuisance parameter vector ρb\rho_b remains fixed across all ss samples. To provide a differentiable mapping from the interval parameters to the sampled angles, each sampled component is generated via the affine reparameterization ϑq,bν,(s)=μq,bν+Δq,bνvq,bν,(s)\vartheta_{q,b}^{\nu,(s)} = \mu_{q,b}^{\nu} + \Delta_{q,b}^{\nu}v_{q,b}^{\nu,(s)}, where vq,bν,(s)∈[−1/2,1/2]v_{q,b}^{\nu,(s)} \in[-1/2,1/2] is drawn from the standardized density 1+cos⁡(2πv)1+\cos(2\pi v). Partitioning J‾D,b\overline{J}_{\mathrm{D},b} into angular and nuisance blocks, we obtain the equivalent Bayesian angular information matrix through the Schur complement, JB,beq=J‾ϑϑ,b+JP,b−J‾ϑρ,bJ‾ρρ,b−1J‾ρϑ,bJ_{\mathrm{B},b}^{\mathrm{eq}} = \overline{J}_{\vartheta\vartheta,b} + J_{\mathrm{P},b} - \overline{J}_{\vartheta\rho,b}\overline{J}_{\rho\rho,b}^{-1}\overline{J}_{\rho\vartheta,b}, assuming that J‾ρρ,b\overline{J}_{\rho\rho,b} is nonsingular. This construction accounts for the unknown reflection coefficients under the per-block nuisance model in Section II-C. The per-block BCRB matrix CBCRB,b∈R2Q×2QC_{\mathrm{BCRB},b} \in\mathbb{R}^{2Q\times2Q} and the target-averaged sensing metric are defined as:

CBCRB,b=(JB,beq)−1,Bb=1Q∑q=1Qtr⁡(CBCRB,b(q)),(25)C_{\mathrm{BCRB},b} = \left(J_{\mathrm{B},b}^{\mathrm{eq}}\right)^{-1}, \qquad\mathcal{B}_b = \frac{1}{Q}\sum_{q=1}^{Q}\operatorname{tr}\left(C_{\mathrm{BCRB},b}^{(q)}\right), \tag*{(25)}

where CBCRB,b(q)∈R2×2C_{\mathrm{BCRB},b}^{(q)} \in\mathbb{R}^{2\times2} denotes the principal submatrix associated with the elevation and azimuth angles of target qq.

Slow-Timescale Expected BCRB

Under stationary block states, the expected average sensing metric over the BB blocks of a slow interval equals the expected per-block BCRB. Using the sample-average operator in (13), the slow-timescale objective and its Monte Carlo approximation are

B‾S≜EΞ[B(Ξ)],B‾S,M≜E^M[B(Ξ)].(26)\overline{\mathcal{B}}_{\mathrm{S}} \triangleq\mathbb{E}_{\Xi}\left[\mathcal{B}(\Xi)\right], \qquad\overline{\mathcal{B}}_{\mathrm{S},M} \triangleq\widehat{\mathbb{E}}_M\left[\mathcal{B}(\Xi)\right]. \tag*{(26)}

Here, BB specifies the duration of the common geometry in coherence blocks, whereas MM is the number of samples used to approximate the expectation.

Two-Timescale Optimization Problem Formulation

We jointly design the MA geometry and digital precoders according to their different adaptation timescales. The geom etry is selected from long-term statistics at the beginning of each slow interval, with mechanical repositioning completed before block transmission. At the beginning of block bb, a control stage provides the post-movement CSI Hb(R)∈CN×K\mathbf{H}_b(\mathbf{R}) \in\mathbb{C}^{N \times K} and the target-prior information ζb∈R4Q\boldsymbol{\zeta}_b \in\mathbb{R}^{4Q}. An external tracker or predictor supplies the latter using observations available before block bb. Acquisition and precoder computation are assumed to finish while both inputs remain valid for the ensuing TT communication-sensing symbols. For X∈{F,S}X \in\{\mathrm{F},\mathrm{S}\}, define the requirement vector ρX=[R1X,min⁡,…,RKX,min⁡]T∈R+K\boldsymbol{\rho}^{X} = [R_1^{X,\min}, \ldots, R_K^{X,\min}]^{\mathsf{T}} \in\mathbb{R}_{+}^{K}. A fast policy πf\pi_{\mathrm{f}} maps the selected geometry, current channel, target-prior information, and fast requirements to a precoder:

Wb=πf(R,Hb(R),ζb,ρF)∈CN×K.(27)\mathbf{W}_b = \pi_{\mathrm{f}}(\mathbf{R}, \mathbf{H}_b(\mathbf{R}), \boldsymbol{\zeta}_b, \boldsymbol{\rho}^{\mathrm{F}}) \in\mathbb{C}^{N \times K}. \tag*{(27)}

Here, πf\pi_{\mathrm{f}} denotes a general block-adaptive mapping, whose neural-network parameterization is introduced in Section IV.

Fast-Timescale Digital-Precoder Problem

For a fixed feasible geometry R∈R2×N\mathbf{R} \in\mathbb{R}^{2 \times N}, we formulate the model-based blockwise precoder-design problem PF,b\mathcal{P}_{\mathrm{F},b} as

min⁡Wb∈CN×KBb(Wb;R)s.t.Rk,binst(R,Wb)≥RkF,min⁡,∀k∈K,∥Wb∥F2≤Pmax⁡.(28)\begin{aligned} \min_{\mathbf{W}_b \in\mathbb{C}^{N \times K}}\quad& \mathcal{B}_b(\mathbf{W}_b;\mathbf{R})\\ \text{s.t.}\quad& R_{k,b}^{\mathrm{inst}}(\mathbf{R},\mathbf{W}_b) \ge R_k^{\mathrm{F},\min},\quad\forall k \in\mathcal{K},\\ & \lVert\mathbf{W}_b\rVert_{\mathrm{F}}^2 \le P_{\max}. \tag*{(28)} \end{aligned}

The objective is the block-level BCRB in (25), evaluated using ζb\boldsymbol{\zeta}_b and the block’s fixed nuisance realization ρb\boldsymbol{\rho}_b. Simulated nuisance values are used for offline training and bound evaluation and are excluded from the learned policy inputs. For compactness, Rk,binst(R,Wb)R_{k,b}^{\mathrm{inst}}(\mathbf{R},\mathbf{W}_b) denotes the rate in (10) evaluated with hk,b(R)\mathbf{h}_{k,b}(\mathbf{R}). The problem is nonconvex because the precoding vectors are coupled through multiuser interference and the sensing information matrix.

Slow-Timescale MA-Position Problem

The common geometry is selected before the future block states are known. Each candidate R\mathbf{R} is therefore evaluated through the fast policy πf\pi_{\mathrm{f}}. For Monte Carlo sample m=1,…,Mm = 1,\ldots,M, let W(m)\mathbf{W}^{(m)} denote the output of (27) using H(m)(R)\mathbf{H}^{(m)}(\mathbf{R}) and ζ(m)\boldsymbol{\zeta}^{(m)}. Both the channel and the resulting precoder depend on the candidate geometry, even when the sampled environment is unchanged. Thus, W(m)\mathbf{W}^{(m)} is determined by R\mathbf{R} and πf\pi_{\mathrm{f}} and it is not treated as an independent optimization variable. We write B^S,M(R,πf)\widehat{\mathcal{B}}_{S,M}(\mathbf{R},\pi_{\mathrm{f}}) and R^k,M(R,πf)\widehat{R}_{k,M}(\mathbf{R},\pi_{\mathrm{f}}) for the estimators in (26) and (14), respectively, evaluated using these geometry-dependent channels and policy-generated precoders.

Following the continuous-position MA model in [10, 35], define C=[ymin⁡,ymax⁡]×[zmin⁡,zmax⁡]\mathcal{C} = [y_{\min},y_{\max}] \times[z_{\min},z_{\max}] as the movement region and Dmin⁡D_{\min} as the minimum inter-MA spacing. For a fixed fast policy πf\pi_{\mathrm{f}}, the sample-average geometry problem PS(πf)\mathcal{P}_{S}(\pi_{\mathrm{f}}) is

min⁡R∈R2×NB^S,M(R,πf)s.t.R^k,M(R,πf)≥RkS,min⁡,∀k∈K,rn∈C,∀n∈N,∥rn−rℓ∥2≥Dmin⁡,1≤n<ℓ≤N,Rkinst,(m)(R,W(m))≥RkF,min⁡,∀k,m,∥W(m)∥F2≤Pmax⁡,∀m.(29)\begin{aligned} \min_{\mathbf{R}\in\mathbb{R}^{2\times N}}\quad& \widehat{\mathcal{B}}_{S,M}(\mathbf{R},\pi_{\mathrm{f}})\\ \text{s.t.}\quad& \widehat{R}_{k,M}(\mathbf{R},\pi_{\mathrm{f}}) \ge R_k^{S,\min},\quad\forall k \in\mathcal{K},\\ & \mathbf{r}_n \in\mathcal{C},\quad\forall n \in\mathcal{N},\\ & \lVert\mathbf{r}_n-\mathbf{r}_{\ell}\rVert_2 \ge D_{\min},\quad1 \le n < \ell\le N,\\ & R_k^{\mathrm{inst},(m)}(\mathbf{R},\mathbf{W}^{(m)}) \ge R_k^{\mathrm{F},\min},\quad\forall k,m,\\ & \lVert\mathbf{W}^{(m)}\rVert_{\mathrm{F}}^2 \le P_{\max},\quad\forall m. \tag*{(29)} \end{aligned}

The last two constraints enforce the fast-timescale requirements on the sampled states. Satisfaction of the rate requirements on unseen states is assessed separately in the numerical evaluation. The thresholds RkF,min⁡R_k^{\mathrm{F},\min} and RkS,min⁡R_k^{\mathrm{S},\min} specify block-level and long-term service requirements, respectively, and need not be equal. Although PS(πf)\mathcal{P}_{S}(\pi_{\mathrm{f}}) expresses the geometry subproblem for a fixed fast policy, the proposed framework jointly trains the slow geometry policy and πf\pi_{\mathrm{f}}. Consequently, both policies account for the sensing objective and the fast- and slow-timescale communication requirements.

Proposed Two-Timescale Model-Based GNN

Architecture and Information Flow

The proposed TT-MBGNN separates slow-timescale geometry selection from block-adaptive precoding while training the two decisions jointly. As illustrated in Figure 2, the S-MBGNN selects one MA geometry per positioning interval from long-term information. Given this geometry, the F-MBGNN produces one precoder in each of the following BB coherence blocks using the current block information. The corresponding policy mappings are represented as:

Figure 2. Architecture of the proposed TT-MBGNN. The S-MBGNN selects one geometry per positioning interval, and the F-MBGNN produces one precoder per block. Final MA states feed the geometry decoder, while final MA and UE states feed the precoder decoder. Target information reaches both decoders through message passing. Channel and RZF coefficient features also enter the pairwise decoder. Joint offline training uses the differentiable physics model and raw-spacing loss, with a straight-through estimator (STE) for finite repair. Solid and dashed red arrows denote forward computation and training gradients. The policies have the same layer structure and separate parameters.

Rraw=πs(Xs;Θs),R=PMA(Rraw),(30)\mathbf{R}^{\mathrm{raw}} = \pi_{\mathrm{s}}(\mathcal{X}_{\mathrm{s}};\boldsymbol{\Theta}_{\mathrm{s}}),\qquad \mathbf{R} = \mathcal{P}_{\mathrm{MA}}(\mathbf{R}^{\mathrm{raw}}), \tag*{(30)}
Wb=πf(R,Hb(R),ζb,ρF;Θf).(31)\mathbf{W}_b = \pi_{\mathrm{f}}(\mathbf{R},\mathbf{H}_b(\mathbf{R}),\boldsymbol{\zeta}_b,\boldsymbol{\rho}^{\mathrm{F}};\boldsymbol{\Theta}_{\mathrm{f}}). \tag*{(31)}

Here, Rraw,R∈R2×N\mathbf{R}^{\mathrm{raw}},\mathbf{R} \in\mathbb{R}^{2 \times N} are the raw and repaired geometries, respectively, and PMA:R2×N→R2×N\mathcal{P}_{\mathrm{MA}}:\mathbb{R}^{2\times N}\rightarrow\mathbb{R}^{2\times N} denotes the finite spacing-repair procedure. The vectors Θs∈RPs\boldsymbol{\Theta}_{\mathrm{s}} \in\mathbb{R}^{P_{\mathrm{s}}} and Θf∈RPf\boldsymbol{\Theta}_{\mathrm{f}} \in\mathbb{R}^{P_{\mathrm{f}}} contain the trainable parameters of the two policies.

Slow-Timescale Input Features

1)1) Slow-Timescale Input Features: The input to the S-MBGNN is collected as

Xs≜(Xsma,Xsue,Xstgt).(32)\mathcal{X}_{\mathrm{s}} \triangleq\left(\mathbf{X}_{\mathrm{s}}^{\mathrm{ma}},\mathbf{X}_{\mathrm{s}}^{\mathrm{ue}},\mathbf{X}_{\mathrm{s}}^{\mathrm{tgt}}\right). \tag*{(32)}

The matrix Xsma∈RN×2\mathbf{X}_{\mathrm{s}}^{\mathrm{ma}} \in\mathbb{R}^{N\times2} contains the normalized reference coordinates of the NN MAs, where the reference geometry is Rref∈R2×N\mathbf{R}^{\mathrm{ref}} \in\mathbb{R}^{2\times N}. Each row of Xsue∈RK×7\mathbf{X}_{\mathrm{s}}^{\mathrm{ue}} \in\mathbb{R}^{K\times7} describes one UE through its long-term departure direction, large-scale channel gain, Rician factor, and slow-timescale requirement. Hence, ρS\boldsymbol{\rho}^{\mathrm{S}} is already included in Xs\mathcal{X}_{\mathrm{s}}. Finally, each row of Xstgt∈RQ×6\mathbf{X}_{\mathrm{s}}^{\mathrm{tgt}} \in\mathbb{R}^{Q\times6} encodes the nominal elevation and azimuth prior centers and their angular widths for one target. Please refer to Appendix A for the explicit slow-feature definitions and normalization.

Fast-Timescale Input Features

2)2) Fast-Timescale Input Features: For block bb, the F-MBGNN input features are collected as

Xf,b≜(Xf,bma,Xf,bue,Xf,btgt,Ebch).(33)\mathcal{X}_{\mathrm{f},b} \triangleq\left(\mathbf{X}_{\mathrm{f},b}^{\mathrm{ma}},\mathbf{X}_{\mathrm{f},b}^{\mathrm{ue}},\mathbf{X}_{\mathrm{f},b}^{\mathrm{tgt}},\mathbf{E}_b^{\mathrm{ch}}\right). \tag*{(33)}

The matrix Xf,bma∈RN×2\mathbf{X}_{\mathrm{f},b}^{\mathrm{ma}} \in\mathbb{R}^{N\times2} contains the normalized antenna coordinates of the selected geometry R\mathbf{R}. Each row of Xf,bue∈RK×4\mathbf{X}_{\mathrm{f},b}^{\mathrm{ue}} \in\mathbb{R}^{K\times4} summarizes the current channel magnitudes and includes the corresponding fast-timescale rate requirement. The matrix Xf,btgt∈RQ×6\mathbf{X}_{\mathrm{f},b}^{\mathrm{tgt}} \in\mathbb{R}^{Q\times6} encodes the current target-angle prior centers and widths from ζb∈R4Q\boldsymbol{\zeta}_b \in\mathbb{R}^{4Q}. The edge-feature tensor Ebch∈RN×K×3\mathbf{E}_b^{\mathrm{ch}} \in\mathbb{R}^{N\times K\times3} provides three real-valued features for each complex coefficient in Hb(R)∈CN×K\mathbf{H}_b(\mathbf{R}) \in\mathbb{C}^{N\times K}. The same feature vector is assigned to both directed MA-UE edges associated with the corresponding link. Please refer to Appendix A for the explicit feature definitions and normalization.

During training, the differentiable communication-sensing model evaluates the achieved rates and angular BCRBs and supplies gradients to both policies. This model-based procedure requires no optimization-generated labels [36]. During deployment, fixed-depth policy evaluations and output processing replace repeated optimization of the physical variables.

Heterogeneous Graph and Relation-Aware Layers

Both policies operate on the directed heterogeneous graph V=Vma∪Vue∪Vtgt\mathcal{V} = \mathcal{V}_{\mathrm{ma}} \cup\mathcal{V}_{\mathrm{ue}} \cup\mathcal{V}_{\mathrm{tgt}}, containing NN MA, KK UE, and QQ target nodes. The five relation types are given by:

Rg={ue→ma, ma→ue, tgt→ma, ue→tgt, tgt→ue}.(34)\mathcal{R}_{\mathrm{g}} = \{\mathrm{ue}\to\mathrm{ma},\ \mathrm{ma}\to\mathrm{ue},\ \mathrm{tgt}\to\mathrm{ma},\ \mathrm{ue}\to\mathrm{tgt},\ \mathrm{tgt}\to\mathrm{ue}\}. \tag*{(34)}

Each relation is a complete directed bipartite connection between its source and destination types. For relation r:s→tr:s\to t and destination v∈Vtv\in\mathcal{V}_t, the incoming neighborhood is Nr(v)=Vs\mathcal{N}_r(v)=\mathcal{V}_s. The two MA-UE relations also carry channel edge features in the F-MBGNN. For policy y∈{s,f}y\in\{s,f\}, let xy,v∈Rdy,t\mathbf{x}_{y,v}\in\mathbb{R}^{d_{y,t}} be the column-vector feature of node v∈Vtv\in\mathcal{V}_t, with dimension dy,td_{y,t}, from (32) or (33). A policy- and type-specific encoder Ey,t:Rdy,t→RdE_{y,t}:\mathbb{R}^{d_{y,t}}\to\mathbb{R}^{d} initializes zy,v(0)=Ey,t(xy,v)\mathbf{z}_{y,v}^{(0)}=E_{y,t}(\mathbf{x}_{y,v}). The state zy,v(i)∈Rd\mathbf{z}_{y,v}^{(i)}\in\mathbb{R}^{d} is then updated through LyL_y relation-aware layers. In the equations below, we fix policy yy and, for the fast policy, coherence block bb, and write zv(i)≡zy,v(i)\mathbf{z}_{v}^{(i)}\equiv\mathbf{z}_{y,v}^{(i)}. Consequently, zv(i)\mathbf{z}_{v}^{(i)} and zu(i)\mathbf{z}_{u}^{(i)} are the destination and source states at the same layer; both are encoder outputs when i=0i=0 and outputs of layer i−1i-1 otherwise. Relation-specific message functions distinguish the physical interactions among the node types [37]. Attention permits different source nodes to contribute unequally [38], while parallel mean aggregation provides a neighborhood summary normalized by the number of source nodes. The gated residual update subsequently combines these messages without discarding the node’s previous state. For u∈Nr(v)u\in\mathcal{N}_r(v) and i=0,…,Ly−1i=0,\ldots,L_y-1, the relation-specific Multi-Layer Perceptron (MLP) ϕr(i):R2d+de,r→Rd\phi_r^{(i)}:\mathbb{R}^{2d+d_{e,r}}\to\mathbb{R}^{d} computes

mu→v,r(i)=ϕr(i)(zv(i)∥zu(i)∥eu→v,r).(35)\mathbf{m}_{u\to v,r}^{(i)}=\phi_r^{(i)}\left(\mathbf{z}_{v}^{(i)}\Vert\mathbf{z}_{u}^{(i)}\Vert\mathbf{e}_{u\to v,r}\right). \tag*{(35)}

Here, ∥\Vert denotes concatenation. The feature eu→v,r∈Rde,r\mathbf{e}_{u\to v,r}\in\mathbb{R}^{d_{e,r}} has de,r=3d_{e,r}=3 for the two fast MA-UE relations and is omitted otherwise (de,r=0d_{e,r}=0). Let AA divide dd, set dh=d/Ad_h=d/A, and partition each message into head vectors mu→v,r(i,a)∈Rdh\mathbf{m}_{u\to v,r}^{(i,a)}\in\mathbb{R}^{d_h}. For a learned matrix Cr(i)∈Rd×d\mathbf{C}_r^{(i)}\in\mathbb{R}^{d\times d}, Cr(i,a)mu→v,r(i)/dh\mathbf{C}_r^{(i,a)}\mathbf{m}_{u\to v,r}^{(i)} /\sqrt{d_h}. Normalizing separately over the sources of each relation gives

αu→v,r(i,a)=exp⁡(su→v,r(i,a))∑u′∈Nr(v)exp⁡(su′→v,r(i,a)),a=1,…,A.(36)\alpha_{u\to v,r}^{(i,a)}= \frac{\exp\left(s_{u\to v,r}^{(i,a)}\right)} {\sum_{u'\in\mathcal{N}_r(v)}\exp\left(s_{u'\to v,r}^{(i,a)}\right)}, \qquad a=1,\ldots,A. \tag*{(36)}

The attention and mean aggregates, followed by their relation-specific fusion, are

av,ratt,(i)=∥a=1A∑u∈Nr(v)αu→v,r(i,a)mu→v,r(i,a),av,rmean,(i)=1∣Nr(v)∣∑u∈Nr(v)mu→v,r(i),qv,r(i)=ψr(i)(av,ratt,(i)∥av,rmean,(i)),(37)\begin{aligned} \mathbf{a}_{v,r}^{\mathrm{att},(i)}&=\mathop{\|}_{a=1}^{A}\sum_{u\in\mathcal{N}_r(v)}\alpha_{u\to v,r}^{(i,a)}\mathbf{m}_{u\to v,r}^{(i,a)},\\ \mathbf{a}_{v,r}^{\mathrm{mean},(i)}&=\frac{1}{|\mathcal{N}_r(v)|}\sum_{u\in\mathcal{N}_r(v)}\mathbf{m}_{u\to v,r}^{(i)},\\ \mathbf{q}_{v,r}^{(i)}&=\psi_r^{(i)}\left(\mathbf{a}_{v,r}^{\mathrm{att},(i)}\Vert\mathbf{a}_{v,r}^{\mathrm{mean},(i)}\right), \tag*{(37)} \end{aligned}

where the aggregates and qv,r(i)\mathbf{q}_{v,r}^{(i)} belong to Rd\mathbb{R}^{d}, and ψr(i):R2d→Rd\psi_r^{(i)}:\mathbb{R}^{2d}\to\mathbb{R}^{d} is an MLP. Attention weights sum to one within each destination, relation, and head before training-time dropout. Let Lt\mathcal{L}_t be the relations entering nodes of type tt. A type-specific affine map Ut(i):Rd→RdU_t^{(i)}:\mathbb{R}^{d}\to\mathbb{R}^{d} processes the node’s own state. The type-specific MLP ηt(i):R(1+∣Lt∣)d→Rd\eta_t^{(i)}:\mathbb{R}^{(1+|\mathcal{L}_t|)d}\to\mathbb{R}^{d} then combines that state with the relation outputs:

z^v(i)=ηv(i)(Ut(i)(zv(i))∥∥∥r∈Itqv,r(i)).(38)\widehat{\mathbf{z}}_{v}^{(i)}=\eta_{v}^{(i)}\left(\mathbf{U}_{t}^{(i)}(\mathbf{z}_{v}^{(i)})\mathbin{\|}\left\| \mathop{\big\|}_{r\in\mathcal{I}_{t}}\mathbf{q}_{v,r}^{(i)}\right.\right). \tag*{(38)}

An affine map Gt(i):R2d→RdG_{t}^{(i)}:\mathbb{R}^{2d}\to\mathbb{R}^{d} forms the element-wise gate

gv(i)=σ(Gt(i)(zv(i))∥z^v(i))∈(0,1)d,\mathbf{g}_{v}^{(i)}=\sigma\left(G_{t}^{(i)}(\mathbf{z}_{v}^{(i)})\mathbin{\|}\widehat{\mathbf{z}}_{v}^{(i)}\right)\in(0,1)^{d},

where σ\sigma is the logistic function. The layer output is

zv(i+1)=LN⁡t(i)(zv(i)+Drop⁡(gv(i)⊙z^v(i))),(39)\mathbf{z}_{v}^{(i+1)}=\operatorname{LN}_{t}^{(i)}\left(\mathbf{z}_{v}^{(i)}+\operatorname{Drop}\left(\mathbf{g}_{v}^{(i)}\odot\widehat{\mathbf{z}}_{v}^{(i)}\right)\right), \tag*{(39)}

where LN⁡t(i)\operatorname{LN}_{t}^{(i)} is type-specific layer normalization. Dropout is disabled during inference. Please refer to Appendix B for the affine parameterizations and training-time dropout. At inference, the graph layers are equivariant to consistent relabeling within each node type, with node and edge features permuted accordingly [36]. This claim excludes the index-dependent direction rule for nearly coincident antennas used by the spacing repair in Section IV-C1.

Structured Policy Decoders

After the relation-aware layers, the slow MA states determine the array coordinates. The fast MA and UE states jointly determine each precoder coefficient. Information from target nodes reaches these decoders through the directed graph relations.

Slow-Timescale Geometry Decoder

After the LsL_s graph layers, a shared position MLP ϕR:Rd→R2\phi_{\mathrm{R}}:\mathbb{R}^{d}\to\mathbb{R}^{2} maps the final MA state zs,n(Ls)∈Rd\mathbf{z}_{s,n}^{(L_s)}\in\mathbb{R}^{d} to a correction relative to rnref∈R2\mathbf{r}_{n}^{\mathrm{ref}}\in\mathbb{R}^{2}. Let rmin⁡,rmax⁡∈R2\mathbf{r}_{\min},\mathbf{r}_{\max}\in\mathbb{R}^{2} be the coordinate bounds of C\mathcal{C}. Define unref=clip⁡[ϵr,1−ϵr]((rnref−rmin⁡)/(rmax⁡−rmin⁡))\mathbf{u}_{n}^{\mathrm{ref}}=\operatorname{clip}_{[\epsilon_{r},1-\epsilon_{r}]}\left((\mathbf{r}_{n}^{\mathrm{ref}}-\mathbf{r}_{\min})/(\mathbf{r}_{\max}-\mathbf{r}_{\min})\right) and ℓnref=log⁡(unref/(12−unref))\boldsymbol{\ell}_{n}^{\mathrm{ref}}=\log(\mathbf{u}_{n}^{\mathrm{ref}}/(\mathbf{1}_{2}-\mathbf{u}_{n}^{\mathrm{ref}})), where ϵr∈(0,1/2)\epsilon_{r}\in(0,1/2) and the operations are element-wise. Column nn of Rraw\mathbf{R}^{\mathrm{raw}} is

rnraw=rmin⁡+(rmax⁡−rmin⁡)⊙σ(ℓnref+γRϕR(zs,n(Ls))),(40)\mathbf{r}_{n}^{\mathrm{raw}}=\mathbf{r}_{\min}+(\mathbf{r}_{\max}-\mathbf{r}_{\min})\odot\sigma\left(\boldsymbol{\ell}_{n}^{\mathrm{ref}}+\gamma_{\mathrm{R}}\phi_{\mathrm{R}}(\mathbf{z}_{s,n}^{(L_s)})\right), \tag*{(40)}

where γR>0\gamma_{\mathrm{R}}>0 controls the correction magnitude and σ\sigma is the element-wise logistic function. This mapping keeps the raw coordinates within C\mathcal{C}.

As will be detailed in Section IV-D, training includes a dedicated penalty that encourages separation between MAs. Since this penalty does not guarantee feasible spacing for every decoded layout, we additionally apply a finite geometric correction in each forward pass during training and deployment. The correction acts on antenna pairs with distances below Dproj≥Dmin⁡D_{\mathrm{proj}}\geq D_{\min} before the fast policy and communication-sensing model are evaluated. Define P={(n,ℓ):1≤n<ℓ≤N}\mathcal{P}=\{(n,\ell):1\leq n<\ell\leq N\} and initialize rn(0)=rnraw\mathbf{r}_{n}^{(0)}=\mathbf{r}_{n}^{\mathrm{raw}}. At iteration jj, let dnℓ(j)=∥rn(j)−rℓ(j)∥2d_{n\ell}^{(j)}=\left\|\mathbf{r}_{n}^{(j)}-\mathbf{r}_{\ell}^{(j)}\right\|_{2}. For dnℓ(j)>ϵprojd_{n\ell}^{(j)}>\epsilon_{\mathrm{proj}}, use δ^nℓ(j)=(rn(j)−rℓ(j))/dnℓ(j)\widehat{\boldsymbol{\delta}}_{n\ell}^{(j)}=(\mathbf{r}_{n}^{(j)}-\mathbf{r}_{\ell}^{(j)})/d_{n\ell}^{(j)}. For nearly coincident positions, use the fixed unit vector col⁡(cos⁡θnℓ,sin⁡θnℓ)\operatorname{col}(\cos\theta_{n\ell},\sin\theta_{n\ell}), where θnℓ=2πιnℓ/(∣P∣+1)\theta_{n\ell}=2\pi\iota_{n\ell}/(|\mathcal{P}|+1) and ιnℓ\iota_{n\ell} is the pair index in a fixed ordering. The proposed pair corrections and simultaneous coordinate update are given by:

pnℓ(j)=12[Dproj−dnℓ(j)]+δ^nℓ(j),(41)\mathbf{p}_{n\ell}^{(j)}=\frac{1}{2}\left[D_{\mathrm{proj}}-d_{n\ell}^{(j)}\right]_{+}\widehat{\boldsymbol{\delta}}_{n\ell}^{(j)}, \tag*{(41)}
rn(j+1)=ΠC(rn(j)+ηpmax⁡{cn(j),1}[∑ℓ>npnℓ(j)−∑ℓ<npℓn(j)]),\mathbf{r}_{n}^{(j+1)}=\Pi_{\mathcal{C}}\left(\mathbf{r}_{n}^{(j)}+\frac{\eta_{p}}{\max\{c_{n}^{(j)},1\}}\left[\sum_{\ell>n}\mathbf{p}_{n\ell}^{(j)}-\sum_{\ell<n}\mathbf{p}_{\ell n}^{(j)}\right]\right),

where [x]+=max⁡{x,0}[x]_{+}=\max\{x,0\}, ΠC\Pi_{\mathcal{C}} clips coordinates to C\mathcal{C}, ηp∈(0,2]\eta_{p}\in(0,2] is the update scale, and cn(j)c_{n}^{(j)} counts incident pairs whose distance shortfall exceeds ϵproj>0\epsilon_{\mathrm{proj}}>0. Each pair proposes equal and opposite shifts of half the shortfall, and each antenna averages the incident corrections. For an isolated violating pair with dnℓ(j)>ϵprojd_{n\ell}^{(j)}>\epsilon_{\mathrm{proj}} and no boundary clipping, ηp=1\eta_{p}=1 reaches the spacing target in one update. With multiple pairs, simultaneous corrections and clipping can leave residual violations. The procedure stops when all distances are at least Dproj−ϵprojD_{\mathrm{proj}}-\epsilon_{\mathrm{proj}} or after Ip∈NI_{p}\in\mathbb{N} iterations. The returned geometry is PMA(Rraw)\mathbf{P}_{\mathrm{MA}}(\mathbf{R}^{\mathrm{raw}}). The fast policy and sensing and rate losses use the repaired geometry, so the forward performance effects of these distance-based corrections are included in joint training. During training, a STE passes gradients to the raw coordinates [39]:

R=Rraw+sg⁡[PMA(Rraw)−Rraw],(42)\mathbf{R}=\mathbf{R}^{\mathrm{raw}}+\operatorname{sg}\left[\mathbf{P}_{\mathrm{MA}}(\mathbf{R}^{\mathrm{raw}})-\mathbf{R}^{\mathrm{raw}}\right], \tag*{(42)}

where sg⁡\operatorname{sg} preserves its argument in the forward pass and has zero derivative. The resulting identity backward derivative is a surrogate for the derivative of the finite repair.

Remark 2 (Spacing feasibility). Although the finite repair does not provide a universal spacing guarantee, we verified from the unsmoothed coordinates that every repaired geometry checked in § 5 had a minimum spacing of at least Dmin⁡D_{\min}.

Fast-Timescale Precoder Decoder

The fast decoder adds learned complex corrections to an RZF reference. For X∈CN×K\mathbf{X}\in\mathbb{C}^{N\times K}, define

NP(X)≜Pmax⁡X∥X∥F2+ϵp,(43)\mathcal{N}_{\mathrm{P}}(\mathbf{X})\triangleq\frac{\sqrt{P_{\max}}\mathbf{X}}{\sqrt{\|\mathbf{X}\|_{\mathrm{F}}^{2}+\epsilon_{p}}}, \tag*{(43)}

where ϵp>0\epsilon_{p}>0 is a numerical constant. The resulting transmit power does not exceed Pmax⁡P_{\max}. Writing Hb=Hb(R)\mathbf{H}_{b}=\mathbf{H}_{b}(\mathbf{R}), the reference RZF precoder is given by:

WbRZF=NP(Hb[HbHHb+νbIK]−1),(44)\mathbf{W}_{b}^{\mathrm{RZF}}=\mathcal{N}_{\mathrm{P}}\left(\mathbf{H}_{b}\left[\mathbf{H}_{b}^{\mathrm{H}}\mathbf{H}_{b}+\nu_{b}\mathbf{I}_{K}\right]^{-1}\right), \tag*{(44)}
νb=γRZFKσ‾c2/Pmax⁡,\nu_{b}=\gamma_{\mathrm{RZF}}K\overline{\sigma}_{c}^{2}/P_{\max},

where σ‾c2=K−1∑kσc,k2\overline{\sigma}_{c}^{2}=K^{-1}\sum_{k}\sigma_{c,k}^{2}, and γRZF>0\gamma_{\mathrm{RZF}}>0 controls the regularization. For each MA–UE pair (n,k)(n,k), the shared decoder ϕW:R2d+6→R2\phi_{\mathrm{W}}:\mathbb{R}^{2d+6}\to\mathbb{R}^{2} takes the final MA and UE states, the channel feature en,k,bch∈R3\mathbf{e}_{n,k,b}^{\mathrm{ch}}\in\mathbb{R}^{3}, and a three-dimensional feature of the corresponding RZF coefficient. The two outputs form the real and imaginary parts of [ΔWb]n,k[\Delta\mathbf{W}_{b}]_{n,k}. The block precoder is

Wb=NP(WbRZF+γWcWΔWb),(45)\mathbf{W}_{b}=\mathcal{N}_{\mathrm{P}}\left(\mathbf{W}_{b}^{\mathrm{RZF}}+\gamma_{\mathrm{W}}c_{\mathrm{W}}\Delta\mathbf{W}_{b}\right), \tag*{(45)}
cW=Pmax⁡/(NK),c_{\mathrm{W}}=\sqrt{P_{\max}/(NK)},

where γW>0\gamma_{\mathrm{W}}>0 controls the correction magnitude. The entry-wise corrections can change the RZF beam directions, while final normalization enforces the power constraint. Please refer to Appendix C for the coefficient feature and pairwise correction function.

Physics-Informed Constrained Training

At each training step, the selected geometry is evaluated over MtrM_{\mathrm{tr}} independently sampled block states {Ξ(m)}m=1Mtr\{\boldsymbol{\Xi}^{(m)}\}_{m=1}^{M_{\mathrm{tr}}}. For each state, the fast policy produces W(m)\mathbf{W}^{(m)}, and the differentiable physics model estimates the angular BCRB B^(m)>0\widehat{\mathcal{B}}^{(m)}>0. The sensing loss is

Lsen=cBlog⁡(max⁡{1Mtr∑m=1MtrB^(m),ϵB}),(46)\mathcal{L}_{\mathrm{sen}}=c_{\mathrm{B}}\log\left(\max\left\{\frac{1}{M_{\mathrm{tr}}}\sum_{m=1}^{M_{\mathrm{tr}}}\widehat{\mathcal{B}}^{(m)},\epsilon_{\mathrm{B}}\right\}\right), \tag*{(46)}

where cB,ϵB>0c_{\mathrm{B}},\epsilon_{\mathrm{B}}>0. Above the numerical floor, the logarithm preserves the ordering of the sample-average sensing objective while rescaling its gradient. Each block contributes a gradient through its precoder and the common geometry.

The nonnegative training margins εF\varepsilon_{\mathrm{F}}, εS\varepsilon_{\mathrm{S}} and δd\delta_d tighten the rate and spacing requirements; evaluation uses the original thresholds. We define Dtar=Dmin⁡+δdD_{\mathrm{tar}}=D_{\min}+\delta_d. The signed residuals are defined as gk,mF=RkF,min⁡+εF−Rkinst,(m)g^{\mathrm{F}}_{k,m}=R^{\mathrm{F},\min}_k+\varepsilon_{\mathrm{F}}-R^{\mathrm{inst},(m)}_k, gkS=RkS,min⁡+εS−1Mtr∑m=1MtrRkinst,(m)g^{\mathrm{S}}_k=R^{\mathrm{S},\min}_k+\varepsilon_{\mathrm{S}}-\frac{1}{M_{\mathrm{tr}}}\sum_{m=1}^{M_{\mathrm{tr}}}R^{\mathrm{inst},(m)}_k, and gnℓd=Dtar−∥rnraw−rℓraw∥2λg^d_{n\ell}=\frac{D_{\mathrm{tar}}-\lVert r^{\mathrm{raw}}_n-r^{\mathrm{raw}}_\ell\rVert_2}{\lambda}. Here, Rkinst,(m)R^{\mathrm{inst},(m)}_k is evaluated using the repaired geometry and sample-mm precoder. Nonpositive residuals satisfy the corresponding tightened requirements. The rate residuals have units of bit/s/Hz, whereas gnℓdg^d_{n\ell} is dimensionless. For a residual g∈Rg\in\mathbb{R}, multiplier ν≥0\nu\geq0, and coefficient ϱ>0\varrho>0, we use the one-sided Powell-Hestenes-Rockafellar (PHR) term [40]

ℓϱ(g,ν)=[ν+ϱg]+2−ν22ϱ,[x]+=max⁡{x,0}.(47)\ell_{\varrho}(g,\nu)=\frac{[\nu+\varrho g]_+^2-\nu^2}{2\varrho},\qquad[x]_+=\max\{x,0\}. \tag*{(47)}

Let TkF\mathcal{T}^{\mathrm{F}}_k contain the indices of the ⌈τFMtr⌉\lceil\tau_{\mathrm{F}}M_{\mathrm{tr}}\rceil largest gk,mFg^{\mathrm{F}}_{k,m}, and let Td⊆P\mathcal{T}^d\subseteq\mathcal{P} contain the ⌈τd∣P∣⌉\lceil\tau_d|\mathcal{P}|\rceil largest gnℓdg^d_{n\ell}, where τF,τd∈(0,1]\tau_{\mathrm{F}},\tau_d\in(0,1]. With user-specific multipliers νkF,νkS\nu^{\mathrm{F}}_k,\nu^{\mathrm{S}}_k and pair-specific multipliers νnℓd\nu^d_{n\ell}, all nonnegative, the constraint losses are

LF=1K∑k=1K1∣TkF∣∑m∈TkFℓϱF(gk,mF,νkF),(48)\mathcal{L}_{\mathrm{F}}=\frac{1}{K}\sum_{k=1}^{K}\frac{1}{|\mathcal{T}^{\mathrm{F}}_k|}\sum_{m\in\mathcal{T}^{\mathrm{F}}_k}\ell_{\varrho_{\mathrm{F}}}(g^{\mathrm{F}}_{k,m},\nu^{\mathrm{F}}_k), \tag*{(48)}
LS=1K∑k=1KℓϱS(gkS,νkS),Ld=1∣Td∣∑(n,ℓ)∈Tdℓϱd(gnℓd,νnℓd).\mathcal{L}_{\mathrm{S}}=\frac{1}{K}\sum_{k=1}^{K}\ell_{\varrho_{\mathrm{S}}}(g^{\mathrm{S}}_k,\nu^{\mathrm{S}}_k),\qquad\mathcal{L}_d=\frac{1}{|\mathcal{T}^d|}\sum_{(n,\ell)\in\mathcal{T}^d}\ell_{\varrho_d}(g^d_{n\ell},\nu^d_{n\ell}).

The positive coefficients ϱF,ϱS,ϱd\varrho_{\mathrm{F}},\varrho_{\mathrm{S}},\varrho_d control the augmented terms. Tail selection concentrates training on poorly served blocks and closely spaced raw coordinates. The joint primal loss L=Lsen+LF+LS+Ld\mathcal{L}=\mathcal{L}_{\mathrm{sen}}+\mathcal{L}_{\mathrm{F}}+\mathcal{L}_{\mathrm{S}}+\mathcal{L}_d is minimized over (Θs,Θf)(\Theta_s,\Theta_f) using Adam with decoupled weight decay (AdamW) with zero weight decay [41]. After each primal update, define g‾kF=∣TkF∣−1∑m∈TkFgk,mF\overline{g}^{\mathrm{F}}_k=|\mathcal{T}^{\mathrm{F}}_k|^{-1}\sum_{m\in\mathcal{T}^{\mathrm{F}}_k}g^{\mathrm{F}}_{k,m} and g‾kS=gkS\overline{g}^{\mathrm{S}}_k=g^{\mathrm{S}}_k. The multipliers undergo projected signed-residual ascent:

νkX←Π[0,νmax⁡X](νkX+ηXg‾kX),\nu^X_k\leftarrow\Pi_{[0,\nu^X_{\max}]}\left(\nu^X_k+\eta_X\overline{g}^X_k\right),
νnℓd←Π[0,νmax⁡d](νnℓd+ηdgnℓd)(49)\nu^d_{n\ell}\leftarrow\Pi_{[0,\nu^d_{\max}]}\left(\nu^d_{n\ell}+\eta_d g^d_{n\ell}\right) \tag*{(49)}

for X∈{F,S}X\in\{\mathrm{F},\mathrm{S}\}, every k∈Kk\in\mathcal{K}, and every (n,ℓ)∈P(n,\ell)\in\mathcal{P}. Here, ηX,ηd>0\eta_X,\eta_d>0 are step sizes, νmax⁡X,νmax⁡d>0\nu^X_{\max},\nu^d_{\max}>0 are multiplier caps, and Π[a,b]\Pi_{[a,b]} clips its argument to [a,b][a,b]. All pair multipliers are updated, including pairs outside the current spacing tail. Signed residuals allow multipliers to decrease when their constraints are met with margin. The raw-spacing loss encourages separation before repair and the structured decoders enforce the movement region and transmit-power constraints directly.

Simulation Results

In this section, we evaluate the proposed TT-MBGNN in terms of angular sensing-error bounds, communication-QoS satisfaction, antenna-spacing feasibility, and online computational cost. All methods use the same test locations, underlying channel draws, reflection coefficients, and target-angle samples, with channels computed for each method’s geometry. The reported root-BCRB is (180/π)Ntest−1∑i=1NtestBi(180/\pi)\sqrt{N_{\mathrm{test}}^{-1}\sum_{i=1}^{N_{\mathrm{test}}}\mathcal{B}_i} degrees, where NtestN_{\mathrm{test}} is the number of test blocks and Bi\mathcal{B}_i is the target-averaged angular BCRB in radians squared.

Simulation Setup and Implementation

We consider a monostatic ISAC BS at the origin, equipped with N=30N=30 MAs within the square movement region C=[−7.5λ,7.5λ]2\mathcal{C}=[-7.5\lambda,7.5\lambda]^2 on the local YY-ZZ plane. In the default configuration, the BS serves K=3K=3 single-antenna UEs and senses Q=2Q=2 point targets. We use a 5×65\times6 uniform rectangular array (URA) within C\mathcal{C} as the reference geometry Rref\mathbf{R}^{\mathrm{ref}}. In each block, we sample the UE and nominal target locations independently and uniformly with respect to volume within Gkue\mathcal{G}^{\mathrm{ue}}_k and Gqtgt\mathcal{G}^{\mathrm{tgt}}_q, respectively. Channels and target-prior centers vary across blocks, while we hold the geometry R\mathbf{R} fixed within each slow interval. Table I summarizes the default principal parameters. With unity antenna-element and UE receive gains and no additional propagation losses, we compute the communication power gain as βk,b=(λ/(4πdk,bue))2\beta_{k,b}=(\lambda/(4\pi d^{\mathrm{ue}}_{k,b}))^2 and the target reflection power as ∣αq,b∣2=λ2σq/[(4π)3(dq,btgt)4]|\alpha_{q,b}|^2=\lambda^2\sigma_q/[(4\pi)^3(d^{\mathrm{tgt}}_{q,b})^4]. Here, dk,bue=∥pk,bue∥2d^{\mathrm{ue}}_{k,b}=\lVert\mathbf{p}^{\mathrm{ue}}_{k,b}\rVert_2 and dq,btgt=∥pq,btgt∥2d^{\mathrm{tgt}}_{q,b}=\lVert\mathbf{p}^{\mathrm{tgt}}_{q,b}\rVert_2 are distances from the BS reference point, and we set σq=1 m2\sigma_q=1\ \mathrm{m}^2 for every target. We generate the complex reflection coefficient as αq,b=∣αq,b∣exp⁡(jϕq,b−4πdq,btgt/λ)\alpha_{q,b}=|\alpha_{q,b}|\exp(\mathrm{j}\phi_{q,b}-4\pi d^{\mathrm{tgt}}_{q,b}/\lambda), where ϕq,b∼U[0,2π)\phi_{q,b}\sim\mathcal{U}[0,2\pi) is sampled independently across targets and blocks. We regenerate these coefficients across blocks and hold them fixed within each block, including across all angular-prior samples. We account for array gains through the steering vectors and precoders. In the physics engine, we use βk,b\beta_{k,b} to generate channels and αq,b\alpha_{q,b} to evaluate the sensing FIM. For the BCRB, we treat the real and imaginary parts of αq,b\alpha_{q,b} as unknown nuisance parameters.

For each QoS pair, we jointly train the slow and fast policies using uniform per-UE requirements. We estimate the slow statistics from Ms=1024M_s=1024 independent samples and hold these statistics fixed during training. At each training step, we draw Mtr=24M_{\mathrm{tr}}=24 independent block states and use Sa=32S_a=32 angular-prior samples per block. We arrange the angular samples in 1616 symmetric pairs by accompanying each sampled offset with its negative about the prior center. We select checkpoints using a fixed validation set independent of the training and final test samples. For final evaluation, we use 200200 independent trials, each representing one slow interval of B=64B=64 coherence blocks, giving Ntest=200B=12800N_{\mathrm{test}}=200B=12800 unseen blocks per deterministic geometry or policy. Under unchanged statistical inputs, we reuse the geometry R\mathbf{R} across trials and adapt the precoder Wb\mathbf{W}_b to each block. We use Sa=96S_a=96 angular-prior samples per test block, generated by the same paired procedure. We compute 95% confidence intervals from trial-level averages and apply first-order propagation through the square root for root-BCRB.

Benchmarks and Ablation Studies

We compare two learned-component ablations and three independent baselines on common test realizations under the same physical and communication requirements.

Learned-Component Ablations

  1. Learned-Component Ablations: We use the following variants without retraining their learned components:

  • Fixed MA+F-MBGNN: We replace the learned positions with the feasible reference geometry to assess the contribution of geometry adaptation.

  • S-MBGNN+RZF: In this baseline, we combine the learned geometry with blockwise RZF to assess the contribution of learned precoding.

Independent Baselines

  • Fixed MA+RZF: We combine the reference geometry with blockwise RZF as a nonlinear benchmark.

  • SAA-AO: We approximate the long-term objective using finite sample averages and alternately update the common geometry and sample-dependent precoders from multiple initializations [10]. We also perform iterative precoder refinement on test blocks. The optimizer uses simulated target reflection coefficients to evaluate the sensing objective throughout optimization and refinement. In the proposed framework, we use these nuisance values only for offline loss computation and performance evaluation. Thus, SAA-AO serves as an idealized benchmark with additional sensing information and iterative computation at deployment.

  • Fixed MA+sensing-only eigenbeams: For the reference geometry, we use the KK leading eigenvectors of the steering-vector covariance averaged over samples from the current target-angle priors and normalize the precoder to the power budget. We include this sensing-oriented diagnostic without communication QoS constraints or direct angular BCRB minimization.

Training Convergence

Figure 3 presents the fixed-validation evolution under the six QoS configurations. The displayed curves use a ten-epoch trailing average for readability, whereas feasibility checks and final evaluation use unsmoothed metrics. In fig:3a, the root-BCRB decreases rapidly and then stabilizes within a QoS-dependent range. Residual fluctuations and the lack of strict ordering across independently trained models reflect stochastic sampling and nonconvex primal-dual optimization. More stringent communication requirements generally yield larger sensing bounds. fig:3b shows that the UE-averaged

Fixed-validation convergence plots for root-BCRB, UE-averaged 5th-percentile block rate, and minimum MA spacing

Figure 3. Fixed-validation convergence of the proposed TT-MBGNN under uniform per-UE QoS pairs (RF,min⁡,RS,min⁡)(R^{\mathrm{F},\min}, R^{\mathrm{S},\min}). In panel (b), solid curves show the UE-averaged 5th-percentile block rates, and dotted horizontal lines denote the fast-timescale requirements. In panel (c), solid and dashed curves show repaired and raw minimum spacings, respectively. The inset highlights several repaired curves approaching Dproj=0.521λD_{\mathrm{proj}} = 0.521\lambda, with staggered markers distinguishing their overlap. The physical spacing requirement is Dmin⁡=0.5λD_{\min} = 0.5\lambda. For metric curves, we use a ten-epoch trailing average for better visualization.

5th-percentile block rate settles above the corresponding fast-timescale requirement as the initially large RZF-based rate margin decreases and sensing performance improves. This aggregate percentile does not establish strict per-block feasibility. The maximum per-UE slow-rate shortfall was zero at every recorded validation epoch and is omitted. fig:3c shows that the raw minimum spacing can fall below Dmin⁡D_{\min}, while the repaired curves remain close to DprojD_{\mathrm{proj}}. This observed behavior demonstrates the empirical effectiveness of the repair without establishing a universal spacing guarantee. Physical feasibility is assessed from the unsmoothed repaired coordinates against Dmin⁡D_{\min}. The raw-spacing augmented-Lagrangian term separately discourages overlapping decoder outputs.

Sensing-Communication Tradeoff and qos Reliability

Figure 4 reports results on unseen test blocks. The fast-rate threshold varies from 1 to 6 bit/s/Hz, and the slow-rate threshold is 1 bit/s/Hz higher. The middle panel reports the fraction of blocks with a fast-rate violation by any UE defined as p^F=1Ntest∑iI{∃k:Rk,iinst<RkF,min⁡}\hat{p}_{F} = \frac{1}{N_{\mathrm{test}}}\sum_i \mathbb{I}\{\exists k : R^{\mathrm{inst}}_{k,i} < R^{F,\min}_k\}. The bottom panel shows sS=min⁡k(R‾k−RS,min⁡)s_S = \min_k(\overline{R}_k - R^{S,\min}), where R‾k\overline{R}_k is the test-mean rate of UE kk. These empirical checks are applied to each method and threshold pair. A sensing-bound value alone does not establish QoS feasibility and should be interpreted alongside the communication results. The proposed TT-MBGNN achieves a lower root-BCRB than both learned-component ablations throughout the sweep, supporting joint geometry and precoder adaptation. We observe positive slow-rate margins and low, nonzero fast outage for the proposed method. The remaining outages indicate that some test blocks violate the fast-rate requirements. The analytical RZF designs show no observed fast outage and larger slow-rate margins, together with higher sensing bounds. The sensing-only eigenbeams exhibit 98–100% fast outage and negative slow-rate margins. We omit their outage curve from the middle panel to improve the visibility of the other methods.

Root-BCRB, fast-QoS outage, and slow-rate margin versus the uniform fast-QoS threshold

Figure 4. Root-BCRB (top), any-UE fast-QoS outage (middle), and minimum per-UE slow-rate margin (bottom) versus the uniform fast-QoS threshold. The slow threshold is RS,min⁡=RF,min⁡+1R^{\mathrm{S},\min} = R^{\mathrm{F},\min} + 1 bit/s/Hz. The sensing-only design is omitted from the middle panel because its fast outage exceeds 98% at every threshold. The dotted horizontal line denotes zero slow-rate margin.

Network-size generalization plots for varying numbers of UEs and targets

Figure 5. Network-size transfer from (K,Q)=(3,2)(K,Q) = (3,2) with frozen parameters or ten fine-tuning epochs. Top: root-BCRB versus KK (Q=2Q = 2) and QQ (K=3K = 3). Bottom (Q=2Q = 2): test-block mean worst-UE fast-rate shortfall, (solid, left axis) and any-UE fast-QoS outage (dashed, right axis) in the left panel, and minimum slow-rate margin in the right panel. Dotted lines mark the training size and zero. Fixed denotes the reference array. Sensing-only beams appear only in the top row.

Generalization Across Network Sizes

Fig. 5 evaluates policies trained with (K,Q)=(3,2)(K,Q) = (3,2) and uniform fast and slow QoS requirements of 3 and 4 bit/s/Hz, respectively. Additional-node centers and region radii are specified separately in Table I. The top panels show the root-BCRB as KK or QQ varies. The bottom-left panel reports the test-block mean worst-UE fast-rate shortfall, E^test[max⁡k[RkF,min⁡−Rk,binst]+]\widehat{\mathbb{E}}_{\mathrm{test}}[\max_k[R_k^{\mathrm{F},\min} - R_{k,b}^{\mathrm{inst}}]^+], on the left axis and the any-UE fast-QoS outage percentage on the right axis. The latter is the percentage of test blocks in which at least one UE misses the fast-rate requirement. The bottom-right panel reports the minimum slow-rate margin, min⁡k(R^k−RkS,min⁡)\min_k(\widehat{R}_k - R_k^{\mathrm{S},\min}).

The frozen TT-MBGNN achieves favorable sensing bounds across the tested numbers of UEs and targets. Increasing KK beyond the training size raises the communication load, resulting in larger fast-rate shortfalls, more frequent outages, and eventually a negative slow-rate margin. Ten fine-tuning epochs, corresponding to 5% of the original training epoch count, substantially reduce fast-rate shortfalls and outages at these larger user counts while maintaining favorable sensing bounds. The fine-tuned policies also yield positive slow-rate margins across all tested user counts. The remaining nonzero fast outage indicates residual block-level violations. These results support reuse of the trained policies with limited adaptation to increased communication load.

Online Computational Cost

Table II reports batch-one precoder-update latency at (N,K,Q)=(30,5,2)(N,K,Q) = (30,5,2), measured on an NVIDIA GeForce RTX 5080 GPU (16 GB) with an Intel Core Ultra 9 275HX

MethodProposed TT-MBGNNSAA-AO (100 updates)
Median (ms)16.48832.80

Table II. Median Batch-One Fast-Update Latency

CPU. The proposed TT-MBGNN requires 16.48 ms per block, compared with 832.80 ms for SAA-AO with 100 updates, giving a 50.5-fold speedup. These timings exclude channel acquisition and antenna movement. The speedup depends on network size, hardware, and iteration budget, while the proposed fast policy requires no online optimization loop.

Conclusion

In this paper, we developed a two-timescale MA-assisted ISAC framework with block-level and long-term per-UE rate requirements. The proposed TT-MBGNN combines an S-MBGNN for antenna positioning with an F-MBGNN for block-adaptive precoding. Relation-aware layers represent interactions among antennas, users, and targets. A bounded position decoder is followed by finite spacing repair, with a STE supplying surrogate gradients during training. The fast decoder learns complex corrections around an RZF reference. Joint training combines a Monte Carlo angular BCRB objective with one-sided augmented-Lagrangian terms for rate requirements and raw-spacing violations. Simulations demonstrated favorable sensing-communication tradeoffs relative to the principal ablations and analytical baselines. The proposed method achieved competitive sensing bounds against the idealized SAA-AO benchmark and approximately 50-fold faster batch-one precoder computation under the reported settings. Frozen policies provided competitive sensing bounds at the tested unseen user and target counts, while brief fine-tuning improved communication reliability at larger user counts. Communication reliability was assessed empirically, with residual fast-rate outages. Every repaired geometry checked in the reported simulations met the minimum antenna spacing requirement, although the finite repair provides no universal spacing guarantee. Future work will examine robustness to imperfect CSI and array calibration errors and validate the framework on practical MA platforms.

Appendix A: Input-Feature Construction

This appendix gives the explicit construction and normalization of the feature collections in (32) and (33). Each node-feature vector below is a column vector whose transpose forms the corresponding row of its feature matrix. For example, [Xsma]n,:=(xs,nma)T[\mathbf{X}^{\mathrm{ma}}_{\mathrm{s}}]_{n,:}=(\mathbf{x}^{\mathrm{ma}}_{\mathrm{s},n})^{\mathrm{T}}. The same convention applies to the remaining slow- and fast-timescale features. The vectors rnref,rn∈R2\mathbf{r}^{\mathrm{ref}}_n,\mathbf{r}_n\in\mathbb{R}^{2} are columns of Rref\mathbf{R}^{\mathrm{ref}} and R\mathbf{R}, respectively.

Slow-Timescale Features

The reference position is normalized to the movement region as

xs,nma=2rnref−rmin⁡rmax⁡−rmin⁡−12∈R2.(50)\mathbf{x}^{\mathrm{ma}}_{\mathrm{s},n}=2\frac{\mathbf{r}^{\mathrm{ref}}_n-\mathbf{r}_{\min}}{\mathbf{r}_{\max}-\mathbf{r}_{\min}}-\mathbf{1}_2\in\mathbb{R}^{2}. \tag*{(50)}

For UE kk and ν∈{el,az}\nu\in\{\mathrm{el},\mathrm{az}\}, let ϑk,bLoS,ν\vartheta^{\mathrm{LoS},\nu}_{k,b} be the corresponding line-of-sight departure angle and define its circular mean by

ϑˉkν=atan2⁡(E[sin⁡ϑk,bLoS,ν],E[cos⁡ϑk,bLoS,ν]).(51)\bar{\vartheta}^{\nu}_k=\operatorname{atan2}\left(\mathbb{E}[\sin\vartheta^{\mathrm{LoS},\nu}_{k,b}],\mathbb{E}[\cos\vartheta^{\mathrm{LoS},\nu}_{k,b}]\right). \tag*{(51)}

Let ρk,b>0\rho_{k,b}>0 denote the large-scale channel power gain and κk,b≥0\kappa_{k,b}\geq0 the Rician factor in linear units. Their scaled statistics are β~k=log⁡10(E[βk,b])+cβ\widetilde{\beta}_k=\log_{10}(\mathbb{E}[\beta_{k,b}]) + c_{\beta} and κ~k=E[κk,b]/cκ\widetilde{\kappa}_k=\mathbb{E}[\kappa_{k,b}]/c_{\kappa}, where cβ∈Rc_{\beta}\in\mathbb{R} is a fixed offset and cκ>0c_{\kappa}>0 is a scale. With rate scale cR>0c_R>0 in bit/s/Hz, the feature is

xksu,e=col⁡(sin⁡ϑˉkel,cos⁡ϑˉkel,sin⁡ϑˉkaz,cos⁡ϑˉkaz,β~k,κ~k,RkS,mincR)∈R7.(52)\mathbf{x}^{\mathrm{su,e}}_k=\operatorname{col}\left(\sin\bar{\vartheta}^{\mathrm{el}}_k,\cos\bar{\vartheta}^{\mathrm{el}}_k,\sin\bar{\vartheta}^{\mathrm{az}}_k,\cos\bar{\vartheta}^{\mathrm{az}}_k,\widetilde{\beta}_k,\widetilde{\kappa}_k,\frac{R^{\mathrm{S,min}}_k}{c_R}\right)\in\mathbb{R}^{7}. \tag*{(52)}

The expectations are computed offline from the long-term distributions using (13). For target qq, define the nominal angle μq,sν=ϑν(pqtgt)\mu^{\nu}_{q,s}=\vartheta^{\nu}(\mathbf{p}^{\mathrm{tgt}}_q), where ϑν(⋅)\vartheta^{\nu}(\cdot) is the Cartesian-to-angle map used in the system model. The angular widths are Δϑq>0\Delta\vartheta_q>0. The periodic feature

xqtgt=col⁡(sin⁡μq,sel,cos⁡μq,sel,sin⁡μq,saz,cos⁡μq,saz,Δqelπ,Δqazπ)∈R6(53)\mathbf{x}^{\mathrm{tgt}}_q=\operatorname{col}\left(\sin\mu^{\mathrm{el}}_{q,s},\cos\mu^{\mathrm{el}}_{q,s},\sin\mu^{\mathrm{az}}_{q,s},\cos\mu^{\mathrm{az}}_{q,s},\frac{\Delta^{\mathrm{el}}_q}{\pi},\frac{\Delta^{\mathrm{az}}_q}{\pi}\right)\in\mathbb{R}^{6} \tag*{(53)}

avoids discontinuities from angular wrapping [42].

Fast-Timescale Features

For the fast MA feature, we use the selected geometry:

xn,bf,ma=2rn−rmin⁡rmax⁡−rmin⁡−12∈R2.(54)\mathbf{x}^{\mathrm{f,ma}}_{n,b}=2\frac{r_{n}-r_{\min}}{r_{\max}-r_{\min}}-\mathbf{1}_2\in\mathbb{R}^{2}. \tag*{(54)}

This vector is constant within one positioning interval but generally differs from the reference feature in (50). For the target’s features, we form the following using the prior:

xq,bf,tgt=col⁡(sin⁡μq,bel,cos⁡μq,bel,sin⁡μq,baz,cos⁡μq,baz,Δq,belπ,Δq,bazπ)∈R6.(55)\mathbf{x}^{\mathrm{f,tgt}}_{q,b}=\operatorname{col}\left(\sin\mu^{\mathrm{el}}_{q,b},\cos\mu^{\mathrm{el}}_{q,b},\sin\mu^{\mathrm{az}}_{q,b},\cos\mu^{\mathrm{az}}_{q,b},\frac{\Delta^{\mathrm{el}}_{q,b}}{\pi},\frac{\Delta^{\mathrm{az}}_{q,b}}{\pi}\right)\in\mathbb{R}^{6}. \tag*{(55)}

For channel coefficient hn,k,b=[Hb]n,k∈Ch_{n,k,b}=[\mathbf{H}_b]_{n,k}\in\mathbb{C}, define h~n,k,b=hn,k,bPmax⁡/σc,k2\widetilde{h}_{n,k,b}=h_{n,k,b}\sqrt{P_{\max}/\sigma^2_{c,k}} and the real-valued compression slog⁡(x)=sign⁡(x)log⁡(1+∣x∣)\operatorname{slog}(x)=\operatorname{sign}(x)\log(1+|x|). The channel feature is

en,k,bch=col⁡(slog⁡(ℜ{h~n,k,b}),slog⁡(ℑ{h~n,k,b}),log⁡(1+∣h~n,k,b∣))∈R3.(56)\mathbf{e}^{\mathrm{ch}}_{n,k,b}=\operatorname{col}\left(\operatorname{slog}(\Re\{\widetilde{h}_{n,k,b}\}),\operatorname{slog}(\Im\{\widetilde{h}_{n,k,b}\}),\log(1+|\widetilde{h}_{n,k,b}|)\right)\in\mathbb{R}^{3}. \tag*{(56)}

The tensor entry [Ebb]n,k,:[\mathbf{E}^{\mathrm{b}}_b]_{n,k,:} stores this vector. Both directed computational edges for pair (n,k)(n,k) use the same feature. Reversing a graph edge does not conjugate the physical channel coefficient. With sn,k,bmag=log⁡(1+∣h~n,k,b∣)s^{\mathrm{mag}}_{n,k,b}=\log(1+|\widetilde{h}_{n,k,b}|), the UE feature is

xk,bf,ue=col⁡(1N∑n=1Nsn,k,bmag,1N∑n=1N(sn,k,bmag)2,max⁡nsn,k,bmag,RkF,mincR)∈R4.(57)\mathbf{x}^{\mathrm{f,ue}}_{k,b}=\operatorname{col}\left(\frac{1}{N}\sum_{n=1}^{N}s^{\mathrm{mag}}_{n,k,b},\sqrt{\frac{1}{N}\sum_{n=1}^{N}(s^{\mathrm{mag}}_{n,k,b})^2},\max_{n}s^{\mathrm{mag}}_{n,k,b},\frac{R^{\mathrm{F,min}}_k}{c_R}\right)\in\mathbb{R}^{4}. \tag*{(57)}

The node-level channel summaries complement the link-level complex channel information in Ebch\mathbf{E}^{\mathrm{ch}}_b. Together, (54), (55), (56), and (57) provide the entries of Xf,b\mathcal{X}_{f,b} defined in (33).

Appendix B: Relation-Aware Layer Implementation

In (36), the score matrix Cr(i)∈RA×d\mathbf{C}^{(i)}_r\in\mathbb{R}^{A\times d} has no bias. Each dd-dimensional message is divided into AA consecutive heads of dimension dh=d/Ad_h=d/A. Attention weights are normalized over the source nodes of the same relation and destination. During training, dropout is applied to these weights before the attention aggregate in (37) is formed; the mean aggregate is computed from the original messages. Attention dropout is disabled during inference. The affine self transformation and gate map used in (38) and (39) are given by Uself(i)(z)=Wself,t(i)z+bt(i)\mathbf{U}^{(i)}_{\mathrm{self}}(\mathbf{z})=\mathbf{W}^{(i)}_{\mathrm{self},t}\mathbf{z}+\mathbf{b}^{(i)}_t, Gt(i)([z∥z~])=Wg(i)[z∥z~]+bg(i)\mathbf{G}^{(i)}_t([\mathbf{z}\Vert\widetilde{\mathbf{z}}])=\mathbf{W}^{(i)}_g[\mathbf{z}\Vert\widetilde{\mathbf{z}}]+\mathbf{b}^{(i)}_g. Here, Wt∈Rd×d\mathbf{W}_t\in\mathbb{R}^{d\times d}, Wg(i)∈Rd×2d\mathbf{W}^{(i)}_g\in\mathbb{R}^{d\times2d}, and both bias vectors belong to Rd\mathbb{R}^{d}. The gate is gv(i)=σ(Gt(i)([zv(i)∥z~v(i)]))\mathbf{g}^{(i)}_v=\sigma\left(\mathbf{G}^{(i)}_t([\mathbf{z}^{(i)}_v\Vert\widetilde{\mathbf{z}}^{(i)}_v])\right). The message function ϕr(i)\phi^{(i)}_r, relation fusion function ψr(i)\psi^{(i)}_r, and type-specific fusion function ηt(i)\eta^{(i)}_t each use two affine layers with a dd-dimensional hidden layer, a SiLU activation, and hidden-layer dropout. Relations entering a node are concatenated in a fixed order. The MA and UE nodes each receive two relation types, whereas target nodes receive one. Parameters are shared among nodes of the same type within a policy, but are distinct across layers and between the slow and fast policies.

Pairwise RZF-Residual Precoder Decoder

Normalize the reference coefficient as w~n,k,bRZF=[WbRZF]n,k/cW∈C\widetilde{w}^{\mathrm{RZF}}_{n,k,b} = [\mathbf{W}^{\mathrm{RZF}}_{b}]_{n,k}/c_{W} \in\mathbb{C}. Using the compression defined in Appendix A, form

enk,bRZF=col⁡(slog⁡(ℜ{w~n,k,bRZF}),slog⁡(ℑ{w~n,k,bRZF}),log⁡(1+∣w~n,k,bRZF∣))∈R3(58)\mathbf{e}^{\mathrm{RZF}}_{nk,b}=\operatorname{col}\left(\operatorname{slog}\left(\Re\left\{\widetilde{w}^{\mathrm{RZF}}_{n,k,b}\right\}\right),\operatorname{slog}\left(\Im\left\{\widetilde{w}^{\mathrm{RZF}}_{n,k,b}\right\}\right),\log\left(1+\left|\widetilde{w}^{\mathrm{RZF}}_{n,k,b}\right|\right)\right)\in\mathbb{R}^{3} \tag*{(58)}

The shared MLP ϕW:R2d+6→R2\phi_{W}:\mathbb{R}^{2d+6}\to\mathbb{R}^{2} produces the real correction vector δn,k,b∈R2\boldsymbol{\delta}_{n,k,b}\in\mathbb{R}^{2}:

δn,k,b=ϕW(zf,n,bma,(Lf)∥zf,k,bue,(Lf)∥enk,bc∥enk,bRZF),(59)\boldsymbol{\delta}_{n,k,b}=\phi_{W}\left(\mathbf{z}^{\mathrm{ma},(L_f)}_{f,n,b}\Vert\mathbf{z}^{\mathrm{ue},(L_f)}_{f,k,b}\Vert\mathbf{e}^{c}_{nk,b}\Vert\mathbf{e}^{\mathrm{RZF}}_{nk,b}\right), \tag*{(59)}
[ΔWb]n,k=[δn,k,b]1+j[δn,k,b]2,(60)[\Delta\mathbf{W}_{b}]_{n,k}=[\boldsymbol{\delta}_{n,k,b}]_{1}+\mathrm{j}[\boldsymbol{\delta}_{n,k,b}]_{2}, \tag*{(60)}

Scaling and normalization then follow (45).

References

  1. [1]A. Liu et al., “A survey on fundamental limits of integrated sensing and communication,” IEEE Commun. Surveys Tuts., vol. 24, no. 2, pp. 994–1034, 2022.arxiv.org/abs/2104.09954
  2. [2]S. Lu et al., “Integrated sensing and communications: Recent advances and ten open challenges,” IEEE Internet Things J., vol. 11, no. 11, pp. 19094–19 120, 2024.arxiv.org/abs/2305.00179
  3. [3]L. Zhu et al., “Movable antennas for wireless communication: Opportunities and challenges,” IEEE Commun. Mag., vol. 62, no. 6, pp. 114–120, 2024.arxiv.org/abs/2306.02331
  4. [4]W. Ma et al., “A survey on reconfigurable and movable antennas for wireless communications and sensing,” IEEE Commun. Surveys Tuts., vol. 28, pp. 4842–4882, 2026.DOI
  5. [6]A. Fadakar et al., “Hybrid codebook design for localization using electromagnetically reconfigurable fluid antenna system,” IEEE J. Sel. Topics Signal Process., pp. 1–16, 2026.
  6. [7]Y. Zhang et al., “Movable antenna-aided hybrid beamforming for multi-user communications,” IEEE Trans. Veh. Technol., vol. 74, no. 6, pp. 9899–9903, 2025.arxiv.org/abs/2404.00953
  7. [8]C. Jiang et al., “Movable antenna-assisted integrated sensing and communication systems,” IEEE Trans. Wireless Commun., vol. 24, no. 8, pp. 6397–6412, 2025.arxiv.org/abs/2501.01217
  8. [9]L. Chen et al., “Antenna position and beamforming optimization for movable antenna enabled ISAC: Optimal solutions and efficient algorithms,” IEEE Trans. Signal Process., vol. 73, pp. 3812–3828, 2025.arxiv.org/abs/2502.14198
  9. [10]W. Ma et al., “Movable antenna enhanced integrated sensing and communication via antenna position optimization,” IEEE Trans. Signal Process., vol. 74, pp. 1522–1537, 2026.arxiv.org/abs/2501.07318
  10. [11]Y. Han et al., “Movable antenna enhanced downlink multi-user integrated sensing and communication system,” in Proc. IEEE Veh. Technol. Conf. (VTC Spring), 2025, pp. 1–6.arxiv.org/abs/2503.22486
  11. [12]H. Qin et al., “Cramér-Rao bound minimization for movable antenna-assisted multiuser integrated sensing and communications,” IEEE Wireless Commun. Lett., vol. 13, no. 12, pp. 3404–3408, 2024.arxiv.org/abs/2407.11875
  12. [13]A. Khalili et al., “Movable antenna-enabled ISAC: Tackling slow antenna movement, dynamic RCS, and imperfect CSI via two-timescale optimization,” IEEE Trans. Wireless Commun., vol. 25, pp. 8452–8467, 2026.DOI
  13. [14]Z. Zheng et al., “Two-timescale design for movable antenna-enabled multiuser MIMO systems,” IEEE Trans. Commun., vol. 73, no. 11, pp. 10 554–10 571, 2025.DOI
  14. [15]R. D. Gill et al., “Applications of the van trees inequality: A bayesian Cramér-Rao bound,” Bernoulli, vol. 1, no. 1/2, pp. 59–79, 1995.DOI
  15. [16]Y. Zhang et al., “6D movable antenna enhanced cell-free MIMO: Two-timescale decentralized beamforming and antenna movement optimization,” arXiv preprint arXiv:2601.04969, 2026.arxiv.org/abs/2601.04969
  16. [17]Y. Shen et al., “Graph neural networks for wireless communications: From theory to practice,” IEEE Trans. Wireless Commun., vol. 22, no. 5, pp. 3554–3569, 2023.arxiv.org/abs/2203.10800
  17. [18]Y. Lu et al., “Graph neural networks for wireless networks: Graph representation, architecture and evaluation,” IEEE Wireless Commun., vol. 32, no. 1, pp. 150–156, 2025.arxiv.org/abs/2404.11858
  18. [19]Y. Li et al., “GNN-based beamforming for sum-rate maximization in MU-MISO networks,” IEEE Trans. Wireless Commun., vol. 23, no. 8, pp. 9251–9264, 2024.arxiv.org/abs/2311.03659
  19. [20]R. Zhang et al., “Model-based GNN enabled energy-efficient beamforming for ultra-dense wireless networks,” IEEE Trans. Wireless Commun., vol. 24, no. 4, pp. 3333–3345, 2025.arxiv.org/abs/2410.02289
  20. [21]Z. Wang et al., “Heterogeneous graph neural network for cooperative ISAC beamforming in cell-free MIMO systems,” in Proc. ACM Int. Conf. Mobile Comput. Netw. (MobiCom), 2024, pp. 2161–2172.arxiv.org/abs/2410.09963
  21. [23]U. Demirhan et al., “Learning beamforming in cell-free massive MIMO ISAC systems,” in Proc. IEEE Int. Workshop Signal Process. Adv. Wireless Commun. (SPAWC), 2024, pp. 326–330.arxiv.org/abs/2409.18237
  22. [24]C. Weng et al., “Learning-based joint beamforming and antenna movement design for movable antenna systems,” IEEE Wireless Commun. Lett., vol. 13, no. 8, pp. 2120–2124, 2024.arxiv.org/abs/2404.01784
  23. [27]M. Sheraz et al., “RSMA-assisted fluid antenna ISAC via hierarchical deep reinforcement learning,” in Telecom, vol. 7, no. 2. MDPI, 2026, p. 41.DOI
  24. [28]C. He et al., “Graph neural network enabled fluid antenna systems: A two-stage approach,” IEEE Trans. Veh. Technol., vol. 74, no. 10, pp. 16 625–16 629, 2025.arxiv.org/abs/2502.03922
  25. [29]Y. Xiu et al., “Distributed distortion-aware robust optimization for movable antenna-aided cell-free ISAC systems,” arXiv preprint arXiv:2508.13839, 2025.
  26. [30]F. Liang et al., “Two-timescale deep optimization of positioning and beamforming in movable antenna arrays,” IEEE Trans. Wireless Commun., vol. 25, pp. 14 242–14 258, 2026.DOI
  27. [31]L. Zhu et al., “Modeling and performance analysis for movable antenna enabled wireless communications,” IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 6234–6250, 2024.arxiv.org/abs/2210.05325
  28. [32]S. Bay et al., “On the hybrid Cramér Rao bound and its application to dynamical phase estimation,” IEEE Signal Process. Lett., vol. 15, pp. 453–456, 2008.
  29. [33]A. Fadakar et al., “Mutual coupling-aware localization for RIS-assisted ISAC systems,” IEEE Trans. Cogn. Commun. Netw., vol. 11, no. 5, pp. 2938–2954, 2025.DOI
  30. [34]H. L. Van Trees, Detection, estimation, and modulation theory, part III: radar-sonar signal processing and Gaussian signals in noise. John Wiley & Sons, 2001.
  31. [35]X. Xiao et al., “Multiuser communications with movable-antenna base station: Joint antenna positioning, receive combining, and power control,” IEEE Trans. Wireless Commun., vol. 23, no. 12, pp. 19 744–19 759, 2024.arxiv.org/abs/2308.09512
  32. [36]M. Eisen et al., “Optimal wireless resource allocation with random edge graph neural networks,” IEEE Trans. Signal Process., vol. 68, pp. 2977–2991, 2020.DOI
  33. [37]M. Schlichtkrull et al., “Modeling relational data with graph convolutional networks,” in Proc. Eur. Semantic Web Conf. (ESWC). Springer, 2018, pp. 593–607.arxiv.org/abs/1703.06103
  34. [38]P. Veličković et al., “Graph attention networks,” in Proc. Int. Conf. Learn. Represent. (ICLR), 2018.arxiv.org/abs/1710.10903
  35. [39]Y. Bengio et al., “Estimating or propagating gradients through stochastic neurons for conditional computation,” arXiv preprint arXiv:1308.3432, 2013.arxiv.org/abs/1308.3432
  36. [40]R. T. Rockafellar, “Augmented lagrange multiplier functions and duality in nonconvex programming,” SIAM Journal on Control, vol. 12, no. 2, pp. 268–285, 1974.DOI
  37. [41]I. Loshchilov et al., “Decoupled weight decay regularization,” in Proc. Int. Conf. Learn. Represent. (ICLR), 2019.
  38. [42]K. V. Mardia et al., Directional statistics. John Wiley & Sons, 2009.

Paper details

vlnc:W_6jqmpdv8
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…
Contents