Conceptio › Archive › arXiv CS
arXiv CS open access

MultiPathFormer: Towards a Foundation Model for Multipath Wireless Propagation

2026 · arxiv_cs
arXiv CS · Papers · 2026
Open Source ↗Direct PDF ↓
machine-learningneural-networks
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

MultiPathFormer: Towards a Foundation Model for Multipath Wireless Propagation Blessed Guda, Kayley Sze, and Carlee Joe-Wong

arXiv:2608.05076v1 [cs.LG] 5 Aug 2026

Carnegie Mellon University Pittsburgh, USA blessedg@andrew.cmu.edu, ksze@andrew.cmu.edu, cjoewong@andrew.cmu.edu

Abstract—Recent advances in machine learning have enabled training of wireless foundation models, which aim to support tasks such as channel estimation, beam prediction, and localization based on wireless signals. Existing wireless foundation models typically pretrain on channel tensors using masked reconstruction over subcarriers, antennas, or time but ignore the physical characteristics of wireless propagation. In this work, we propose to instead use multipath propagation as the fundamental pretraining object. We present MultiPathFormer, an autoregressive foundation model that represents each transmitter–receiver link as an ordered sequence of continuous-valued path tokens and pretrains with next-path prediction. We introduce an Environmental RAG (retrieval augmented generation) mechanism and a first-path codebook on top of the transformer backbone, leveraging environment knowledge to improve path statistics estimation like delay and power by up to 59%. MultiPathFormer pretrained on 27 environments transfers to unseen users and, after scenario-specific fine-tuning, outperforms training the corresponding models trained from scratch in new environments. Across downstream tasks, it outperforms SOTA channel-based foundation models, achieving 5.57 m mean localization error, 0.914 top-3 beam accuracy, 0.994 line-of-sight classification accuracy, and 0.561 channel estimation NMSE. These results show that path-level pretraining can learn reusable representations of wireless propagation. Index Terms—wireless foundation model, multipath propagation, autoregressive modelling, channel estimation

I. I NTRODUCTION Modern machine learning applications are often built on top of foundation models, which are pretrained on a general self-supervised objective and then reused across different downstream tasks. This approach has produced foundation models with general-purpose representations in domains such as language, vision, robotics and multimodal learning [1]– [6]; these representations are then used as the starting point for downstream tasks like text classification, machine translation, generation, and reasoning tasks in natural language processing [7]–[9]. The shared principle is simple: with the right pretraining object, large-scale self-supervised learning can learn representations that capture the underlying structure of a domain and are reusable across different tasks. The wireless communication domain is another area where foundation models could thrive [10]. Emerging 5G/6G wireless communication networks rely on environment-aware inference for tasks like beam selection, channel estimation, localization, and sensing, especially in millimeter-wave and massive multiple-input multiple-output (MIMO) deployments where

narrow beams, blockage, and spatial heterogeneity make propagation highly sensitive to the physical scene [11]–[13]. At the core of these phenomena is the multipath propagation process. As ElectroMagnetic (EM) waves travel from a transmitter to a receiver, they interact with objects in the environment through reflection, refraction, scattering, and diffraction, generating a collection of propagation paths whose characteristics depend on the underlying scene. While these interactions vary significantly across indoor and outdoor, urban and rural, etc. environments and deployments, the propagation process remains governed by the same physical principles. A foundation model that captures them could then be used for downstream tasks. Existing channel-based model architectures. Several recent works have begun attempts to develop wireless foundation models [14], [15]. WiFo [16] and ChannelGPT [17], for example, proposed foundation models for channel prediction and showed zero-shot generalisation for the same channel prediction task across heterogeneous Channel State Information (CSI) configurations. The Large Wireless Model [18] learns contextualised channel embeddings from large-scale wireless channel data and reports gains on Line of Sight (LoS) classification and beam prediction. WirelessGPT [19] extends the same philosophy by using such models on the downstream tasks of human activity recognition and wireless environment reconstruction. The key similarity of all these works is that they work at the channel level, with the pretraining objective as some variant of Masked Channel Modelling (MCM) [20]. The MCM objective is shown in Equation (1), where the foundation model f makes predictions for all masked channel positions i ∈ M , with the masked set M spanning subcarrier, time, or space and hi denoting the ground truth channel at position i. ℓM CM =

1 X ||f (i|{hj }j ∈M ) − hi ||2 / |M |

(1)

i∈M

We ask whether the channel is the right pretraining object for wireless foundation models. For a given link, the channel on subcarrier k is a superposition of propagation paths, H[k] =

L X

 H tx αℓ exp(−j2πfk τℓ ) arx (Ωrx , ℓ ) atx Ωℓ

(2)

ℓ=1

where each path ℓ is characterized by a complex gain αℓ , delay tx τℓ , and arrival/departure angles Ωrx ℓ and Ωℓ . Equation (2) shows the limitation of channel-level pretraining: the channel

tensor mixes a variable number of path events and then further entangles them with array responses, subcarrier sampling, and system configuration. This makes it harder to isolate the environment-dependent structure that actually drives wireless behaviour [15], which may limit the model’s interpretability as well as its ability to disambiguate the environmental signatures of users at different locations with similar aggregate channels. Our insight: Path-based architectures. We argue in this paper that a more fundamental pretraining object is the multipath process. Working at the multi path-level exposes the interpretable physical parameters that generate the channel, including path power, delay, phase, angles of arrival and departure, and interaction types such as line-of-sight, reflection, diffraction, and scattering. In addition to interpretability benefits, modelling the multi-path directly may improve reuse of the learned representations, as the model must preserve physical characteristics like variable path cardinality, dominantpath structure, angular geometry, and propagation attributes before they are collapsed into a channel tensor. However, this idea raises fundamental technical challenges: multipath foundation modelling does not naturally fit standard masked reconstruction formulations. A transmitter-receiver (tx-rx) link produces a variable-length sequence of continuous-valued path descriptors rather than a fixed grid of discrete tokens. A useful model must then predict both how many paths exist and each path’s physical attributes, while conditioning on the transmitter, receiver, and relevant scene geometry. We propose MultiPathFormer, which formulates wireless pretraining as next-path prediction, analogous to next-token prediction in language modeling but adapted to continuous wireless path descriptors. Each transmitter-receiver pair is converted into an ordered sequence of propagation-path tokens. An autoregressive transformer is then pretrained over path sequences collected from multiple environments. In designing MultiPathFormer, we answer three fundamental questions: 1) How can a foundation model perform autoregressive prediction over variable-length sequences of continuous-valued path descriptors? Unlike language tokens drawn from a discrete vocabulary, propagation paths are continuous physical entities characterized by delay, power, phase, and angular parameters, and each tx-rx link may contain a different number of multipaths. 2) How should the dominant path be modeled and stabilized during generation? Unlike text sequences, where tokens at different positions often contribute arbitrarily to the meaning of a sentence, wireless propagation is usually dominated by a single path, and there is no natural temporal path ordering. This dominant path carries a large portion of the received power and largely determines the characteristics of the links. A foundation model must therefore find and treat this path differently from subsequent paths to ensure meaningful, physically consistent generation of subsequent paths. 3) What link-specific environmental context should be retrieved to aid the multipath prediction? Path formation depends strongly on the surrounding geometry,

