betaFeedback

WorksEngineering

Physics-Aware Transformer-Based Beamforming Optimization for Near-Field E-MIMO ISAC Systems

Abstract

This paper proposes a physics-aware Transformer-based beamforming optimization (PATBO) framework for near-field extreme massive multiple-input multiple-output integrated sensing and communication (E-MIMO-ISAC) systems. PATBO combines regularized zero-forcing (RZF) communication directions and spherical-wave near-field sensing directions with learned stream-power allocation. A token-preserving Transformer maintains the correspondence between individual users/targets and their allocated powers, while a Cramér–Rao bound (CRB)-sensitivity-aware objective emphasizes power-allocation errors with greater localization impact. Physical feasibility is explicitly verified after inference, with infeasible predictions handled through physics-constrained power repair and optimizer fallback. For a 32×3232\times32 E-MIMO array with 10241024 antennas, the proposed structured representation reduces the learned output from 12,28812{,}288 real-valued coefficients of an unstructured complex beamformer to six stream-power variables. Direct PATBO achieves 100.98%100.98\% reference-rate retention and 19.54%19.54\% joint feasibility, which increases to 87.79%87.79\% after repair. The complete hybrid framework achieves 99.89%99.89\% reference-rate retention and 100%100\% constraint satisfaction on the retained test set, while requiring optimizer fallback for only 12.21%12.21\% of the scenarios. Direct PATBO inference requires 1.111.11~ms per sample, corresponding to approximately 858×858\times and 779×779\times lower runtime than the evaluated cold-start and PATBO-warm-start sequential quadratic programming (SQP) implementations, respectively.

Introduction

Integrated sensing and communication (ISAC) is a key enabling technology for future sixth-generation (6G) wireless networks, allowing communication and environmental sensing to share spectrum, hardware, and waveform resources [1], [2]. In parallel, extreme massive multiple-input multiple-output (E-MIMO) provides large beamforming gains, high spatial resolution, and enhanced spatial multiplexing capability [3], [4]. Its enlarged physical aperture, however, significantly extends the radiative near-field region, where spherical-wave propagation introduces range-dependent spatial characteristics and enables joint angular–range beam focusing [5], [6]. These properties make near-field E-MIMO particularly attractive for simultaneous communication, sensing, and localization.

Recent studies have investigated near-field ISAC beamforming, localization, Cramér–Rao bound (CRB) analysis, wideband operation, and complexity-aware designs [7], [8], [9], [10], [11], [12], [13]. Related developments include modular extremely large-scale multiple-input multiple-output (XL-MIMO) hybrid beamforming, movable-antenna-assisted near-field ISAC, and practical ultra-wideband architectures [14], [15], [16]. Near-field beam acquisition, channel estimation, beam training, and localization have also received considerable attention [17], [18], [19], [20], [21]. These works demonstrate the benefits of near-field propagation, while also highlighting the increased complexity of beam management in large-aperture systems.

Near-field E-MIMO-ISAC requires the joint coordination of communication and sensing resources. Communication users require sufficient signal-to-interference-plus-noise ratio (SINR) and achievable rate, whereas sensing targets require adequate sensing SINR and localization accuracy. Existing ISAC beamforming methods therefore commonly employ iterative numerical optimization [22], [23], [24], [25], [26], [27], [28]. Although such methods provide effective benchmarks, repeatedly solving constrained nonconvex problems for changing user and target geometries can incur substantial online latency, particularly for E-MIMO systems with large-dimensional beamforming matrices.

Learning-based beamforming offers an alternative by mapping channel or geometry information directly to beamforming variables [29], [30]. Structured learning methods have further addressed constrained beamforming using penalty-dual, Transformer, graph-based, and related architectures [31], [32]. Learning-assisted ISAC beamforming has also been investigated through predictive, deep-unfolding, Transformer, and graph-learning approaches [33], [34], [35], [36], [37], [38]. These studies demonstrate the potential of learning to reduce the repeated computational burden of iterative beamforming optimization. However, most existing learning-based designs either predict high-dimensional beamforming variables directly or focus primarily on communication and sensing performance without explicitly addressing the strong localization sensitivity introduced by near-field CRB constraints. The joint consideration of near-field E-MIMO geometry, low-dimensional physically structured communication–sensing beamforming, CRB-sensitive learning, and explicit post-inference feasibility recovery therefore remains insufficiently addressed.

A further challenge is that prediction accuracy and physical feasibility are not equivalent in constrained ISAC beamforming. Accurately approximating a reference optimization solution does not necessarily guarantee satisfaction of coupled nonconvex constraints [31], [32]. This issue becomes particularly important in near-field localization, where the CRB depends on the transmit covariance, geometry-dependent steering-vector derivatives, and the resulting Fisher information matrix. Consequently, relatively small stream-power prediction errors can produce noticeable CRB degradation when the operating point lies close to the localization-feasibility boundary. A learning framework should therefore account not only for prediction accuracy but also for the physical consequences of prediction errors.

Direct prediction of the complete complex-valued beamforming matrix also becomes increasingly inefficient as the E-MIMO array size grows. For an MM-element array serving KK communication users and LL sensing targets, direct beamformer prediction requires M(K+L)M(K+L) complex, or equivalently 2M(K+L)2M(K+L) real-valued, output variables. In contrast, exploiting physically meaningful communication and sensing directions allows the learning task to be restricted to the K+LK+L stream-power variables. Such a structured representation reduces the learning dimension while retaining the near-field spatial characteristics through physics-based beam construction.

To address these challenges, this paper proposes a physics-aware Transformer-based beamforming optimization (PATBO) framework for near-field E-MIMO-ISAC systems. PATBO constructs regularized zero-forcing (RZF) communication directions and near-field sensing directions from the system geometry, while the Transformer predicts only the K+LK+L normalized stream-power fractions. Geometry-aware entity tokens are processed using a token-preserving Transformer architecture that models inter-entity interactions without discarding the association between each user or target and its corresponding power variable. Safe-margin reference generation is employed to construct robust training targets, while CRB-sensitivity weighting emphasizes power-allocation errors having a stronger impact on localization performance. After inference, physical feasibility is explicitly verified; infeasible predictions are passed to a low-dimensional power-repair stage, and optimizer fallback is invoked when repair is unsuccessful.

The main contributions of this work are summarized as follows:

  • We develop a structured near-field E-MIMO-ISAC beamforming framework that combines RZF communication directions and spherical-wave near-field sensing directions with learned stream-power allocation. For M=1024M=1024, K=4K=4, and L=2L=2, this reduces the learned output representation from 12,288 real-valued beamforming coefficients to only six stream-power variables.

  • We propose a token-preserving Transformer with CRB-sensitivity-aware training. The architecture preserves the association between individual users/targets and their allocated powers, while emphasizing prediction errors having greater impact on near-field localization performance.

  • We develop a hierarchical verify–repair–fallback strategy for physical constraint satisfaction. Physics-constrained power repair increases joint feasibility from 19.54% to 87.79%, while the complete hybrid framework achieves 100% feasibility on the retained test set with optimizer fallback required for only 12.21% of the samples.

The remainder of this paper is organized as follows. Section II presents the near-field E-MIMO-ISAC system model and joint beamforming problem. Section III introduces the proposed PATBO framework. Section IV presents the numerical results, and Section V concludes the paper.

Notation: Boldface lowercase and uppercase letters denote vectors and matrices, respectively. The superscripts (⋅)T(\cdot)^T and (⋅)H(\cdot)^H denote the transpose and Hermitian transpose, respectively. The operators ∥⋅∥2\|\cdot\|_2 and ∥⋅∥F\|\cdot\|_F denote the Euclidean and Frobenius norms, while ∣⋅∣|\cdot| denotes the absolute value of a scalar. IN\mathbf{I}_N denotes the N×NN \times N identity matrix. The sets of real and complex matrices of size M×NM \times N are denoted by RM×N\mathbb{R}^{M \times N} and CM×N\mathbb{C}^{M \times N}, respectively. The operators tr⁡(⋅)\operatorname{tr}(\cdot) and diag⁡(⋅)\operatorname{diag}(\cdot) denote the matrix trace and diagonal matrix construction, respectively, while ℜ{⋅}\Re\{\cdot\} denotes the real part of a complex-valued quantity.

System Model and Problem Formulation

Near-Field E-MIMO-ISAC System

We consider a downlink E-MIMO-ISAC system in which a base station (BS) equipped with an MM-element antenna array simultaneously serves KK single-antenna communication users and senses LL targets. The communication and sensing functionalities share the same transmit array, bandwidth, and transmit-power budget.

Let

W=[wc,1,…,wc,K,ws,1,…,ws,L]∈CM×(K+L)(1)\mathbf{W} = [\mathbf{w}_{c,1}, \ldots, \mathbf{w}_{c,K}, \mathbf{w}_{s,1}, \ldots, \mathbf{w}_{s,L}] \in\mathbb{C}^{M \times(K+L)} \tag*{(1)}

denote the joint transmit beamforming matrix, where wc,k\mathbf{w}_{c,k} is the beamforming vector associated with communication user kk, and ws,l\mathbf{w}_{s,l} denotes the sensing beam associated with target ll.

The transmitted signal is

x=∑k=1Kwc,ksc,k+∑l=1Lws,lss,l,(2)\mathbf{x} = \sum_{k=1}^{K} \mathbf{w}_{c,k}s_{c,k} + \sum_{l=1}^{L} \mathbf{w}_{s,l}s_{s,l}, \tag*{(2)}

where sc,ks_{c,k} and ss,ls_{s,l} denote the normalized communication and sensing symbols, respectively. Assuming mutually uncorrelated unit-power streams, the total transmit power is Ptx=∥W∥F2P_{\mathrm{tx}} = \|\mathbf{W}\|_F^2. Accordingly, the transmit-power constraint is