blockage structures, and potential reflectors, context that is not present in language environments. Knowledge of surrounding objects, e.g., the presence of fixed infrastructure like buildings and transmitter base stations, is often available in practice, e.g., from Open Street Map [21], but a propagation foundation model must determine which are relevant for a particular link and how to encode them. To the best of our knowledge, MultiPathFormer is the first wireless foundation model to work at the multipath level, with a formulation that represents wireless propagation as an autoregressive sequence of individual path tokens and uses next-path prediction as the pretraining objective. The main contributions of this paper are summarised below: 1) We introduce an autoregressive wireless path-level formulation in which the pretraining object is an ordered sequence of multipath tokens rather than the channel tensor. The resulting next-path prediction objective handles continuous-valued, variable-length multipath sequences, and we release MultiPathFormer weights trained on 27 environment scenarios with 23.9M multipath tokens.1 2) We design an Environmental RAG mechanism and a KMeans-cluster codebook dominant-path prior that inject local and corridor-aware scene geometry while stabilizing first-path prediction. Across 31 scenarios, these reduce delay MAE (mean absolute error) by 38.7% and power MAE by 59.2% over a direct autoregressive baseline. 3) We show that pretraining provides both transfer and adaptation benefits: MultiPathFormer transfers to unseen users within the pretraining environments, while scenariospecific finetuning for new environments outperforms training the same architecture from scratch. 4) We evaluate the MultiPathFormer foundation model on downstream tasks of beam prediction, user localisation, and LoS classification. Experimental results show that the MultiPathFormer outperforms baseline channel foundation models with improvements of up to 30% on Beam prediction and 3% on LoS classification, 65m distance on user localization, and 0.751 Channel estimation NMSE. II. L ITERATURE R EVIEW Broad self-supervised pretraining and downstream task reuse form the basis of foundation models [1]. Token-level objectives can provide useful representations for language tasks, as demonstrated by BERT-style masked-token modeling and GPT-style autoregressive next-token prediction [2], [7], as well as for image patches and image–text pairs in vision and multimodal learning by Vision Transformers, Masked Autoencoders, and CLIP-style contrastive learning [3], [4], [22]. MultiPathFormer takes inspiration from these ideas in using propagation-path tokens for wireless foundation modelling. A. Wireless Foundation Models Recent works have proposed foundation models for wireless communications and sensing [14], particularly at the channel 1 https://huggingface.co/gblessed/multipathformer

level as surveyed by [20]. LWM [18] pretrained a BERT-style encoder-only model with masked channel modeling across antenna and subcarrier dimensions, producing contextualized embeddings useful for downstream tasks such as LoS classification and beam prediction. WiFo [16] extended this direction by modeling CSI evolution over time with 3D channel inputs, allowing the foundation model to capture temporal, frequency, and spatial variations. WiFo uses a masked autoencoder (MAE) [22] with a transformer decoder to increase reconstruction capacity, which [23] extends with a contrastive objective to produce more discriminative representations. Other works have proposed physics-inspired architectures at the channel [24] or EM [10] levels and attempted to exploit the timeseries nature of wireless signals [25], [26], but they do not use path-level tokens. WirelessGPT [19] and ChannelGPT [17] aim to integrate such wireless foundation models into the broader network, respectively extending them to sensing tasks and feedback loops that allow wireless foundation models to respond to changes in the physical environment and network performance. Other works leverage the availability of multimodal environment information, integrating it into wireless foundation models [27], [28], as does MultiPathFormer. These works show that self-supervised MCM models can produce reusable representations. All of them, however, use the channel tensor as the pretraining object, tying the learned representation to the antenna, subcarrier, and bandwidth configuration and only implicitly capturing the multipath events that compose the channel. MultiPathFormer instead directly pretrains on the multipath sequence. B. Task-Specific Wireless Models Before the advent of foundation models, most deep learning models used in communication were trained for a single task. For example, [29] showed that large MLP (multi-layer perceptron) models can take sub-6 GHz channels and predict mmWave beams and blockage states. [30] similarly mapped low-overhead pilot observations to beam selections with deep neural networks, while CsiNet [31] introduced an autoencoderstyle neural architecture for massive-MIMO CSI compression and channel reconstruction, ChannelNet [32] framed the channel estimation problem as an image super-resolution and restoration problem over the time-frequency grid, and [33] used the image denoising formulation and applied a messagepassing denoising convolutional neural network for the channel estimation of sparse mmWave massive-MIMO channels. These works show the value of neural networks for channel recovery, but they remain channel-matrix methods rather than working on an explicit sequence of propagation paths. III. M ULTI PATH F ORMER D ESIGN We first introduce our problem formulation (Section III-A) before presenting the MultiPathFormer backbone architecture in Section III-B. We then introduce the environmental RAG (Section III-C) and cluster codebook (Section III-D) additions that respectively allow MultiPathFormer to incorporate known environment context and stabilize the dominant path.

A. Background and Problem Formulation Channel model. We consider a training setup containing M environments; note that MultiPathFormer can later be finetuned for new environments, as we show in Section V-D. For each environment m ∈ S = {1, . . . , M }, we consider the multipath propagation between transmitters b ∈ Bm and receivers u ∈ Um distributed throughout the environment. In an environment m, for each tx-rx pair (m, b, u), we get the (m,b) (m,u) tx and rx geographical positions xtx , xrx ∈ R3 , link denv environment features xtx−rx ∈ R , and the corresponding m channel tensor Hm,b,u . We show an example of such an environment in Figure 1a. The corresponding multipath sequence Pm,b,u with Lm,b,u number of mulitpath is defined as (m,b,u) (m,b,u)  Pm,b,u = π1 , . . . , πLm,b,u , (3)   (m,b,u) aoa aoa aod aod πℓ = ρℓ , τℓ , ϕℓ , θℓ,az , θℓ,el , θℓ,az , θℓ,el , zℓ . (4) (m,b,u)

Each multipath πℓ component for each path ℓ is defined in Equation (4), where ρℓ is the path power, τℓ the propagation aoa aoa delay, ϕℓ the phase, θℓ,az and θℓ,el are the azimuth and aod aod elevation angles of arrival, θℓ,az and θℓ,el are the corresponding angles of departure, and zℓ ∈ {0, 1}4 is a multihot vector on interaction type showing if the path experiences Reflection, Diffraction, Scattering, or Line of Sight (LoS). We omit the (m, b.u) superscript in components of π for notational simplicity. Equations (1) - (4) are the standard multipath model as used in other papers [16], [34]. Autoregressive path formulation. For a tx-rx pair and its environmental features, we formulate the autoregressive model in Equation (5) to predict the arrival of the next multipath given the previous multipaths. Here θ denotes the model parameters and we compute the probability of the sequence Pm,b,u : Lm,b,u

pθ (Pm,b,u | xm ) =

Y

pθ (πt | π<t , xrx , xtx , xtx−rx ) (5) m

t=1

This formulation leads us to solving an autoregressive variable sequence length regression problem. This is different from the standard autoregressive formulation in language modelling: first, in language modelling, tokens are derived from the text, yielding a discrete vocabulary, and the model solves a variable sequence length autoregressive classification problem over the vocabulary. Secondly, in language modelling, start and stop tokens are added to the vocabulary to initiate and terminate generation, which does not translate to a regression setup. Finally, wireless multipaths may have different orderings, unlike the temporal order of language tokens. To solve these challenges, we first convert the path set into a deterministic ordered sequence by sorting them by descending ≥ ρm,b,u ≥ · · · ≥ ρm,b,u power ρm,b,u 1 2 Lm,b,u . The other option is to sort based on delay, because; as shown in Figure 1b, received power and delay not have a perfect inverse-linear relationship. However, we do not find any significant performance differences between the two setups. We prepend a zero-valued start (m,b,u) token π0 = 0 to initiate generation. At each timestep,

0.6

cluster 0 cluster 1 cluster 2 cluster 3 cluster 4 cluster 5 cluster 6 cluster 7 cluster 8 cluster 9 cluster 10 cluster 11 cluster 12 cluster 13 cluster 14 cluster centers

150 0.7

100 0.8

Power

y

50 0

0.9 1.0

50 1.1

100 1.2 150

transmitter 100

1.3

50

0

a) Physical Environment and 3D user grid

50

x

0.00

100

0.25

0.50

0.75

1.00

Delay (us)

1.25

1.50

1.75

b) Physical environment

Fig. 1. a) An example physical environment and the corresponding 3D model through which wireless signals may propagate. b) User clusters obtained from KMeans on first-path delay and power (right), showing that the clusters organize users into spatially coherent groups (left) under a fixed transmitter.

the model simultaneously predicts the path parameters defined in Equation (4). To terminate generation, rather than define a target end-of-sentence path, which could hurt the performance in a regression setup, we explicitly predict the number of paths between the transmitter and receiver and terminate based on this prediction. Note that, since later paths are expected to have lower power, they likely contribute less to the overall signal, and thus minor inaccuracies in termination likely do not have much effect on our channel prediction ability. The remaining challenge is how to condition this sequence model on the right physical context. The full environment may contain many objects that are irrelevant to a particular link, while the dominant first path often follows a strong spatial pattern under a fixed transmitter. MultiPathFormer therefore combines three pieces as shown in Figure 2: an Environmental RAG module (Section III-C) that retrieves pair-specific scene geometry and a compact First-Path Cluster Codebook (Section III-D) that supplies a low-dimensional prior for the dominant path supplement a transformer backbone (Section III-B).

Path1

 Eenv = Encoderθ [xm , xtx , xrx ] ,

(6)

L̂m,b,u = flen (Eenv ),

(7)

 ht = Decoderθ [Eenv ; π<t ] .

(8)

We then pass the decoder output through a linear layer to

Path

MultiPath Decoder

Environment Encoder Rx-Tx

Environment Context

Start

Path2

Path

Codebook context

Environment RAG

Cluster CodeBook

Fig. 2. Overview of the proposed corridor-aware MultiPathFormer. The model augments the tx-rx prompt with Environmental RAG features and a first-path KMeans codebook, then autoregressively predicts the multipath sequence with a residual correction for the dominant first path.

estimate the multipath parameters defined in Equation (4):  aoa , cos aoa , \ \ \ \ ybt = τ̂t , ρ̂t , sin ϕt , cos ϕt , sin θt,az θt,az \ aoa , cos aoa , sin aod , \ \ sin θt,el θt,el θt,az  \ \ \ aod , sin aod , cos aod = W cos θt,az θt,el θt,el reg ht + breg

B. MultiPathFormer Backbone Model The MultiPathFormer backbone uses an encoder-decoder transformer architecture similar to vision-language models [35], with the encoder and decoder capturing information from different modalities. The encoder produces representations capturing the relationship between tx-rx and the physical environment. To encourage the encoder to produce environmentally grounded representations and to address the variable sequence length, we supervise the encoder representation to predict the number of multipaths between the tx-rx pair. The decoder then captures how the current path relates to previous paths conditioned on the environment encoder representation. Letting Eenv denote the encoder output, L̂m,b,u the estimated path length, and ht the decoder output, we summarize MultiPathFormer at generation step t in Equations (6)-(8).

Path2

Path Len

ẑt = σ(st ),

st = Wint ht + bint .

(9)

(10)

Training loss. For a path with length Lm,b,u , groundtruth path yt derived from πℓm,b,u , we compute an ℓ2 loss Lpath for the path parameters and a squared loss Llen for the path length. The loss Lint in estimating zt is defined with cross-entropy loss, as zt is a categorical variable: Lpath =

1

X

2

∥ŷt − yt ∥2 , Lm,b,u t  2 Llen = L̂m,b,u − Lm,b,u , i 1 Xh ⊤ Lint = − zt log ẑt + (1 − zt )⊤ log(1 − ẑt ) Lm,b,u t

We use standard backpropagation methods to train the model parameters (θ, Wint , bint , Wreg , breg ) on the total loss function L = Lpath + λint Lint + λlen Llen over the training data points (m, b, u). We specify the λlen and λint weights and other configurations in the Appendix.

C. Environmental Retrieval Augmented Generation During propagation, multipaths interact with a variety of objects in the environment. Environments can vary starkly, with sparser buildings in less populated areas to more dense objects and users in urban settings. We, however, require our model to be able to reason about relevant objects in all types of environments in an efficient manner. The naı̈ve approach of passing a single global environment descriptor xm may be too coarse and noisy for path prediction, especially when disambiguating users across heterogeneous environments. The paths for a tx-rx pair are determined not only by which environment the pair belongs to, but more specifically by which objects are locally close to the receiver and which objects lie along the tx-rx propagation corridor. This motivates our Environmental Retrieval RAG framework, which retrieves txrx-specific geometric context from the scene and conditions MultiPathFormer on this retrieved representation. For an environment m, with tx-rx pair located at (m,b) (m,u) (m) (m) xtx , xrx ∈ R2 , let Om = {o1 , . . . , oJm } denote the set of physical objects in the scene. These objects can easily be obtained for any environment through the 3D model of the environment produced from OpenStreetMap [21] and are (m) also used in prior work [36]. Each object oj is associated (m) with geometric attributes such as planar centroid pj ∈ R2 , (m) (m) height hj , footprint area aj , and material properties. Our Environmental RAG module retrieves the local and corridor objects as well as sparse multiscale summaries defined in the subsequent paragraphs. a) Local dense retrieval: For a query point q ∈ R2 , (m,b) (m,u) which may be the rx or tx location xrx , xtx , we define the local object candidate set within radius dmax in Equation (11) and retain the K nearest objects NK (q, dmax ): n o (m) Om (q, dmax ) = oj ∈ Om : pj − q ≤ dmax , (11) 2   (m) NK (q, dmax ) = TopKoj ∈Om (q,dmax ) − pj − q . 2 (12) For each object in NK (q, dmax ), we keep a dense description of distance, height, footprint area, and material properties. b) Corridor dense retrieval: To capture objects that are not close to either endpoint but still lie near the propagation route, we further define a tx-rx corridor. We project the (m) centroid pj of each object oj onto the tx-rx line using Equation (13) and then compute the distance of the centroid to the projected point vjm,b,u in Equation (14). We then retrieve the Top-k close objects in a similar manner to Equation (12). (m,b)