∥W∥F2≤Pt,(3)\|\mathbf{W}\|_F^2 \leq P_t, \tag*{(3)}

where PtP_t denotes the maximum available transmit power.

Near-Field Propagation Model

Due to the large physical aperture of the E-MIMO array, users and sensing targets may lie inside the radiative near-field region. Therefore, spherical-wave propagation is considered instead of the conventional plane-wave approximation [39]. Let am∈R3\mathbf{a}_m \in\mathbb{R}^3 denote the Cartesian position of antenna element mm, and let p=[x,y,z]T\mathbf{p}=[x,y,z]^T denote the position of a user or sensing target. The propagation distance between antenna mm and position p\mathbf{p} is dm(p)=∥p−am∥2d_m(\mathbf{p})=\|\mathbf{p}-\mathbf{a}_m\|_2. A spherical-wave near-field response can be expressed as

[a(p)]m=14πdm(p)exp⁡(−j2πλdm(p)),(4)[\mathbf{a}(\mathbf{p})]_m=\frac{1}{\sqrt{4\pi d_m(\mathbf{p})}}\exp\left(-\mathrm{j}\frac{2\pi}{\lambda}d_m(\mathbf{p})\right), \tag*{(4)}

where λ\lambda denotes the carrier wavelength. The amplitude term accounts for distance-dependent propagation attenuation, whereas the spherical-wave phase preserves the element-dependent propagation distance required for near-field focusing. Consequently, both range and angular information are retained in the array response [40].

For communication user kk, let hk∈CM×1\mathbf{h}_k\in\mathbb{C}^{M\times1} denote the corresponding channel vector. The overall communication channel matrix is

H=[h1,…,hK]∈CM×K.(5)\mathbf{H}=[\mathbf{h}_1,\ldots,\mathbf{h}_K]\in\mathbb{C}^{M\times K}. \tag*{(5)}

Communication Performance

The received signal of communication user kk can be written as

yk=hkHwc,ksc,k+∑i=1i≠kKhkHwc,isc,i+∑l=1LhkHws,lss,l+nk,(6)y_k=\mathbf{h}_k^H\mathbf{w}_{c,k}s_{c,k}+\sum_{\substack{i=1\\i\ne k}}^K\mathbf{h}_k^H\mathbf{w}_{c,i}s_{c,i}+\sum_{l=1}^L\mathbf{h}_k^H\mathbf{w}_{s,l}s_{s,l}+n_k, \tag*{(6)}

where nkn_k denotes additive noise with variance σn2\sigma_n^2. Accordingly, the communication SINR is

γkc=∣hkHwc,k∣2∑i=1i≠kK∣hkHwc,i∣2+∑l=1L∣hkHws,l∣2+σn2.(7)\gamma_k^c=\frac{|\mathbf{h}_k^H\mathbf{w}_{c,k}|^2}{\sum_{\substack{i=1\\i\ne k}}^K|\mathbf{h}_k^H\mathbf{w}_{c,i}|^2+\sum_{l=1}^L|\mathbf{h}_k^H\mathbf{w}_{s,l}|^2+\sigma_n^2}. \tag*{(7)}

The achievable rate of user kk is

Rk=log⁡2(1+γkc) bit/s/Hz,(8)R_k=\log_2(1+\gamma_k^c)\ \text{bit/s/Hz}, \tag*{(8)}

and the system sum rate is

Rsum=∑k=1KRk.(9)R_{\mathrm{sum}}=\sum_{k=1}^K R_k. \tag*{(9)}

Each communication user is required to satisfy Rk≥Rmin⁡R_k\ge R_{\min}, k=1,…,Kk=1,\ldots,K.

Near-Field Sensing and Localization Model

In addition to serving the KK communication users, the E-MIMO transmitter simultaneously illuminates LL sensing targets. Let pl=[xl,yl,zl]T\mathbf{p}_l=[x_l,y_l,z_l]^T, l=1,…,Ll=1,\ldots,L, denote the three-dimensional Cartesian position of sensing target ll. Owing to the electrically large aperture of the E-MIMO array, the sensing targets may lie in the radiative near-field region. Therefore, the sensing model is constructed using position-dependent near-field steering vectors rather than conventional far-field angle-only steering vectors [7, 41].

For target ll, let al≜a(pl)∈CM×1\mathbf{a}_l\triangleq\mathbf{a}(\mathbf{p}_l)\in\mathbb{C}^{M\times1} denote its near-field steering vector. The corresponding normalized near-field focusing direction is constructed as

vs,l=a(pl)∥a(pl)∥2.(10)\mathbf{v}_{s,l}=\frac{\mathbf{a}(\mathbf{p}_l)}{\|\mathbf{a}(\mathbf{p}_l)\|_2}. \tag*{(10)}

Unlike far-field beam steering, which primarily controls the angular direction of the transmitted beam, (10) exploits the spherical-wave propagation structure to focus the transmitted energy toward a specific three-dimensional position [6, 40].

Sensing SINR

The sensing quality of target ll is characterized by its sensing SINR. The dedicated sensing beam ws,l\mathbf{w}_{s,l} constitutes the desired sensing signal, whereas the sensing beams intended for the other targets are treated as inter-target sensing interference. Accordingly, the sensing SINR of target ll is given by

γls=∣alHws,l∣2∑j=1j≠lL∣alHws,j∣2+σn2,(11)\gamma_l^s=\frac{|\mathbf{a}_l^H\mathbf{w}_{s,l}|^2}{\sum_{\substack{j=1\\j\ne l}}^L|\mathbf{a}_l^H\mathbf{w}_{s,j}|^2+\sigma_n^2}, \tag*{(11)}

where σn2\sigma_n^2 denotes the sensing-noise power. In the considered sensing model, interference among the dedicated sensing streams is explicitly accounted for in (11).

To guarantee a minimum sensing quality for every target, the target-wise sensing-SINR constraint is

γls≥γmin⁡s,l=1,…,L,(12)\gamma_l^s\ge\gamma_{\min}^s,\qquad l=1,\ldots,L, \tag*{(12)}

where γmin⁡s\gamma_{\min}^s denotes the minimum required sensing-SINR threshold. For performance evaluation, the worst-case sensing SINR over all targets is defined as

γwcs=min⁡l=1,…,Lγls.(13)\gamma_{\mathrm{wc}}^s=\min_{l=1,\ldots,L}\gamma_l^s. \tag*{(13)}

This metric determines whether all sensing targets simultaneously satisfy the required sensing-SINR condition.

Near-Field Localization CRB

In addition to the sensing-SINR requirement, localization accuracy is quantified through the CRB. Near-field sensing with extremely large arrays provides range-dependent geometric information that can be exploited for three-dimensional target localization, whose theoretical estimation accuracy can be characterized through the Fisher information matrix (FIM) and CRB [41].

The target location is specified by three Cartesian coordinates. Define the Jacobian of the near-field steering vector with respect to the target position as

Gl=[∂a(pl)∂xl,∂a(pl)∂yl,∂a(pl)∂zl]∈CM×3.(14)\mathbf{G}_l=\left[\frac{\partial\mathbf{a}(\mathbf{p}_l)}{\partial x_l},\frac{\partial\mathbf{a}(\mathbf{p}_l)}{\partial y_l},\frac{\partial\mathbf{a}(\mathbf{p}_l)}{\partial z_l}\right]\in\mathbb{C}^{M\times3}. \tag*{(14)}

In the numerical implementation, the spatial derivatives in (14) are evaluated using the central finite-difference approximation

∂a(pl)∂[pl]q≈a(pl+δeq)−a(pl−δeq)2δ,(15)\frac{\partial\mathbf{a}(\mathbf{p}_l)}{\partial[\mathbf{p}_l]_q}\approx\frac{\mathbf{a}(\mathbf{p}_l+\delta\mathbf{e}_q)-\mathbf{a}(\mathbf{p}_l-\delta\mathbf{e}_q)}{2\delta}, \tag*{(15)}

where eq\mathbf{e}_q denotes the qqth Cartesian basis vector and δ=10−4 m\delta=10^{-4}\ \mathrm{m} is the perturbation step used in the numerical evaluation.

For a given joint beamforming matrix W\mathbf{W}, define the transmit covariance matrix as Q=WWH\mathbf{Q}=\mathbf{W}\mathbf{W}^{H}. The FIM associated with the Cartesian position of target ll is then evaluated as

Jl=2∣αl∣2σn2ℜ{GlHQGl},(16)\mathbf{J}_{l}=\frac{2|\alpha_l|^2}{\sigma_n^2}\Re\left\{\mathbf{G}_l^{H}\mathbf{Q}\mathbf{G}_l\right\}, \tag*{(16)}

where αl\alpha_l denotes the effective target-reflection coefficient. The FIM is made numerically symmetric before evaluating the localization bound.

The Cartesian localization CRB for target ll is defined as

Cl(W)=tr⁡(Jl−1).(17)C_l(\mathbf{W})=\operatorname{tr}\left(\mathbf{J}_l^{-1}\right). \tag*{(17)}

Hence, a smaller value of Cl(W)C_l(\mathbf{W}) corresponds to greater position information and, consequently, a lower theoretical localization-error bound.

For robust numerical evaluation of (17), let λl,i\lambda_{l,i}, i=1,2,3i=1,2,3, denote the eigenvalues of the symmetrized FIM, with λl,max⁡=max⁡i=1,2,3λl,i\lambda_{l,\max}=\max_{i=1,2,3}\lambda_{l,i}. A relative eigenvalue floor is introduced as λfloor,l=ϵλλl,max⁡\lambda_{\mathrm{floor},l}=\epsilon_\lambda\lambda_{l,\max}, where ϵλ=10−12\epsilon_\lambda=10^{-12} in the numerical implementation. The effective eigenvalues are then defined as