vjm,b,u = xtx

(m)

+ projx(m,u) −x(m,b) (pj rx

(m)

dcor = pj j

tx

− vjm,b,u

. 2

(m,b)

− xtx

)

(13) (14)

c) Sparse multi-scale summaries: The dense top-K retrieval captures the most relevant individual objects but not the broader spatial distribution of clutter. We therefore add sparse summaries over objects within dmax that are not necessarily included in the top-K set, computed over increasing radii

{d1 , . . . , dR }. Around both the transmitter and receiver, we compute object counts and maximum object heights within each radius. Similarly, around the tx-rx corridor, we partition the tx-rx segment into B bins and, within corridor radius dmax , compute per-bin summaries of object count and maximum height. These sparse features provide a coarse multi-scale description of environmental density and obstruction patterns. Finally, we concatenate the local, dense, and sparse summaries to get our full retrieval context xtx−rx for a link. This m context captures (i) dense features for the top-K local objects around the receiver and transmitter, (ii) dense features for the top-K objects nearest to the transmitter–receiver corridor, and (iii) sparse multi-scale summaries over local radii and corridor bins. It is both efficient and pair-specific: the dense component preserves the most relevant object-level information, while the sparse component captures broader environmental structure. D. First-Path Cluster CodeBook Unlike text language modelling, the first multipath in the wireless signal is commonly the strongest component, and it often determines the coarse scale of the received channel. Errors at this step propagate to all later decoder states in our autoregressive model, with compounding accuracy effects. We therefore supplement the first path with a coarse prior that takes advantage of the fact that, for a transmitter, nearby receivers tend to share similar first-path delay and power because they are exposed to similar large-scale geometry, blockage, and LoS or first-reflection structure. Figure 1b illustrates this effect: clustering users by first-path delay and power produces spatially coherent regions. Moreover, the transmitter is often a fixed base station [37], and thus remains consistent between training and test sets for a given environment. We exploit this regularity with a deliberately small FirstPath Cluster Codebook. The codebook aims to capture a small set of dominant spatial modes while leaving the transformer responsible for the full continuous path prediction problem, including angles, phase, interactions, sequence length, and all subsequent paths. For each transmitter b in environment m, we fit K-Means on the first-path power and delay of all corresponding receivers in the training set:   (m,b) K (m,b,u) (m,b,u) train , τ1 ) : u ∈ Um } , {ck }k=1 = KMeans {(ρ1 (15) (m,b) where ck ∈ R2 is the k-th cluster centroid of the power and delay. We illustrate example clusters in Figure 1 b). We also compute the within-cluster dispersion of the power and delay for all users within a cluster   (m,b) (m,b,u) (m,b,u) , τ1 ) : z (m,b,u) = k} , (16) σk = Std {(ρ1 where z (m,b,u) is the cluster assignment. At test time, a receiver is assigned a first-path prior through nearest-neighbor transfer within the same transmitter: u⋆ = arg

min

train (b) u′ ∈Um

′

) x(m,u) − x(m,u rx rx

2

, 2

(17)

and the corresponding cluster prior is (m,b)

cm,b,u = cz(m,b,u⋆ ) ,

(m,b)

σm,b,u = σz(m,b,u⋆ ) .

(18)

Residual first-path prediction. We use the assigned KMeans centroid as a strong initialization for the first path and train the model to predict only the residual correction:   (1) ybm,b,u = cm,b,u + fres h1 , cm,b,u , σm,b,u , xm,b,u , (19) where h1 is the decoder hidden state at the first generation step and xm,b,u is the Environmental RAG context. This design separates two sources of structure. The codebook captures the coarse dominant-path mode that is easy to estimate from neighboring training receivers, while the residual network uses the retrieved scene geometry and decoder state to make link-specific corrections. In other words, the K-Means prior provides a robust default hypothesis, and Environmental RAG provides the scene evidence needed to refine it. For subsequent paths t ≥ 2, the model reverts to the standard autoregressive prediction defined by the MultiPathFormer decoder. IV. D OWNSTREAM TASK R EUSE We demonstrate MultiPathFormer’s utility as a wireless foundation model by using it on the tasks of Sub-6 GHz to mmWave beam prediction, user localization, LoS classification, and channel estimation. These are commonly used in prior work on wireless foundation models [16], [18], [19], allowing for a direct performance comparison in Section V-E. Adapter finetuning. We use adapter finetuning for beam prediction and user localization, and evaluate LoS classification in both zero-shot and adapter-finetuned settings. For each downstream task, the adapter finetuning leverages the generalized representations from the MultiPathFormer backbone, enabling efficient adaptation through lightweight MLP heads. We apply a pooling function (e.g., first, mean, or max) to the hidden representations produced during autoregressive rollout, as shown in Equation (20). We freeze the MultiPathFormer backbone and fine-tune a lightweight MLP head ftask for downstream tasks as in Equation (21).  h̄m,n = Pool h1 , . . . , hL̂m,n (20) ŷtask = ftask (h̄m,n ).

(21)

For user localization, the receiver location, RAG, and codebook inputs are zeroed because user location is the prediction target. The multipath sequence input to the decoder produces embeddings for disambiguating the user locations. For zero-shot LoS, we simply classify based on the dominance of the maximum path power over the other multipaths. Channel estimation. Similar to other works [16], [18], we consider the task of predicting the unknown subcarrier channels from observed noisy subcarriers. MultiPathFormer does not directly compute the channel from predicted multipaths due to the high variance of the phase in high-frequency propagation. Instead, we use MultiPathFormer as a geometry prior to recover the unknown subcarriers from the observed known subcarriers. For each predicted path π̂k , we define bk

as the unit-amplitude, zero-initial-phase channel response induced by that path across antennas and subcarriers. Concretely, for subcarrier f , bk (f ) = e−j2πf τ̂k arx (θ̂kAoA ) atx (θ̂kAoD )H , and the MultiPathFormer-derived basis is B = [b1 , . . . , bK ]. Letting h denote the channel and Ω the observed knownsubcarrier entries, we estimate the complex coefficients of the predicted path basis by h ≈ Bα,

2

2

α̂ = arg min ∥BΩ α − hΩ ∥2 + λ ∥α∥2 . (22) α

The final estimate is reconstructed as B α̂, so MultiPathFormer provides the sparse propagation support while the observed subcarriers provide the instantaneous complex coefficients needed to infer the unknown subcarriers. This helps the model capture the real-time dynamics of the channel. V. E XPERIMENTAL VALIDATION We evaluate the proposed MultiPathFormer framework from several perspectives. In Section V-B, we assess the contribution of the first-path cluster codebook and environmental retrievalaugmented generation (RAG) to multipath generation quality. In Section V-E, we compare MultiPathFormer against existing state-of-the-art models on a range of downstream tasks. We then evaluate the model’s interpretability in Section V-C and ability to generalize to previously unseen user locations and environments in Section V-D. Finally, in Section V-F, we investigate its computational suitability for real-time inference. A. Experimental Setup We evaluate our method using the DeepMIMO dataset framework [34], which provides reproducible site-specific wireless datasets derived from ray-tracing simulations and is a widely used benchmark in other related works [18], [23]. DeepMIMO is especially well suited to our setting because it exposes not only channel responses but also the geometric and path-level propagation structure underlying those channels. The dataset contains data from different high-fidelity raytracing such as NVIDIA Sionna RT [38], Remcom Wireless InSite [39], and NVIDIA AODT [40]. We consider a diverse set of 31 environment scenarios for our study. Unless otherwise stated, MultiPathFormer is pretrained on 80% of the users from 27 scenarios and then evaluated in two zero-shot regimes: (i) the held-out 20% users from those same 27 scenarios, and (ii) four unseen scenarios. The Appendix gives more details on the MultiPathFormer setup. Baselines and ablations. Unless otherwise stated, we compare three variants of MultiPathFormer: Direct, which autoregressively predicts the path sequence from transmitter and receiver geometry alone; +Codebook, which adds the first-path cluster codebook and residual prediction described in Section III-D; and +RAG, which further adds the Environmental RAG features described in Section III-C. For the downstream tasks, we use lightweight heads on top of frozen backbone features for beam prediction, user localization, and LoS classification, with zero-shot evaluation considered for

+Codebook

Direct Delay MAE

+RAG

Power MAE

12

0.24

10

MAE

MAE

0.28 0.26

0.22 0.20

8 6

0.18 4

20

30

40

50

60

70

80

20

30

40

50

60

70

80

% of Train Users

Fig. 3.

MultiPathFormer retains low MAE with fewer training users.

channel estimation and LoS classification. All environment codebook clusters are fit using training tx-rx pairs only. We compare against LWM [18] and WiFo [16], two commonly used channel-based foundation models, for the downstream tasks; as well as a task-specific beam classification MLP [29] and channel estimation LSTM [41]. The MultiPathFormer backbone used in the downstream-task evaluation refers to the raw pretrained foundation model without scenario-specific finetuning, and the reported metrics are computed on held-out test users from each target scenario. B. Generative Quality and Architectural Ablations We train the MultiPathFormer model from scratch for each scenario to test the importance of each of our modules. Table I shows that each structural addition improves the MultiPathFormer backbone. Adding only the first-path codebook reduces MAE (mean absolute error) of the estimated power from 7.54 to 4.58 (averaged over both held-out users and unseen environments from all scenarios) and improves estimated interaction’s F1 from 0.786 to 0.813, showing that a compact dominantpath prior stabilizes the most consequential generation step. Adding Environmental RAG yields the best result on every metric. Relative to the direct MultiPathFormer baseline, the full +RAG model reduces delay MAE by 38.7% and power MAE by 59.2%, and improves interaction accuracy from 0.870 to 0.925, and interaction F1 from 0.786 to 0.890. These gains support the main design hypothesis of MultiPathFormer: accurate multipath generation benefits from both a robust firstpath prior and pair-specific environmental context. Figure 3 shows that this result persists for low-data regimes. Even with only 10% of users in the training set, the codebook remains beneficial and MAE remains low. Figure 4 illustrates the same effect qualitatively. The direct autoregressive model learns the coarse decay profile but makes larger errors on the first few paths. The codebook stabilizes the first path, and the full +RAG model better follows both the early high-power regime and the later path sequence. C. Spatial Coherence and Interpretability We now evaluate MultiPathFormer’s interpretability and spatial coherence. Figure 5 shows the predicted AoA azimuth field across the user grid. The full model with RAG better matches the spatial structure, showing that retrieval helps align

local predictions with the geometry of neighbouring links. This is important because a propagation foundation model should maintain spatial consistency across a deployment in addition to minimizing per-link error. To inspect whether the retrieved environment is used in an interpretable way, we also evaluated an object-token diagnostic variant in which selected scene objects are encoded independently rather than compressed into a small set of aggregate prompt tokens. Fig. 6 shows that the model’s decoder crossattends to the global prompt tokens (tx-rx positions) for the first few generated paths and then attends more to the object tokens for the later paths. This aligns with the physical intuition that the initial paths are mostly LoS and relate more to the positions, compared to later multipaths that interact with a lot of objects in the environments. D. Cross User-Environment Transfer We next demonstrate MultiPathFormer’s generalizability in zero-shot transfer to new user locations and for scenario-level adaptation. Table II evaluates how the foundation backbone transfers to unseen user locations and environments. In the zero-shot setting, MultiPathFormer transfers well to heldout users within the 27 pretraining environments, achieving average MAEs of 0.071 delay and 4.160 power, with 0.898 interaction F1. Performance drops on the four fully unseen scenarios, indicating that zero-shot cross-environment transfer remains challenging when the target geometry is absent from pretraining. However, finetuning the foundation checkpoint on each target scenario provides a stronger initialization than training the same +RAG architecture from scratch, improving the 31-scenario average delay MAE from 0.068 to 0.065 and power MAE from 3.081 to 2.888. E. Downstream Tasks We next compare MultiPathFormer’s performance on Section IV’s four downstream tasks to demonstrate the superiority of our path-based model architecture compared to prior channel-based architectures. While we use the full MultiPathFormer for this comparison, which utilizes environment and transmitter knowledge that standard channel models do not, based on Table I’s results MultiPathFormer’s simpler versions without this information would still achieve at least comparable performance to the channel-based baselines. 1) Beam Prediction: We evaluated whether models can use sub-6 GHz channels/multipaths for mmWave beam selection similar to the setup in [18], [29]. For the downstream tasks below, we report averages over the scenarios shared by the compared baselines for each task. The MultiPathFormer foundation model achieves an average top-1 accuracy of 0.671 and top-3 accuracy of 0.914, outperforming the MLP, WiFo, and LWM baselines. This result is consistent with the intuition that the optimal mmWave beam direction is determined primarily by the dominant path’s angle of departure, which is explicitly represented in MultiPathFormer’s path token sequence. Channellevel models must implicitly recover this geometric structure

TABLE I C ROSS - SCENARIO PATH - GENERATION MAE OVER 31 D EEP MIMO SCENARIOS . D ELAY IS REPORTED IN MICROSECONDS , POWER IN D B, ANGULAR ERRORS IN DEGREES , AND INTERACTION METRICS AS MULTI - LABEL CLASSIFICATION SCORES . L OWER IS BETTER FOR ALL METRICS EXCEPT INTERACTION ACCURACY /F1, WHERE HIGHER IS BETTER .

Model

Delay

Power

AoA Az

AoA El

AoD Az

AoD El

Int. Acc.

Int. F1

Direct 0.111 ± 0.062 7.544 ± 2.475 33.106 ± 11.941 4.890 ± 1.751 31.936 ± 12.001 4.042 ± 1.614 0.870 ± 0.077 0.786 ± 0.147 +Codebook 0.095 ± 0.054 4.582 ± 1.851 30.097 ± 10.297 4.688 ± 1.744 28.976 ± 11.066 3.778 ± 1.539 0.884 ± 0.079 0.813 ± 0.145 +RAG 0.068 ± 0.038 3.081 ± 1.383 22.076 ± 10.166 3.610 ± 1.655 20.147 ± 9.357 2.964 ± 1.493 0.925 ± 0.050 0.890 ± 0.079

Groundtruth Direct +Codebook +RAG

0.7

100

Power

Ground truth Direct +CodeBook +RAG

0.8

Delay (us)

80

120

0.6

0.5

0.4

140

0.3

0.2

160

0.1

0

5

10

Path Index

15

20

0

5

a) Power versus path index

10

Path Index

15

20

b) Delay versus path index

Fig. 4. Qualitative generation example for a receiver in a sample city. Direct captures the broad trend but drifts on early dominant paths. The codebook improves the dominant-path regime, while the full corridor-aware model more closely tracks the ground-truth power decay and delay evolution. TABLE II F OUNDATION - MODEL TRANSFER RESULTS . T HE FIRST BLOCK REPORTS ZERO - SHOT EVALUATION OF THE PRETRAINED M ULTI PATH F ORMER FOUNDATION MODEL ON HELD - OUT USERS FROM THE 27 PRETRAINING SCENARIOS AND ON THE FOUR UNSEEN SCENARIOS EXCLUDED FROM PRETRAINING . T HE SECOND BLOCK COMPARES SCENARIO - SPECIFIC ADAPTATION METHODS AVERAGED OVER THE SAME 31 SCENARIOS . L OWER IS BETTER FOR ALL METRICS EXCEPT INTERACTION ACCURACY /F1, WHERE HIGHER IS BETTER . Model / Evaluation Split

Delay

Power

AoA Az

AoA El

AoD Az

AoD El

Int. Acc.

Int. F1

Zero-shot pretrained foundation model Foundation (held-out users in 27 pretraining scenarios) 0.071 ± 0.036 4.160 ± 1.818 Foundation (4 unseen scenarios) 0.326 ± 0.083 14.153 ± 2.893