λ~l,i=max⁡{λl,i,λfloor,l}.(18)\widetilde{\lambda}_{l,i}=\max\{\lambda_{l,i},\lambda_{\mathrm{floor},l}\}. \tag*{(18)}

Accordingly, the numerically robust CRB used in the simulations is evaluated as

C~l(W)=∑i=131λl,i.(19)\widetilde{C}_l(\mathbf{W})=\sum_{i=1}^{3}\frac{1}{\lambda_{l,i}}. \tag*{(19)}

For the LL sensing targets, the aggregate localization metric is defined as

C(W)=∑l=1LC~l(W).(20)C(\mathbf{W})=\sum_{l=1}^{L}\widetilde{C}_l(\mathbf{W}). \tag*{(20)}

The aggregate localization accuracy is constrained according to

C(W)≤ΓCRB,(21)C(\mathbf{W})\leq\Gamma_{\mathrm{CRB}}, \tag*{(21)}

where ΓCRB\Gamma_{\mathrm{CRB}} denotes the maximum allowable aggregate CRB. Consequently, the sensing component of the considered E-MIMO-ISAC system is governed by two complementary requirements: (12) guarantees sufficient target-wise sensing SINR, whereas (21) controls the three-dimensional localization accuracy. These two sensing requirements are incorporated jointly with the communication and transmit-power constraints in the beamforming optimization problem formulated next.

Joint Beamforming Problem

The general beamforming design objective is to maximize the communication sum rate while satisfying the communication QoS, sensing SINR, localization CRB, and total transmit-power requirements, consistent with the constrained beamforming formulations commonly considered for near-field ISAC systems [8], [13]. Before imposing the structured beam-direction parameterization adopted in this work, this design objective can be expressed in terms of the joint beamforming matrix as

maximize⁡W∑k=1KRksubject to⁡Rk≥Rmin⁡,∀k,γls≥γmin⁡s,∀l,C(W)≤ΓCRB,∥W∥F2≤Pt.(22)\begin{aligned} \underset{\mathbf{W}}{\operatorname{maximize}}\quad&\sum_{k=1}^{K}R_k \\ \operatorname{subject\ to}\quad&R_k\geq R_{\min},\quad\forall k,\\ &\gamma_l^{s}\geq\gamma_{\min}^{s},\quad\forall l,\\ &C(\mathbf{W})\leq\Gamma_{\mathrm{CRB}},\\ &\lVert\mathbf{W}\rVert_F^2\leq P_t. \tag*{(22)} \end{aligned}

Directly optimizing (22) over an unrestricted complex beamforming matrix would involve 2M(K+L)2M(K+L) real-valued coefficients. In the proposed framework, however, both the numerical reference and PATBO employ the structured beam directions introduced in Section III. Consequently, the implemented optimization problem is reduced to the K+LK+L stream-power variables associated with these directions. PATBO further replaces repeated numerical optimization of these powers with learned prediction, followed by explicit physical verification and selective feasibility recovery.

Proposed Physics-Aware Transformer-Based Beamforming Optimization

Overview

The proposed PATBO framework separates the beamforming problem into two components: physically constructed beam directions and learned stream-power allocation. Rather than directly predicting the complete complex-valued beamforming matrix, the Transformer estimates only the normalized powers assigned to the KK communication and LL sensing streams.

For each scenario, PATBO performs four main operations:

  1. geometry-aware token construction and Transformer-based power prediction;

  2. physical communication and sensing beam-direction generation;

  3. beamformer reconstruction and physical feasibility verification; and

  4. adaptive physics-based repair and optimizer fallback when required.

The overall architecture of the proposed PATBO framework is illustrated in Figure 1. The near-field user–target geometry is first represented through geometry-aware tokens, which are processed by the PATBO Transformer to predict the normalized power allocation for the communication and sensing streams. The predicted powers are combined with physically constructed RZF communication directions and near-field sensing directions to form the structured beamformer. Its physical feasibility is then verified with respect to the communication QoS, sensing SINR, aggregate CRB, and transmit-power constraints. Infeasible predictions are passed to the physics-constrained power-repair stage, whereas feasible beamformers are directly accepted.

Proposed PATBO framework for near-field E-MIMO-ISAC

Figure 1. Proposed PATBO framework for near-field E-MIMO-ISAC combining token-preserving stream-power prediction, physics-based beamformer reconstruction, feasibility verification, and repair–fallback recovery.

Geometry-Aware Token Representation

Each communication user and sensing target is represented by an individual Transformer token. The communication-user token is defined as

zkc=[xk,yk,zk,rk,θk,ϕk,0,0,0,0]T.(23)\mathbf{z}^{c}_{k} = [x_k,y_k,z_k,r_k,\theta_k,\phi_k,0,0,0,0]^{T}. \tag*{(23)}

where (xk,yk,zk)(x_k,y_k,z_k) denotes the Cartesian position, rkr_k denotes the distance from the BS reference point, and θk\theta_k and ϕk\phi_k denote the corresponding angular coordinates.

For sensing target ll, the token is

zls=[xl,yl,zl,rl,θl,ϕl,σx,l,σy,l,σz,l,1]T.(24)\mathbf{z}^{s}_{l} = [x_l,y_l,z_l,r_l,\theta_l,\phi_l,\sigma_{x,l},\sigma_{y,l},\sigma_{z,l},1]^{T}. \tag*{(24)}

where σx,l\sigma_{x,l}, σy,l\sigma_{y,l}, and σz,l\sigma_{z,l} denote the standard deviations of the assumed target-position uncertainty along the Cartesian axes. The last token entry serves as a type indicator, where zero represents a communication user and one represents a sensing target. The complete Transformer input is

X=[z1c,…,zKc,z1s,…,zLs]∈R10×(K+L).(25)\mathbf{X} = [\mathbf{z}^{c}_{1},\ldots,\mathbf{z}^{c}_{K},\mathbf{z}^{s}_{1},\ldots,\mathbf{z}^{s}_{L}] \in\mathbb{R}^{10 \times(K+L)}. \tag*{(25)}

The range is r=x2+y2+z2r = \sqrt{x^2+y^2+z^2}, and the angles are θ=atan2⁡(x,z)\theta= \operatorname{atan2}(x,z) and ϕ=atan2⁡(y,x2+z2)\phi= \operatorname{atan2}(y,\sqrt{x^2+z^2}). For each feature dimension dd, the normalization parameters μd\mu_d and σd\sigma_d are calculated exclusively from the training samples. The normalized feature is

X~d,q=Xd,q−μdσd.(26)\widetilde{X}_{d,q} = \frac{X_{d,q}-\mu_d}{\sigma_d}. \tag*{(26)}

The same training-derived statistics are applied to the validation and test sets.

Token-Preserving Transformer-Based Power Allocation

To capture the coupled interactions among communication users and sensing targets, PATBO employs a Transformer encoder based on multi-head self-attention. Transformer architectures are well suited to modeling dependencies among sequence elements and have recently been investigated for learning constrained wireless resource-allocation and beamforming mappings [42].

Each 10-dimensional entity token is first mapped into a dmodel=64d_{\mathrm{model}}=64 dimensional latent representation. Let

Z(0)=[z1(0),…,zK+L(0)]∈Rdmodel×(K+L)(27)\mathbf{Z}^{(0)} = [\mathbf{z}^{(0)}_1,\ldots,\mathbf{z}^{(0)}_{K+L}] \in\mathbb{R}^{d_{\mathrm{model}}\times(K+L)} \tag*{(27)}

denote the embedded token sequence.

The latent sequence is processed by two Transformer encoder stages, each employing four attention heads and a feed-forward dimension of 128. A dropout probability of 0.1 is applied within the network. After the final encoder stage, the resulting token representations are denoted as

Z(T)=[z1(T),…,zK+L(T)].(28)\mathbf{Z}^{(T)} = [\mathbf{z}^{(T)}_1,\ldots,\mathbf{z}^{(T)}_{K+L}]. \tag*{(28)}

Through self-attention, each token incorporates information from all communication users and sensing targets. Hence, the latent representation of a particular stream captures not only its own geometric characteristics, but also the coupled multi-user and multi-target interactions induced by the shared communication, sensing, localization, and transmit-power requirements.

A key feature of the proposed architecture is that the individual token representations are preserved after the Transformer encoders. In particular, no global pooling operation is applied across the token dimension. Instead, each final token representation zq(T)z_q^{(T)} is processed using a shared token-wise readout:

ℓq=fout(zq(T)),q=1,…,K+L,(29)\ell_q = f_{\mathrm{out}}\left(z_q^{(T)}\right), \qquad q=1,\ldots,K+L, \tag*{(29)}

where fout(⋅)f_{\mathrm{out}}(\cdot) consists of a 64-unit fully connected layer, a Gaussian error linear unit (GELU) activation, dropout, and a scalar output projection.

The resulting K+LK+L entity-specific logits are jointly normalized through a softmax operation:

ρ^q=exp⁡(ℓq)∑j=1K+Lexp⁡(ℓj),q=1,…,K+L.(30)\widehat{\rho}_q = \frac{\exp(\ell_q)}{\sum_{j=1}^{K+L}\exp(\ell_j)}, \qquad q=1,\ldots,K+L. \tag*{(30)}

Therefore, the predicted normalized stream-power vector is

ρ^=[ρ^1,…,ρ^K+L]T,(31)\widehat{\boldsymbol{\rho}} = [\widehat{\rho}_1,\ldots,\widehat{\rho}_{K+L}]^{\mathsf{T}}, \tag*{(31)}

which satisfies

ρ^q≥0,∑q=1K+Lρ^q=1.(32)\widehat{\rho}_q \ge0,\qquad\sum_{q=1}^{K+L}\widehat{\rho}_q=1. \tag*{(32)}

The corresponding physical stream-power vector is

p^=Ptρ^.(33)\widehat{\mathbf{p}}=P_t\widehat{\boldsymbol{\rho}}. \tag*{(33)}

The token-preserving readout is particularly important in the considered problem because each output power corresponds to a specific physical entity. Global aggregation before the output layer can suppress this entity identity, whereas the proposed readout maintains the one-to-one association between the qqth communication-user or sensing-target token and its corresponding stream-power variable. At the same time, the preceding self-attention layers continue to model interactions among all entities.

Physics-Based Beam-Direction Construction

The communication beam directions are generated using RZF, which provides a practical tradeoff between multi-user interference suppression and noise enhancement [43]. The unnormalized RZF direction matrix is

V~c=H(HHH+αRZFIK)−1,(34)\widetilde{\mathbf{V}}_{\mathrm{c}}=\mathbf{H}\left(\mathbf{H}^{H}\mathbf{H}+\alpha_{\mathrm{RZF}}\mathbf{I}_{K}\right)^{-1}, \tag*{(34)}

where the regularization parameter is selected as

αRZF=Kσn2Pc,0,Pc,0=0.8Pt,(35)\alpha_{\mathrm{RZF}}=\frac{K\sigma_n^2}{P_{\mathrm{c},0}},\qquad P_{\mathrm{c},0}=0.8P_t, \tag*{(35)}

where Pc,0P_{\mathrm{c},0} denotes the nominal communication-power level used for constructing the RZF directions in the reference beamformer. Each communication direction is normalized as

vc,k=v~c,k∥v~c,k∥2.(36)\mathbf{v}_{\mathrm{c},k}=\frac{\widetilde{\mathbf{v}}_{\mathrm{c},k}}{\left\|\widetilde{\mathbf{v}}_{\mathrm{c},k}\right\|_2}. \tag*{(36)}

For sensing target ll, the near-field sensing direction is given by the normalized focusing vector in (10). Thus, the complete direction matrix is

V=[Vc,Vs]∈CM×(K+L).(37)\mathbf{V}=[\mathbf{V}_{\mathrm{c}},\mathbf{V}_{\mathrm{s}}]\in\mathbb{C}^{M\times(K+L)}. \tag*{(37)}

Beamformer Reconstruction

The Transformer-predicted beamformer is reconstructed as

W^=Vdiag⁡(Ptρ^).(38)\widehat{\mathbf{W}}=\mathbf{V}\operatorname{diag}\left(\sqrt{P_t\widehat{\boldsymbol{\rho}}}\right). \tag*{(38)}

Since every physical beam direction satisfies ∥vq∥2=1\|\mathbf{v}_q\|_2=1 and the Transformer output satisfies (32), it follows that

∥W^∥F2=∑q=1K+LPtρ^q=Pt.(39)\left\|\widehat{\mathbf{W}}\right\|_{\mathrm{F}}^2=\sum_{q=1}^{K+L}P_t\widehat{\rho}_q=P_t. \tag*{(39)}

Hence, under the unit-norm beam-direction construction, the total transmit-power requirement is structurally enforced by the simplex-constrained output parameterization.

This representation also significantly reduces the learned output dimension. Direct prediction of the complete complex beamforming matrix requires

2M(K+L)(40)2M(K+L) \tag*{(40)}

real-valued outputs, whereas PATBO predicts only K+LK+L real-valued normalized stream powers. Therefore, the learned output-dimensionality reduction factor relative to an unstructured full-beamformer predictor is

2M(K+L)K+L=2M.(41)\frac{2M(K+L)}{K+L}=2M. \tag*{(41)}

For the considered M=1024M=1024, K=4K=4, and L=2L=2 configuration, direct prediction of the complex beamforming matrix would require 2×1024×6=12,2882\times1024\times6=12{,}288 real-valued outputs, whereas PATBO predicts only six normalized stream powers. This corresponds to a 2048×2048\times reduction in learned output dimensionality.

This comparison concerns the neural-network output representation. The numerical reference optimizer employed for label generation also operates over the same K+LK+L structured stream-power variables while keeping the physical communication and sensing beam directions fixed.

Safe-Margin Reference Generation

A neural predictor trained using reference solutions located close to the CRB feasibility boundary may violate the original CRB requirement even when the corresponding power-allocation prediction error is small. To provide additional robustness, PATBO generates reference training labels using an adaptively tightened CRB requirement.

Let CCRBmin⁡C_{\mathrm{CRB}}^{\min} denote the minimum aggregate CRB obtained under the physically constructed beam directions while satisfying the communication-QoS, sensing-SINR, and transmit-power requirements. Let CCRBbaseC_{\mathrm{CRB}}^{\mathrm{base}} denote the aggregate CRB of the baseline structured beamformer. An adaptive operational CRB threshold is first constructed as

ΓCRBorig=CCRBmin⁡+ηCRB(CCRBbase−CCRBmin⁡),(42)\Gamma_{\mathrm{CRB}}^{\mathrm{orig}}=C_{\mathrm{CRB}}^{\min}+\eta_{\mathrm{CRB}}\left(C_{\mathrm{CRB}}^{\mathrm{base}}-C_{\mathrm{CRB}}^{\min}\right), \tag*{(42)}

where the values 0.50, 0.70, 0.85, 0.95, and 1.00 are tested in order for ηCRB\eta_{\mathrm{CRB}} until a feasible reference solution is obtained.

To provide a safety margin for training while preventing the tightened threshold from falling below the achievable CRB region, the safe threshold is defined as

ΓCRBsafe=min⁡{ΓCRBorig,max⁡[ηsΓCRBorig,(1+ϵs)CCRBmin⁡]}.(43)\Gamma_{\mathrm{CRB}}^{\mathrm{safe}}=\min\left\{\Gamma_{\mathrm{CRB}}^{\mathrm{orig}},\max\left[\eta_{\mathrm{s}}\Gamma_{\mathrm{CRB}}^{\mathrm{orig}},(1+\epsilon_{\mathrm{s}})C_{\mathrm{CRB}}^{\min}\right]\right\}. \tag*{(43)}

Algorithm 1 Safe-Margin Reference Generation

Require: H\mathbf{H}, target positions, PtP_t, ηs\eta_s, Rmin⁡R_{\min}, and γmin⁡s\gamma_{\min}^{s}

Ensure: ρ⋆\boldsymbol{\rho}^{\star}, ΓCRBsafe\Gamma_{\mathrm{CRB}}^{\mathrm{safe}}

  1. Construct the communication and sensing beam directions according to (34)–(37).

  2. Minimize the CRB over the stream powers subject to communication QoS, sensing SINR, and transmit-power constraints to obtain CCRBmin⁡C_{\mathrm{CRB}}^{\min}.

  3. Evaluate the aggregate CRB CCRBbaseC_{\mathrm{CRB}}^{\mathrm{base}} of the baseline structured beamformer.

  4. Construct ΓCRBorig\Gamma_{\mathrm{CRB}}^{\mathrm{orig}} according to (42).

  5. Construct ΓCRBsafe\Gamma_{\mathrm{CRB}}^{\mathrm{safe}} according to (43).

  6. Solve the constrained reference power-allocation problem under ΓCRBsafe\Gamma_{\mathrm{CRB}}^{\mathrm{safe}}.

  7. Normalize the optimized powers as ρ⋆=p⋆/Pt\boldsymbol{\rho}^{\star}=\mathbf{p}^{\star}/P_t.

  8. return ρ⋆\boldsymbol{\rho}^{\star}, ΓCRBsafe\Gamma_{\mathrm{CRB}}^{\mathrm{safe}}.

where ηs=0.95\eta_s=0.95 is the CRB safety factor and ϵs=10−3\epsilon_s=10^{-3} provides a small numerical buffer above the minimum achievable aggregate CRB CCRBmin⁡C_{\mathrm{CRB}}^{\min}. The inner maximum prevents the tightened threshold from falling below the feasible CRB region, while the outer minimum ensures that the safe threshold does not exceed the original operational threshold. The complete safe-margin reference-generation procedure is summarized in Algorithm 1.

CRB Sensitivity Estimation

A small power-allocation error can have substantially different physical consequences depending on the corresponding stream. PATBO therefore estimates the local sensitivity of the aggregate CRB to each normalized stream-power variable.

Let C(ρ)C(\boldsymbol{\rho}) denote the aggregate CRB obtained using normalized power allocation ρ\boldsymbol{\rho}. For stream qq, a local simplex-constrained directional sensitivity is approximated using a central finite difference:

gq,n≈C(ρq,n+)−C(ρq,n−)2Δρ,(44)g_{q,n}\approx\frac{C(\boldsymbol{\rho}_{q,n}^{+})-C(\boldsymbol{\rho}_{q,n}^{-})}{2\Delta\rho}, \tag*{(44)}

where Δρ=10−3\Delta\rho=10^{-3}.

Following each positive or negative perturbation, the power vector is projected back onto the unit simplex to preserve ρq≥0\rho_q\geq0 and ∑qρq=1\sum_q\rho_q=1. Consequently, gq,ng_{q,n} should be interpreted as a coupled local directional sensitivity under the fixed-total-power simplex constraint, rather than as an unconstrained partial derivative with respect to a single independent power variable. For numerical stability, the CRB gradient is normalized by the corresponding safe CRB threshold:

g~q,n=gq,nΓCRB,nsafe.(45)\widetilde{g}_{q,n}=\frac{g_{q,n}}{\Gamma_{\mathrm{CRB},n}^{\mathrm{safe}}}. \tag*{(45)}

CRB-Sensitivity-Aware Training

Let ρq,n⋆\rho_{q,n}^{\star} denote the normalized reference stream power for entity qq in sample nn, and let ρ^q,n\widehat{\rho}_{q,n} denote the corresponding PATBO prediction. The stream-wise prediction error is

eq,n=ρ^q,n−ρq,n⋆.(46)e_{q,n}=\widehat{\rho}_{q,n}-\rho_{q,n}^{\star}. \tag*{(46)}

Although a conventional mean-squared-error objective treats all power deviations equally, power-allocation errors can have substantially different physical consequences in near-field localization. In particular, a relatively small perturbation of a CRB-sensitive stream may cause a larger localization penalty than a comparable perturbation of a less-sensitive stream.

To reflect this behavior during training, the CRB-sensitivity weight is defined as

wq,nsens=1+λs∣g~q,n∣,(47)w_{q,n}^{\mathrm{sens}}=1+\lambda_s\left|\widetilde{g}_{q,n}\right|, \tag*{(47)}

where g~q,n\widetilde{g}_{q,n} is the normalized simplex-constrained CRB sensitivity defined in (45), and λs=0.5\lambda_s=0.5 controls the contribution of the physics-based weighting.

For a mini-batch containing NbN_b samples, the proposed PATBO training objective is

LPATBO=1Nb(K+L)∑n=1Nb∑q=1K+Lwq,nsens(ρ^q,n−ρq,n⋆)2.(48)\mathcal{L}_{\mathrm{PATBO}}=\frac{1}{N_b(K+L)}\sum_{n=1}^{N_b}\sum_{q=1}^{K+L}w_{q,n}^{\mathrm{sens}}\left(\widehat{\rho}_{q,n}-\rho_{q,n}^{\star}\right)^2. \tag*{(48)}

Hence, the proposed objective assigns larger penalties to prediction errors associated with streams having stronger local impact on the aggregate localization CRB. The loss remains a weighted regression objective over the normalized stream powers, while the physically constructed communication and sensing beam directions are preserved outside the neural predictor.

The final PATBO formulation deliberately employs only the CRB-sensitivity weighting in the neural loss. The safe CRB threshold is retained during reference generation to construct robust training targets, but the safe-margin value is not used as an additional sample weight in the final training objective. The complete CRB-sensitivity estimation and PATBO training procedure is summarized in Algorithm 2.

Physical Feasibility Verification

After reconstructing the Transformer-predicted beamformer W^\widehat{\mathbf{W}} according to (38), its feasibility is evaluated using the original operational constraints rather than the tightened CRB threshold used for reference generation. For a candidate beamformer W\mathbf{W}, define the feasibility indicator

F(W)=I{Rk≥Rmin⁡,∀k;γls≥γmin⁡s,∀l;C(W)≤ΓCRBorig;∥W∥F2≤Pt}.(49)\mathcal{F}(\mathbf{W})=\mathbb{I}\left\{ \begin{array}{l} R_k\geq R_{\min},\quad\forall k;\\ \gamma_l^{s}\geq\gamma_{\min}^{s},\quad\forall l;\\ C(\mathbf{W})\leq\Gamma_{\mathrm{CRB}}^{\mathrm{orig}};\\ \lVert\mathbf{W}\rVert_F^2\leq P_t \end{array} \right\}. \tag*{(49)}

where F(W)=1\mathcal{F}(\mathbf{W})=1 indicates that W\mathbf{W} satisfies all original physical constraints, and F(W)=0\mathcal{F}(\mathbf{W})=0 otherwise. If F(W^)=1\mathcal{F}(\widehat{\mathbf{W}})=1, the Transformer output is directly accepted; otherwise, physics-constrained repair is invoked.

Physics-Constrained Power Repair

If the Transformer prediction violates one or more original constraints, PATBO invokes a low-dimensional physics-constrained power-repair stage. The physical beam directions V\mathbf{V} remain fixed, while only the K+LK+L real-valued stream powers are optimized.

Algorithm 2 CRB-Sensitivity-Aware PATBO Training

Require: Training tokens {Xn}\{X_n\}, reference powers {ρn⋆}\{\rho_n^\star\}, safe CRB thresholds {ΓCRB,nsafe}\{\Gamma_{\mathrm{CRB},n}^{\mathrm{safe}}\}, perturbation Δρ\Delta_\rho, and sensitivity factor λs\lambda_s

Ensure: Trained PATBO parameters Θ⋆\Theta^\star

  1. for each training sample nn do

  2. for q=1,…,K+Lq=1,\ldots,K+L do

  3. Perturb ρq,n⋆\rho_{q,n}^\star by ±Δρ\pm\Delta_\rho.

  4. Project the positive and negative perturbed power vectors onto the unit simplex.

  5. Evaluate the aggregate CRB for both perturbed allocations.

  6. Compute the finite-difference sensitivity using (44).

  7. Normalize the sensitivity using (45).

  8. Compute wq,nsensw_{q,n}^{\mathrm{sens}} using (47).

  9. end for

  10. end for

  11. repeat

  12. Predict normalized stream-power allocations for a mini-batch using the token-preserving Transformer.

  13. Compute LPATBO\mathcal{L}_{\mathrm{PATBO}} using (48).

  14. Update the network parameters.

  15. Evaluate the validation loss.

  16. until the validation stopping criterion is satisfied

  17. return Parameters corresponding to the best validation loss

Let p^\hat{\mathbf{p}} denote the Transformer-predicted physical power vector. The repair problem is formulated as

minimize⁡p∥p−p^Pt∥22(50)\begin{aligned} \underset{\mathbf{p}}{\operatorname{minimize}}\quad&\left\|\frac{\mathbf{p}-\hat{\mathbf{p}}}{P_t}\right\|_2^2 \tag*{(50)} \end{aligned}
Rk(W(p))≥Rmin⁡,∀k,(51)R_k(\mathbf{W}(\mathbf{p})) \ge R_{\min},\quad\forall k, \tag*{(51)}
γls(W(p))≥γmin⁡s,∀l,(52)\gamma_l^s(\mathbf{W}(\mathbf{p})) \ge\gamma_{\min}^s,\quad\forall l, \tag*{(52)}
C(W(p))≤ΓCRBorig,(53)\mathcal{C}(\mathbf{W}(\mathbf{p})) \le\Gamma_{\mathrm{CRB}}^{\mathrm{orig}}, \tag*{(53)}
∑q=1K+Lpq=Pt,(54)\sum_{q=1}^{K+L}p_q=P_t, \tag*{(54)}
pq≥0,q=1,…,K+L.(55)p_q\ge0,\quad q=1,\ldots,K+L. \tag*{(55)}

Here, W(p)=Vdiag⁡(p)\mathbf{W}(\mathbf{p})=\mathbf{V}\operatorname{diag}(\sqrt{\mathbf{p}}).

The repair problem therefore operates over only K+LK+L real-valued stream-power variables, while the physically constructed beam directions remain fixed. Consequently, the dimensionality of the repair optimization is independent of the number of antenna elements MM.

The first repair attempt is initialized as p(0)=p^\mathbf{p}^{(0)}=\hat{\mathbf{p}}. If this attempt fails to recover feasibility, a second sensing-oriented initialization is employed. Let Pc=∑k=1Kp^kP_c=\sum_{k=1}^{K}\hat{p}_k denote the communication-stream power. A fraction δs=0.1\delta_s=0.1 of PcP_c is removed proportionally from the communication streams and distributed equally among the LL sensing streams. The repair problem is then solved again from this modified initialization.

In the implementation, the constrained power-repair problem is solved using sequential quadratic programming (SQP), a standard numerical approach for constrained nonlinear optimization [44]. Since repair is invoked only for infeasible Transformer predictions, its computational cost is avoided whenever direct neural inference already produces a feasible physical solution.

Hybrid PATBO Inference

Although physics-constrained repair can recover a substantial portion of infeasible Transformer predictions, a repair solution is not assumed to exist for every realization. Therefore, the final PATBO framework includes a constrained optimizer fallback for cases that remain infeasible after physics-based repair.

Let Wrep\mathbf{W}_{\mathrm{rep}} denote the repaired solution and Wfb\mathbf{W}_{\mathrm{fb}} denote a feasible solution returned by the constrained optimizer fallback. The final hybrid beamformer is selected according to

WPATBO={W^,F(W^)=1,Wrep,F(W^)=0 and F(Wrep)=1,Wfb,otherwise.(56)\mathbf{W}_{\mathrm{PATBO}}= \begin{cases} \widehat{\mathbf{W}}, & \mathcal{F}(\widehat{\mathbf{W}})=1,\\ \mathbf{W}_{\mathrm{rep}}, & \mathcal{F}(\widehat{\mathbf{W}})=0\ \text{and}\ \mathcal{F}(\mathbf{W}_{\mathrm{rep}})=1,\\ \mathbf{W}_{\mathrm{fb}}, & \text{otherwise}. \end{cases} \tag*{(56)}

In the offline retained-test-set evaluation, the stored feasible reference solution is used as the fallback realization. Therefore, the reported 100% final test-set feasibility should be interpreted as an empirical result on the retained evaluation set rather than as a universal guarantee that every unseen realization can be recovered by the proposed direct or repair stages.

Hence, PATBO follows a hierarchical computational strategy. Transformer inference provides the lowest-latency solution. Physics-constrained power repair is activated only when necessary, while the reference optimizer is reserved for scenarios that cannot be recovered through low-dimensional repair. The resulting architecture therefore provides multiple operating modes with different latency–reliability tradeoffs. Direct Transformer inference offers the lowest online latency, whereas physics-constrained repair and reference optimization can be invoked when stronger feasibility guarantees are required.

An additional advantage of the structured formulation is its favorable scaling with the array size. Although increasing MM enlarges the physical communication and sensing beam directions, the Transformer continues to predict only K+LK+L stream-power variables. Hence, for fixed numbers of users and targets, the learned output dimension is independent of MM. This property is particularly relevant to E-MIMO systems, where direct prediction of the complete beamforming matrix becomes increasingly challenging as the array size grows. The proposed structure therefore retains the array-dependent near-field propagation characteristics in the physical beam construction while confining learning to the lower-dimensional resource-allocation problem.

Simulation Setup and Numerical Results

Simulation Setup

The proposed PATBO framework is evaluated using a 32×3232\times32 UPA with M=1024M=1024 antennas, K=4K=4 communication users, and L=2L = 2 sensing targets at fc=8f_c = 8 GHz. The antenna spacing is λ/2\lambda/2, and the users and targets are randomly located in the radiative near-field region at ranges of 8–12 m. The target-position uncertainty along each Cartesian dimension is independently generated between 0.01 and 0.10 m. The communication and sensing beam directions are constructed using RZF and spherical-wave near-field focusing, respectively. The remaining system parameters are summarized in Table I.

ParameterValue
Number of BS antennas, MM1024
UPA configuration32×3232 \times32
Number of communication users, KK4
Number of sensing targets, LL2
Carrier frequency, fcf_c8 GHz
Antenna spacing, ddλ/2\lambda/2
Total normalized transmit power, PtP_t100
Noise power, σ2\sigma^21
Minimum user rate, Rmin⁡R_{\min}1 bit/s/Hz
Minimum sensing SINR5 dB
User/target range8–12 m
Target-position uncertainty0.01–0.10 m
CRB safety factor, ηs\eta_s0.95
Generated scenarios5000
Retained valid scenarios4632
Training/validation/test split3242/694/696

Table I. Simulation parameters

A total of 5000 random scenarios are generated. A realization is retained only when the structured reference optimization produces a valid solution satisfying the imposed physical constraints. This results in 4632 valid realizations (92.64%), which are divided into 3242 training, 694 validation, and 696 test samples. The safe-margin procedure of Section III-F uses ηs=0.95\eta_s = 0.95; over the retained dataset, the mean reference, safe-threshold, and original-threshold CRBs are 185.3078, 186.4777, and 191.8442, respectively.

The geometry-aware tokens are constructed according to (23)–(25), with feature standardization based exclusively on the training set. The final token-preserving PATBO configuration and training parameters are summarized in Table II.

ParameterValue
Input features per token, DinD_{\mathrm{in}}10
Number of tokens, K+LK + L6
Model dimension, dmodeld_{\mathrm{model}}64
Attention heads4
Feed-forward dimension128
Transformer encoder layers2
Token-wise hidden dimension64
Dropout probability0.1
Mini-batch size32
Maximum epochs100
Initial learning rate10−310^{-3}
Early-stopping patience15
CRB sensitivity factor, λs\lambda_s0.5
Finite-difference perturbation, Δρ\Delta\rho10−310^{-3}

Table II. PATBO network and training parameters

Training and Power-Prediction Performance

The final token-preserving PATBO model is trained using the CRB-sensitivity-aware objective in (48). Early stopping

terminates training after 51 epochs, with the best validation loss of 3.7120×10−43.7120 \times10^{-4} obtained at epoch 36.

On the independent 696-sample test set, the predicted normalized stream-power allocations achieve a mean-squared error of 3.1727×10−33.1727 \times10^{-3}. Using the common sample-wise normalized-error metric adopted for the learning-baseline comparison, the corresponding power-allocation NMSE is −11.1670-11.1670 dB. The softmax output satisfies the unit-simplex constraint numerically, with a maximum power-sum error of 3.33×10−163.33 \times10^{-16}.

Figure 2 compares the average normalized stream-power allocation of PATBO with the reference solution. PATBO closely reproduces the overall communication–sensing power distribution, with most of the available power assigned to the communication streams and a smaller fraction allocated to the sensing.

Figure 2. Average normalized stream-power allocation of the reference solution and PATBO over the 696 retained test samples.

Nevertheless, agreement in average power allocation or conventional NMSE does not by itself imply physical feasibility. The localization CRB is highly sensitive to certain coupled perturbations of the stream-power vector, and therefore relatively small prediction errors can move a realization outside the feasible CRB region. This motivates the explicit constraint evaluation presented next.

Communication and Sensing Performance

Table III summarizes the performance of direct token-preserving PATBO before feasibility recovery. The reference and PATBO achieve average communication sum rates of 17.9204 and 18.0966 bit/s/Hz, respectively, corresponding to 100.98% rate retention. The slightly higher learned rate should not be interpreted as outperforming the constrained reference, since some PATBO predictions violate the localization constraint.

MetricReferencePATBO
Sum rate (bit/s/Hz)17.920418.0966
Rate retention (%)100.00100.98
Aggregate CRB181.9202199.9954
CRB change (%)–+9.94
Communication QoS (%)100.00100.00
Sensing SINR (%)100.0099.86
Original CRB feasibility (%)100.0019.54
Safe CRB feasibility (%)100.0013.79
Power feasibility (%)100.00100.00
Joint feasibility (%)100.0019.54

Table III. Performance and feasibility of direct PATBO

The reference and PATBO aggregate CRBs are 181.9202 and 199.9954, respectively, corresponding to a 9.94% increase. Communication QoS and transmit-power feasibility are 100%, and sensing-SINR feasibility is 99.86%. In contrast, only 19.54% of the direct predictions satisfy the original CRB constraint, which also limits the overall joint feasibility to 19.54%. The tighter safe CRB threshold is satisfied by 13.79% of the predictions.

These results identify localization CRB as the dominant feasibility bottleneck. Despite an NMSE of −11.1670 dB and near-reference communication performance, small errors in the allocated powers can significantly affect the FIM and CRB, both of which depend on geometry. Explicit post-inference feasibility verification is therefore required.

Constraint Feasibility and Physics-Constrained Repair

Physics-constrained repair is applied to the 560 direct PATBO predictions that violate at least one original constraint. The repair stage preserves the RZF communication and near-field sensing directions and optimizes only the K+L=6K + L = 6 stream-power variables according to (50).

Of the 560 repair attempts, 475 successfully recover feasibility, corresponding to a conditional success rate of 84.82%. Together with the 136 directly feasible PATBO predictions, this increases joint feasibility from 19.54% to 87.79%, as summarized in Table IV. The average relative power adjustment among successfully repaired samples is 17.403%. Thus, repair recovers most direct failures without altering the physics-based beam directions.

ConstraintDirect PATBOAfter Repair
Communication QoS (%)100.00100.00
Sensing SINR (%)99.86100.00
CRB (%)19.5487.79
Power (%)100.00100.00
Joint feasibility (%)19.5487.79

Table IV. Constraint feasibility before and after repair.

Repair also improves the localization performance. The average aggregate CRB decreases from 199.9954 for direct PATBO to 190.5222 after direct acceptance and repair, reducing the CRB degradation relative to the reference from 9.94% to 4.73%. The corresponding average sum rate is 17.9573 bit/s/Hz (100.21% reference-rate retention), while the power-allocation NMSE improves from −11.1670 to −13.5352 dB.

Nevertheless, 85 of the 560 repair attempts remain infeasible. These realizations, corresponding to 12.21% of the complete test set, are subsequently handled by the optimizer-fallback stage.

Hybrid PATBO Performance

The complete hybrid PATBO framework combines direct inference, physics-constrained repair, and optimizer fallback. Among the 696 retained test realizations, 136 are directly feasible, 475 additional realizations are recovered through repair, and the remaining 85 require fallback. Consequently, joint feasibility progresses from 19.54% for direct PATBO to 87.79% after repair and finally to 100% after fallback, as illustrated in Figure 3.

Figure 3. Joint-feasibility progression across direct PATBO, physics-constrained repair, and optimizer fallback.

The final hybrid beamformer achieves an average sum rate of 17.9004 bit/s/Hz, corresponding to 99.89% reference-rate retention. Its average aggregate CRB is 184.4167, only 1.37% above the reference value of 181.9202. Thus, the CRB degradation decreases from 9.94% for direct PATBO to 4.73% after repair and to 1.37% for the complete hybrid output.

The corresponding operating-mode distribution is shown in Figure 4. Direct PATBO provides the final solution for 19.54% of the samples, successful repair handles an additional 68.25%, and only 12.21% require optimizer fallback. Hence, 87.79% of the retained test realizations are handled without invoking the fallback optimizer.

Figure 4. Distribution of PATBO inference operating modes over the 696-sample test set.

The reported 100% final feasibility is an empirical result on the retained test set rather than a universal guarantee. For the 85 realizations that remain infeasible after repair, the offline evaluation uses the stored feasible reference solution; an online implementation would instead invoke the constrained optimizer.

Computational Complexity and Runtime Analysis

PATBO replaces repeated numerical optimization with direct prediction of the K+L=6K+L=6 stream-power variables while retaining the physically constructed beam directions. As established in Section III, this learned output dimension is independent of the antenna-domain beamformer dimension for fixed KK and LL.

Runtime is evaluated using the actual PATBO inference, SQP, and repair routines. Single-sample PATBO latency is measured after warm-up and averaged over repeated inference trials, while batched throughput is measured over the complete test set. Cold-start and PATBO-warm-start SQP are evaluated on a deterministic 100-sample subset using equal-power and PATBO-predicted initializations, respectively. The measured results for M=1024M=1024 are summarized in Table V and Figure 5.

MethodMean RuntimeOutcome
PATBO, single sample1.1085 msDirect prediction
PATBO, batched0.0367 ms/sampleThroughput
Cold-start SQP0.9512 s39% feasible
PATBO-warm SQP0.8641 s50% feasible
Physics repair2.4011 s84% success

Table V. Measured runtime of PATBO and numerical optimization

Figure 5. Mean per-sample runtime of PATBO inference, SQP, and physics-constrained repair.

Direct PATBO requires an average single-sample inference latency of 1.1085 ms, compared with 0.9512 s for cold-start SQP and 0.8641 s for PATBO-warm-start SQP. Thus, direct PATBO is approximately 858× and 779× faster than cold-start and PATBO-warm-start SQP, respectively. Batched PATBO further reduces the average processing time to 0.0367 ms/sample, although this value represents batch throughput rather than single-sample online latency. Physics-constrained repair requires 2.4011 s on average and is therefore employed selectively for feasibility recovery.

The outcome column in Table V complements the runtime comparison. Cold-start and PATBO-warm-start SQP achieve 39% and 50% feasibility, respectively, indicating that PATBO predictions can provide a useful initialization for numerical optimization. Physics-constrained repair successfully recovers 84% of the directly infeasible samples in the runtime benchmark. These SQP results represent the evaluated local numerical solver rather than a globally optimal or universally feasible optimizer. Overall, the results support the proposed hierarchy: low-latency direct PATBO inference is attempted first, while iterative physics-based optimization is invoked selectively when additional feasibility recovery is required.

Scalability with E-MIMO Array Size

To evaluate scalability, we vary the number of BS antennas while keeping K=4K=4 communication users and L=2L=2 sensing targets fixed. Four square UPA configurations, 20 × 20, 24 × 24, 28 × 28, and 32 × 32, are considered, corresponding to M=400M=400, 576, 784, and 1024, respectively. For each configuration, a new dataset is generated and PATBO is retrained using the same network architecture and training procedure. The corresponding Rayleigh distances are 13.54, 19.84, 27.34, and 36.04 m, maintaining the considered 8–12 m operating region within the near-field regime.

Figure 6 shows the measured runtime as a function of MM. Direct PATBO exhibits nearly constant inference latency, with mean runtimes of 1.131, 1.137, 1.101, and 1.109 ms for M=400M=400, 576, 784, and 1024, respectively. This behavior is enabled by the structured representation, where the Transformer predicts only K+L=6K+L=6 stream-power variables irrespective of the number of antenna elements. In contrast, cold-start SQP runtime increases from 0.132 s to 0.951 s and PATBO-warm-start SQP from 0.122 s to 0.864 s as MM increases from 400 to 1024. Similarly, the physics-constrained repair runtime increases from 0.269 s to 2.401 s.

Figure 6. Runtime scalability of the proposed PATBO framework versus the number of BS antenna elements MM, including direct PATBO inference, PATBO-warm-start SQP, cold-start SQP, and physics-constrained repair.

The reference-rate retention remains above 100% for all evaluated array sizes. Although direct joint feasibility varies with the array configuration, physics-constrained repair substantially improves feasibility, while the complete verify–repair–fallback framework achieves 100% final feasibility for all considered values of MM. Since repair is invoked only for samples failing the direct feasibility check, its increasing runtime does not affect direct PATBO inference latency. Overall, the results demonstrate favorable computational scalability of the proposed framework for large-aperture near-field E-MIMO-ISAC systems.

Ablation and Baseline Analysis

To isolate the contributions of the proposed architecture and training objective, token-preserving sensitivity-aware PATBO is compared with an MLP and four Transformer variants under the same dataset, test split, and structured beamformer reconstruction. Table VI summarizes their direct-inference performance before repair or optimizer fallback.

MethodNMSE (dB)Rate Ret. (%)CRB Change (%)Sensing (%)Joint Feas. (%)
MLP−10.7953101.18+11.4798.1313.94
Vanilla Transformer−10.8379101.14+12.0599.7110.06
Pooled sensitivity-aware Transformer−10.8144101.28+11.9899.5711.64
Pooled margin-only Transformer−10.8379101.07+11.9499.719.20
Pooled sensitivity+margin Transformer−10.8368100.93+11.8399.718.48
Token-preserving sensitivity-aware PATBO−11.1670100.98+9.9499.8619.54

Table VI. DIRECT-INFERENCE ABLATION AND BASELINE COMPARISON

The proposed token-preserving PATBO achieves the highest direct joint feasibility of 19.54%, compared with 13.94% for the MLP and 11.64% for the pooled sensitivity-aware Transformer, as highlighted in Figure 7. Relative to the latter, this represents a 7.90 percentage-point improvement. PATBO also achieves the lowest power-allocation NMSE of −11.1670 dB and reduces the average CRB degradation from 11.98% for the pooled sensitivity-aware model to 9.94%.

Figure 7. Direct joint-feasibility comparison among the MLP baseline, Transformer ablations, and the proposed token-preserving sensitivity-aware PATBO over the 696-sample test set.

The improvement is consistent with preserving the association between each contextualized entity token and its corresponding power variable. In contrast, the pooled Transformer variants compress the entity tokens into a single representation before generating the stream powers, thereby removing this explicit correspondence.

The loss-function ablation further shows that sensitivity-aware training is more effective than margin-based weighting for the considered dataset. Within the pooled architecture, sensitivity-aware, margin-only, and combined sensitivity-and-margin training achieve 11.64%, 9.20%, and 8.48% joint feasibility, respectively. Accordingly, the final PATBO model uses the CRB-sensitivity-aware objective with λs=0.5\lambda_s = 0.5, while the safe CRB threshold is confined to reference-solution generation.

Although all learning models retain approximately 100% of the reference communication rate, their CRB feasibility differs substantially. This confirms that communication-rate retention alone is insufficient for architecture selection and motivates the verify–repair–fallback mechanism used by PATBO.

Conclusion

This paper proposed PATBO, a physics-aware Transformer framework for near-field E-MIMO-ISAC beamforming that

combines physically structured beam directions with learned stream-power allocation. The token-preserving architecture and CRB-sensitivity-aware training enable low-dimensional power prediction while accounting for localization-sensitive constraints. Numerical results show that physics-constrained repair increases joint feasibility from 19.54% for direct PATBO to 87.79%, while the complete verify–repair–fallback framework achieves 99.89% reference-rate retention and 100% feasibility on the retained test set. Direct PATBO inference requires only 1.11 ms per sample, corresponding to approximately 858× and 779× lower runtime than the evaluated cold-start and PATBO-warm-start SQP benchmarks, respectively. Moreover, the scalability results show that PATBO maintains approximately 1.1 ms inference latency across M=400M = 400–1024, while the numerical optimization stages exhibit increasing runtime with array size. These results demonstrate the potential of combining structured learning with selective physics-based optimization for low-latency and scalable near-field E-MIMO-ISAC beamforming. Future work will investigate dynamic mobility, channel uncertainty, and real-time implementation.

References

  1. [1]F. Liu, Y. Cui, C. Masouros, J. Xu, T. X. Han, Y. C. Eldar, and S. Buzzi, “Integrated sensing and communications: Toward dual-functional wireless networks for 6G and beyond,” IEEE J. Sel. Areas Commun., vol. 40, no. 6, pp. 1728–1767, Jun. 2022.DOI
  2. [2]M. Ali, A. A. Badrudeen, S. Baek, Y. Kim, and S. Kim, “Joint beamforming design under target reflected interference in RIS-assisted bi-static ISAC system,” in Proc. Int. Conf. Artif. Intell. Inf. Commun. (ICAII C), Tokyo, Japan, 2026, pp. 1259–1264.DOI
  3. [3]Z. Wang, J. Zhang, H. Du, D. Niyato, S. Cui, B. Ai, M. Debbah, K. B. Letaief, and H. V. Poor, “A tutorial on extremely large-scale MIMO for 6G: Fundamentals, signal processing, and applications,” IEEE Commun. Surveys Tuts., vol. 26, no. 3, pp. 1560–1605, 3rd Quart. 2024.
  4. [4]H. Lu, Y. Zeng, C. You, Y. Han, J. Zhang, Z. Wang, Z. Dong, S. Jin, C.-X. Wang, T. Jiang, X. You, and R. Zhang, “A tutorial on near-field XL-MIMO communications toward 6G,” IEEE Commun. Surveys Tuts., vol. 26, no. 4, pp. 2213–2257, 4th Quart. 2024.DOI
  5. [5]C. Ouyang, Z. Wang, Y. Chen, X. Mu, and P. Zhu, “A primer on near-field communications for next-generation multiple access,” Proc. IEEE, vol. 112, no. 9, pp. 1527–1565, Sep. 2024.arxiv.org/abs/2408.00952
  6. [6]X. Li, Z. Dong, and Y. Zeng, “Multi-user modular XL-MIMO communications: Near-field beam focusing pattern and user grouping,” IEEE Trans. Wireless Commun., vol. 23, no. 10, pp. 13766–13781, Oct. 2024.arxiv.org/abs/2308.11289
  7. [7]H. Wang, Z. Xiao, and Y. Zeng, “Cramér–rao bounds for near-field sensing with extremely large-scale MIMO,” IEEE Trans. Signal Process., vol. 72, pp. 701–717, 2024.arxiv.org/abs/2303.05736
  8. [8]K. Qu, S. Guo, N. Saeed, and J. Ye, “Near-field integrated sensing and communication: Performance analysis and beamforming design,” IEEE Open J. Commun. Soc., vol. 5, pp. 6353–6366, Oct. 2024.arxiv.org/abs/2308.06455
  9. [9]A. Ray, S. Majhi, H. Rajput, and M. Di Renzo, “ISAC for near-field and extremely large-scale uniform planar array systems,” IEEE Trans. Commun., vol. 74, pp. 1497–1512, 2026.DOI
  10. [10]H. Li, Z. Wang, X. Mu, Z. Pan, and Y. Liu, “Near-field integrated sensing, positioning, and communication: A downlink and uplink framework,” IEEE J. Sel. Areas Commun., vol. 42, no. 9, pp. 2196–2212, Sep. 2024.arxiv.org/abs/2311.07722
  11. [11]B. Zhao, C. Ouyang, Y. Liu, X. Zhang, and H. V. Poor, “Modeling and analysis of near-field ISAC,” IEEE J. Sel. Topics Signal Process., vol. 18, no. 4, pp. 678–693, May 2024.DOI
  12. [12]X. Wang, W. Zhai, X. Wang, M. G. Amin, and K. Cai, “Wideband near-field integrated sensing and communication with sparse transceiver design,” IEEE J. Sel. Topics Signal Process., vol. 18, no. 4, pp. 662–677, May 2024.DOI
  13. [13]Y. Lin, Z. Liu, J. Zhang, F. Liu, X. Li, Q. Zhang, Z. Wei, S. Fan, and J. Yan, “Near-field integrated sensing and communication beamforming considering complexity,” IEEE Trans. Veh. Technol., vol. 74, no. 4, pp. 6021–6034, Apr. 2025.DOI
  14. [14]C. Meng, D. Ma, Z. Wang, Y. Liu, Z. Wei, and Z. Feng, “Near-field hybrid beamforming design for modular XL-MIMO ISAC systems,” IEEE Trans. Commun., vol. 73, no. 11, pp. 11840–11854, Nov. 2025.DOI
  15. [15]J. Ding, Z. Zhou, X. Shao, B. Jiao, and R. Zhang, “Movable antenna-aided near-field integrated sensing and communication,” IEEE Trans. Wireless Commun., vol. 25, pp. 493–508, 2026.DOI
  16. [16]Y. Kim, S.-H. Park, S. Yang, K.-K. Wong, L. Dai, and C.-B. Chae, “Near-field challenges in ultra-wideband ISAC beamforming strategies and system insights,” IEEE Commun. Mag., pp. 1–7, May 2026.
  17. [17]H. Lei, J. Zhang, Z. Wang, B. Ai, and E. Björnson, “Near-field user localization and channel estimation for XL-MIMO systems: Fundamentals, recent advances, and outlooks,” IEEE Wireless Commun., vol. 32, no. 4, pp. 190–198, Aug. 2025.arxiv.org/abs/2407.10147
  18. [18]F. Zeinali, S. Javadi, M. R. Mili, M. B. Mashhadi, A. Al-Dweik, and N. Al-Dhahir, “Beamforming design for near-field fim-aided isac systems: A drl approach,” IEEE Trans. Veh. Technol., vol. 75, no. 8, pp. 18467–18472, Aug. 2026.DOI
  19. [19]G. Jiang and C. Qi, “Near-field beam training based on deep learning for extremely large-scale MIMO,” IEEE Commun. Lett., vol. 27, no. 8, pp. 2063–2067, Aug. 2023.DOI
  20. [20]X. Shi, J. Wang, X. Wang, C. You, and J. Song, “Double-sided near-field XL-MIMO: Beamfocusing codeword selection and channel estimation,” IEEE Trans. Commun., vol. 73, no. 5, pp. 3441–3455, May 2025.DOI
  21. [21]Q. Yang, A. Guerra, F. Guidi, N. Shlezinger, H. Zhang, L.-X. Yang, D. Dardari, B. Wang, and Y. C. Eldar, “Beam focusing for near-field multi-user localization,” IEEE Trans. Veh. Technol., vol. 74, no. 8, pp. 12259–12273, Aug. 2025.
  22. [22]Y. Cui, H. Ding, Y. Ma, X. Li, H. Zhang, and Y. Fang, “Energy-efficient integrated sensing and communication in collaborative millimeter wave networks,” IEEE Trans. Wireless Commun., vol. 24, no. 3, pp. 2341–2357, Mar. 2025.DOI
  23. [23]Y. Zhao, Q. Wu, W. Chen, Y. Zeng, R. Liu, W. Mei, F. Hou, and S. Ma, “Multi-functional beamforming design for integrated sensing, communication, and computation,” IEEE Trans. Commun., vol. 73, no. 8, pp. 6322–6336, Aug. 2025.arxiv.org/abs/2407.01006
  24. [24]S. Zhang, W. Hao, G. Sun, C. Huang, Z. Zhu, X. Li, and C. Yuen, “Joint beamforming optimization for active STAR-RIS-assisted ISAC systems,” IEEE Trans. Wireless Commun., vol. 23, no. 11, pp. 15888–15902, Nov. 2024.DOI
  25. [25]H. Hua, J. Xu, and R. Zhang, “Near-field integrated sensing and communication with extremely large-scale antenna array,” IEEE Trans. Wireless Commun., vol. 24, no. 12, pp. 9962–9977, Dec. 2025.arxiv.org/abs/2407.17237
  26. [26]M. Sun, Y. Gong, R. Zhang, Y. Zhao, X. Jing, C. Yuen, and D. W. K. Ng, “Robust spherical wavefront beamforming for near-field ISAC with MMSE optimization: A distance-angle perspective,” IEEE Trans. Commun., vol. 74, pp. 6718–6733, 2026.DOI
  27. [27]W. Mao, Y. Lu, C.-Y. Chi, B. Ai, Z. Zhong, and Z. Ding, “Communication-sensing region for cell-free massive MIMO ISAC systems,” IEEE Trans. Wireless Commun., vol. 23, no. 9, pp. 12396–12411, Sep. 2024.arxiv.org/abs/2307.16259
  28. [28]U. Demirhan and A. Alkhateeb, “Cell-free ISAC MIMO systems: Joint sensing and communication beamforming,” IEEE Trans. Commun., vol. 73, no. 6, pp. 4454–4468, Jun. 2025.arxiv.org/abs/2301.11328
  29. [29]X. Xia, G. Zheng, Y. Zhu, J. Zhang, J. Wang, and A. P. Petropulu, “A deep learning framework for optimization of MISO downlink beamforming,” IEEE Trans. Commun., vol. 68, no. 3, pp. 1866–1880, Mar. 2020.DOI
  30. [30]J. Zhang, W. Xia, M. You, G. Zheng, S. Lambotharan, and K.-K. Wong, “Deep learning enabled optimization of downlink beamforming under per-antenna power constraints: Algorithms and experimental demonstration,” IEEE Trans. Wireless Commun., vol. 19, no. 6, pp. 3738–3752, Jun. 2020.
  31. [31]Y. Li, Y.-F. Liu, F. Xu, Q. Shi, and T.-H. Chang, “Learning to optimize QoS-constrained beamforming in multi-user systems: A penalty-dual framework,” IEEE Trans. Wireless Commun., vol. 23, no. 11, pp. 16123–16138, Nov. 2024.DOI
  32. [32]Y. Li and Y.-F. Liu, “HPE transformer: Learning to optimize multi-group multicast beamforming under nonconvex QoS constraints,” IEEE Trans. Commun., vol. 72, no. 9, pp. 5581–5594, Sep. 2024.arxiv.org/abs/2402.16081
  33. [33]J. Zhang, M. Liu, J. Tang, N. Zhao, D. Niyato, and X. Wang, “Joint design for RIS-aided ISAC via deep unfolding learning,” IEEE Trans. Cogn. Commun. Netw., vol. 11, no. 1, pp. 349–361, Feb. 2025.DOI
  34. [34]Q. Gao, R. Zhong, Y. Zou, H. Shin, and Y. Liu, “Deep learning-based beamforming optimization for isac systems: A low-complexity and transferable framework,” IEEE Trans. Wireless Commun., vol. 25, pp. 8754–8768, 2026.DOI
  35. [35]X. Zhang, W. Yuan, C. Liu, J. Wu, and D. W. K. Ng, “Predictive beamforming for vehicles with complex behaviors in ISAC systems: A deep learning approach,” IEEE J. Sel. Topics Signal Process., vol. 18, no. 5, pp. 828–841, Jul. 2024.DOI
  36. [36]X. Xu, J. Xu, C. Dong, C. Xing, N. Zhao, Q. Wu, and D. Niyato, “Learning-based predictive beamforming for secure ISAC via IRS,” IEEE Trans. Commun., vol. 73, no. 12, pp. 14304–14315, Dec. 2025.DOI
  37. [37]M. Zhang, R. Zhong, X. Mu, H. Shin, and Y. Liu, “AI-enabled near-field communications: User movement prediction and beam tracking,” IEEE Trans. Cogn. Commun. Netw., vol. 12, pp. 6247–6264, 2026.DOI
  38. [38]P. Jiang, M. Li, R. Liu, and Q. Liu, “Graph learning for cooperative cell-free ISAC systems: From optimization to estimation,” IEEE Trans. Wireless Commun., vol. 25, pp. 13992–14008, 2026.arxiv.org/abs/2507.06612
  39. [39]M. Cui and L. Dai, “Channel estimation for extremely large-scale MIMO: Far-field or near-field?” IEEE Trans. Commun., vol. 70, no. 4, pp. 2663–2677, Apr. 2022.arxiv.org/abs/2108.07581
  40. [40]C. Wu, C. You, Y. Liu, L. Chen, and S. Shi, “Two-stage hierarchical beam training for near-field communications,” IEEE Trans. Veh. Technol., vol. 73, no. 2, pp. 2032–2044, Feb. 2024.arxiv.org/abs/2302.12511
  41. [41]H. Hua, J. Xu, and Y. C. Eldar, “Near-field 3D localization via MIMO radar: Cramér–rao bound analysis and estimator design,” IEEE Trans. Signal Process., vol. 72, pp. 3879–3895, 2024.
  42. [42]A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in Neural Information Processing Systems (NeurIPS), vol. 30, 2017.arxiv.org/abs/1706.03762
  43. [43]C. B. Peel, B. M. Hochwald, and A. L. Swindlehurst, “A vector-partition technique for near-capacity multiuser communication—part i: Channel inversion and regularization,” IEEE Trans. Commun., vol. 53, no. 1, pp. 195–202, Jan. 2005.
  44. [44]J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed. New York, NY, USA: Springer, 2006.

Paper details

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

views · 10

downloads · 1

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