22.753 ± 9.837 60.725 ± 5.987

3.736 ± 1.669 20.942 ± 8.840 3.108 ± 1.469 0.929 ± 0.054 0.898 ± 0.082 6.545 ± 1.136 61.279 ± 6.272 4.998 ± 0.533 0.716 ± 0.044 0.557 ± 0.087

Scenario-specific adaptation on the same 31 scenarios 0.068 ± 0.038 0.065 ± 0.037

Scenario-trained +RAG Foundation + finetune

3.081 ± 1.383 2.888 ± 1.471

22.076 ± 10.166 3.610 ± 1.655 20.147 ± 9.357 2.964 ± 1.493 0.925 ± 0.050 0.890 ± 0.079 20.208 ± 9.570 3.311 ± 1.633 18.056 ± 8.450 2.654 ± 1.389 0.932 ± 0.050 0.900 ± 0.078

RX y-position (m)

Ground Truth

Mean attention mass

0.8

Direct

75 50 25 0 25

0.7 0.6

prefix_mass object_mass

0.5 0.4 0.3 0.2

50 75

0

5

10

15

20

25

Predicted path index +CodeBook

+RAG

RX y-position (m)

75 50 25 0 25 50 75 100

50

50

0

100

100

50

150

100

0

50

100

RX x-position (m)

RX x-position (m)

50

0

AoA Azimuth (deg)

50

100

Fig. 6. Object-token attention visualization. We expose each retrieved scene object as an individual encoder token and measure decoder cross-attention during teacher-forced rollout. The curve shows the mean attention mass assigned to global prompt tokens versus individual object tokens as a function of generated path index. MultiPathFormer’s decoder cross-attends to the prompt more than environment tokens for only the first few paths, consistent with the fact that these are likely LoS.

150

Fig. 5. Spatial comparison of predicted AoA azimuth for one transmitter. The highlighted region in red shows that the full +RAG improves MultiPathFormer’s spatial consistency.

from the collapsed channel tensor, while MultiPathFormer has direct access to it through the multipath representation. 2) User Localization: Table III also evaluates whether the learned path-level representation supports inverse geometric inference. Because receiver coordinates are unknown by def-

TABLE III AVERAGE DOWNSTREAM - TASK PERFORMANCE AVERAGED OVER THE SCENARIOS . M ULTI PATH F ORMER OUTPERFORMS LWM AND W I F O . Beam Model MLP LSTM WiFo LWM MultiPathFormer

Top-1 0.450 ± 0.054 – 0.369 ± 0.057 0.429 ± 0.037 0.671 ± 0.052

Localization Top-3

Mean (m)

Median (m)

Direct + Codebook + RAG

P90 (m)

Acc.

0.672 ± 0.087 82.25 ± 17.30 80.82 ± 21.59 131.57 ± 22.46 0.936 ± 0.092 – – – – – 0.616 ± 0.081 68.79 ± 9.08 58.52 ± 9.52 136.00 ± 22.61 0.962 ± 0.028 0.648 ± 0.053 72.78 ± 13.30 69.86 ± 15.08 123.60 ± 21.73 0.978 ± 0.018 0.914 ± 0.030 5.57 ± 2.01 4.15 ± 1.27 10.13 ± 3.09 0.994 ± 0.003

TABLE IV A LL THREE M ULTI PATH F ORMER CONFIGURATIONS MAINTAIN LOW INFERENCE TIMES ( MS ), AVERAGED ACROSS DIFFERENT SCENARIOS .

Model

LoS

Params (M)

Infer

CodeBook

RAG

35.256 35.261 35.512

2.77 3.39 3.45

– 0.92 0.92

– – 0.21

inition during localization, we zero all codebook and RAG prompt slots that depend on receiver location when extracting localization features. MultiPathFormer performs best on all three localization metrics, with a mean error of 5.57 m, median error of 4.15 m, and 90th-percentile error of 10.13 m over the common scenarios. This suggests that the MultiPathFormer decoder encodes useful geometric information from the generated multipath structure itself and is not simply exploiting receiver-dependent codebook or RAG features. 3) LoS Classification: We first evaluate MultiPathFormer zero-shot for LoS classification by measuring the dominance of the maximum-power path over the remaining paths. This zero-shot rule achieves 0.976 accuracy and 0.959 F1, showing that the LoS/NLoS structure is already captured by the generated multipath. Table III shows that adapter finetuning of the same pretrained backbone improves further to 0.994 accuracy and 0.990 F1, outperforming the other methods. 4) Channel Estimation: We finally compare the MultiPathFormer channel-estimation reuse strategy described in Section IV against the channel-level LSTM, WiFo, and LWM baselines on the common evaluation scenarios. The LSTM is trained from scratch on each target scenario, while MultiPathFormer, WiFo, and LWM are evaluated without scenariospecific channel-estimation finetuning. The antenna setup is a 1 × 8 array with 32 subcarriers. For all methods, the first half of the subcarriers are observed and the remaining half are estimated. Table III shows that the scenario-trained LSTM achieves the lowest NMSE, while MultiPathFormer is the strongest non-finetuned foundation-model baseline. F. Inference Cost Finally, we show that MultiPathFormer enables fast inference. Table IV shows that all three variants remain in the same low-latency regime, between 2–3 ms per inference. The direct model is fastest because it avoids codebook and RAG lookup, while the full +RAG model adds only modest

Channel Est. F1

0.884 ± 0.263 – 0.946 ± 0.040 0.968 ± 0.028 0.990 ± 0.008

NMSE

NMSE (dB)

– – 0.049 ± 0.019 -14.78 ± 1.66 1.321 ± 0.404 0.93 ± 1.56 1.000 ± 0.000 0.00 ± 0.00 0.561 ± 0.353 -13.27 ± 4.40

overhead and a small parameter increase (35.5M vs. 35.26M) while delivering substantially better generation fidelity. This makes the full MultiPathFormer design attractive not only in terms of accuracy but also in terms of deployment practicality. VI. C ONCLUSION AND F UTURE D IRECTION In this paper, we presented MultiPathFormer, a wireless foundation model that treats multipath propagation, rather than the channel tensor, as the pretraining object. By representing each transmitter–receiver link as an autoregressive sequence of path tokens, PathFormer learns reusable path-level representations that preserve dominant-path structure, angular geometry, and propagation interactions. An important next step is to evaluate whether these gains carry over from ray-tracing data to actual real-world measurement scenarios. A PPENDIX a) Model Architecture: MultiPathFormer uses an encoder-decoder architecture with a full transformer decoder and an MLP encoder. The model uses 12 transformer layers with 8 heads and a hidden dimension of 1024, supporting a maximum sequence length of 25 paths. b) RAG and Corridor retrieval configuration: The firstpath codebook uses K = 25 KMeans clusters per transmitter. For the environmental retrieval module, we use Klocal = 5 nearest local objects, Kcorr = 5 nearest corridor objects, B = 8 corridor bins, and local/corridor radii {25, 50, 100} meters. Each dense object descriptor includes distance, height, footprint area, and material properties (permittivity, conductivity, and scattering coefficient) when available. c) Training setup: We split users within each transmitter into train and validation sets and retain only users with at least one valid path. Path delays are converted to microseconds, powers are scaled by 0.01, and angles are represented in radians. All models are trained with batch size 128 using AdamW and cosine-annealing warm restarts. We train the foundation model for 200 epochs with learning rate 2 × 10−5 , λlen and λint weights to 0.01. During training, we randomly add noise to 20% of the tokens in every path during every epoch. This served as a data augmentation strategy to enable the model to recover from generation errors. d) Evaluation protocol: The model is evaluated in full autoregressive generation during inference with no teacherforcing. The results are for each path averaged over the actual number of multipaths and then over the users.

e) Environment Summary: The main generation study uses 31 DeepMIMO scenarios. Across these environments, the number of active users ranges from 25,669 to 320,104, the LoS user ratio ranges from 0.042 to 0.763, the mean number of paths per active user ranges from 2.3 to 21.4, and the mean transmitter–receiver distance ranges from 77.8 m to 178.7 m. This diversity covers both dense urban scenes with many buildings and more open environments with fewer obstructions, providing a broad testbed for evaluation. R EFERENCES [1] R. Bommasani, D. A. Hudson, E. Adeli, R. Altman, S. Arora, S. von Arx, M. S. Bernstein, J. Bohg, A. Bosselut, E. Brunskill et al., “On the opportunities and risks of foundation models,” arXiv preprint arXiv:2108.07258, 2021. [2] T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell et al., “Language models are few-shot learners,” Advances in neural information processing systems, vol. 33, pp. 1877–1901, 2020. [3] A. Dosovitskiy, L. Beyer, A. Kolesnikov, D. Weissenborn, X. Zhai, T. Unterthiner, M. Dehghani, M. Minderer, G. Heigold, S. Gelly et al., “An image is worth 16x16 words: Transformers for image recognition at scale,” arXiv preprint arXiv:2010.11929, 2020. [4] A. Radford, J. W. Kim, C. Hallacy, A. Ramesh, G. Goh, S. Agarwal, G. Sastry, A. Askell, P. Mishkin, J. Clark, G. Krueger, and I. Sutskever, “Learning transferable visual models from natural language supervision,” arXiv preprint arXiv:2103.00020, 2021. [Online]. Available: https://arxiv.org/abs/2103.00020 [5] B. Zitkovich, T. Yu, S. Xu et al., “Rt-2: Vision-language-action models transfer web knowledge to robotic control,” in Proceedings of The 7th Conference on Robot Learning, ser. Proceedings of Machine Learning Research, J. Tan, M. Toussaint, and K. Darvish, Eds., vol. 229. PMLR, 06–09 Nov 2023, pp. 2165–2183. [Online]. Available: https://proceedings.mlr.press/v229/zitkovich23a.html [6] S. Reed, K. Zolna, E. Parisotto, S. G. Colmenarejo, A. Novikov, G. Barth-Maron, M. Gimenez, Y. Sulsky, J. Kay, J. T. Springenberg, T. Eccles, J. Bruce, A. Razavi, A. Edwards, N. Heess, Y. Chen, R. Hadsell, O. Vinyals, M. Bordbar, and N. de Freitas, “A generalist agent,” 2022. [Online]. Available: https://arxiv.org/abs/2205.06175 [7] J. Devlin, M.-W. Chang, K. Lee, and K. Toutanova, “Bert: Pre-training of deep bidirectional transformers for language understanding,” in Proceedings of the 2019 conference of the North American chapter of the association for computational linguistics: human language technologies, volume 1 (long and short papers), 2019, pp. 4171–4186. [8] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in neural information processing systems, vol. 30, 2017. [9] D. Guo, D. Yang, H. Zhang, J. Song, P. Wang, Q. Zhu, R. Xu, R. Zhang, S. Ma, X. Bi et al., “Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning,” arXiv preprint arXiv:2501.12948, 2025. [10] J. Xiao, J. Wang, K. Cao, X. Li, Z. Chen, and C. Yuen, “Wireless ai evolution: From statistical learners to electromagnetic-guided foundation models,” IEEE Communications Magazine, 2026. [11] T. S. Rappaport, S. Sun, R. Mayzus, H. Zhao, Y. Azar, K. Wang, G. N. Wong, J. K. Schulz, M. Samimi, and F. Gutierrez, “Millimeter wave mobile communications for 5g cellular: It will work!” IEEE Access, vol. 1, pp. 335–349, 2013. [12] T. S. Rappaport, G. R. MacCartney, M. K. Samimi, and S. Sun, “Wideband millimeter-wave propagation measurements and channel models for future wireless communication system design,” IEEE Transactions on Communications, vol. 63, no. 9, pp. 3029–3056, 2015. [13] B. 3GPP, “Study on channel model for frequencies from 0.5 to 100 ghz (release 14),” 3GPP TR 38.901 V14. 0.0, 2017. [14] J. Guo, J. Xue, J. Zhang, Z. Qiao, and Z. Xu, “Scalable pre-trained large channel models for wireless communication systems,” IEEE Communications Magazine, 2026. [15] J. Guo, Y. Cui, S. Jin, and J. Zhang, “Large ai models for wireless physical layer,” IEEE Communications Magazine, 2026.

[16] B. Liu, S. Gao, X. Liu, X. Cheng, and L. Yang, “Wifo: Wireless foundation model for channel prediction,” Science China Information Sciences, vol. 68, no. 6, p. 162302, 2025. [17] L. Yu, L. Shi, J. Zhang, J. Wang, Z. Zhang, Y. Zhang, and G. Liu, “Channelgpt: A large model to generate digital twin channel for 6g environment intelligence,” arXiv preprint arXiv:2410.13379, 2024. [18] S. Alikhani, G. Charan, and A. Alkhateeb, “Large wireless model (lwm): A foundation model for wireless channels,” arXiv preprint arXiv:2411.08872, 2024. [Online]. Available: https://arxiv.org/abs/2411. 08872 [19] T. Yang, P. Zhang, M. Zheng, Y. Shi, L. Jing, J. Huang, and N. Li, “Wirelessgpt: A generative pre-trained multi-task learning framework for wireless communication,” IEEE Network, 2025. [20] J. Jiang, Y. Gao, X. Wu, and S. Xu, “Towards channel foundation models (cfms): Motivations, methodologies and opportunities,” arXiv preprint arXiv:2507.13637, 2025. [21] [Online]. Available: https://www.openstreetmap.org/#map=5/38.01/-95. 84 [22] K. He, X. Chen, S. Xie, Y. Li, P. Dollár, and R. Girshick, “Masked autoencoders are scalable vision learners,” 2021. [Online]. Available: https://arxiv.org/abs/2111.06377 [23] B. Guler, G. Geraci, and H. Jafarkhani, “Robust channel representation for wireless: A multi-task masked contrastive approach,” in NeurIPS 2025 Workshop: AI and ML for Next-Generation Wireless Communications and Networking, 2025. [Online]. Available: https://openreview.net/forum?id=KXNDs9ZGb9 [24] C. Chen, W. Jin, H. He, X. Sun, and S. Jin, “Spa-mae: A physicsguided csi foundation model for wireless physical layer,” arXiv preprint arXiv:2605.19849, 2026. [25] Y. Sheng, J. Wang, X. Zhou, L. Liang, H. Ye, S. Jin, and G. Y. Li, “A wireless foundation model for multi-task prediction,” arXiv preprint arXiv:2507.05938, 2025. [26] J. Fontaine, A. Shahid, and E. De Poorter, “Towards a wireless physicallayer foundation model: Challenges and strategies,” in 2024 IEEE International Conference on Communications Workshops (ICC Workshops). IEEE, 2024, pp. 1–7. [27] H. Zhang, M. Farzanullah, M. Ghassemi, A. B. Sediq, A. Afana, and M. Erol-Kantarci, “Multi-modal data-enhanced foundation models for prediction and control in wireless networks: A survey,” IEEE Communications Surveys & Tutorials, vol. 28, pp. 4359–4393, 2025. [28] Z. Han, L. Bai, X. Cai, and X. Cheng, “Wico-mg: Wireless channel foundation model for multipath generation via synesthesia of machines,” arXiv preprint arXiv:2511.15026, 2025. [Online]. Available: https://arxiv.org/abs/2511.15026 [29] M. Alrabeiah and A. Alkhateeb, “Deep learning for mmwave beam and blockage prediction using sub-6 ghz channels,” IEEE Transactions on Communications, vol. 68, no. 9, pp. 5504–5518, 2020. [30] A. Alkhateeb, S. Alex, P. Varkey, Y. Li, Q. Qu, and D. Tujkovic, “Deep learning coordinated beamforming for highly-mobile millimeter wave systems,” IEEE Access, vol. 6, pp. 37 328–37 348, 2018. [31] X. Li, J. Guo, C.-K. Wen, and S. Jin, “Auto-csinet: Scenario-customized automatic neural network architecture generation for massive mimo csi feedback,” 2023. [Online]. Available: https://arxiv.org/abs/2311.15950 [32] M. Soltani, V. Pourahmadi, A. Mirzaei, and H. Sheikhzadeh, “Deep learning-based channel estimation,” 2019. [Online]. Available: https://arxiv.org/abs/1810.05893 [33] H. He, C.-K. Wen, S. Jin, and G. Y. Li, “Deep learning-based channel estimation for beamspace mmwave massive mimo systems,” IEEE Wireless Communications Letters, vol. 7, no. 5, pp. 852–855, 2018. [34] A. Alkhateeb, “Deepmimo: A generic deep learning dataset for millimeter wave and massive MIMO applications,” CoRR, vol. abs/1902.06435, 2019. [Online]. Available: http://arxiv.org/abs/1902. 06435 [35] M. Li, T. Lv, J. Chen, L. Cui, Y. Lu, D. Florencio, C. Zhang, Z. Li, and F. Wei, “Trocr: Transformer-based optical character recognition with pre-trained models,” in Proceedings of the AAAI conference on artificial intelligence, vol. 37, no. 11, 2023, pp. 13 094–13 102. [36] E.-C. Trı̂nc, C. Ancut, i, A. Vesa, C. Simu, V.-A. Nit, ă, and C. StolojescuCrişan, “3d urban outdoor wifi 7 network planning and analysis using ray-tracing and machine learning: Transformer-based surrogate modeling for high-resolution digital twin,” Sensors, vol. 26, no. 7, 2026. [Online]. Available: https://www.mdpi.com/1424-8220/26/7/2223 [37] T. S. Rappaport, “Wireless communications–principles and practice, (the book end).” Microwave Journal, vol. 45, no. 12, pp. 128–129, 2002.

[38] J. Hoydis, S. Cammerer, F. A. Aoudia, A. Vem, N. Binder, G. Marcus, and A. Keller, “Sionna: An open-source library for next-generation physical layer research,” 2023. [Online]. Available: https://arxiv.org/abs/2203.11854 [39] RemCom, “Wireless em propagation software.” [Online]. Available: https://www.remcom.com/wireless-insite-propagation-software [40] “Omniverse digital twin — aerial omniverse digital twin.” [Online]. Available: https://docs.nvidia.com/aerial/aerial-dt/index.html [41] W. Jiang and H. D. Schotten, “Deep learning for fading channel prediction,” IEEE Open Journal of the Communications Society, vol. 1, pp. 320–332, 2020.

Related documents

Record · ID 429358 · SHA-256 4b479bbfd09fab46
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive