Few-Shot Beam Selection for Embodied AI via In-Context Learning and Conformal Prediction

arXiv:2611.07306 · eess.SP · Submitted 2026-11-05 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.

Rosa: I'm Rosa.

Dev: And I'm Dev, here with Taro.

Rosa: We're looking at the paper: "Few-Shot Beam Selection for Embodied AI via In-Context Learning and Conformal Prediction".

Dev: Here's the gist of the paper. Millimeter-wave (mmWave) communications are essential for supporting massive multimodal sensory data exchange in Embodied Artificial Intelligence (EAI) systems, and fast and reliable beam selection remains a critical bottleneck due to the prohibitive overhead associated with conventional beam training Problem Context Millimeter-wave (mmWave) communications are essential for supporting massive multimodal sensory data exchange in Embodied Artificial Intelligence (EAI) systems, and fast and reliable beam selection remains a critical bottleneck due to the prohibitive overhead associated with conventional beam training To support the offloading of massive multimodal sensory data (e.g., high-resolution video and LiDAR point clouds) and enable real-time control, EAI devices require ultra-reliable and high-capacity wireless communication Millimeter-wave (mmWave) systems have emerged as key enabler for meeting these stringent data rate requirements Consequently, fast and reliable beam selection becomes critical for ensuring robust connectivity in EAI applications Traditional beam selection, such as exhaustive sweeping and hierarchical searching, incur substantial latency, which limits the real-time responsiveness of EAI systems Framework Proposal To address these challenges, we propose a novel framework termed In-Context Learning driven Cross-Validation Conformal Prediction (ICL+CVCP) for beam prediction The proposed framework utilizes the training-free adaptation capability of ICL, enabling effective operation with only a small number of demonstration samples and eliminating the need for large-scale data collection and model fine-tuning In addition, the CVCP module constructs compact, distribution-free candidate beam sets that provably contain the optimal beam with a user-defined probability Classical Conformal Prediction As a powerful tool for uncertainty quantification, CVCP improves data utilization by partitioning the dataset D into K subsets Specifically, each sample (xi, yi) is sequentially treated as a calibration sample, while the remaining n − 1 samples (i.e., D - 1) form the corresponding training set to learn the i-th prediction model pˆ(−i)(·x) Based on this predictor, the non-conformity score for the calibration sample (xi, yi) is calculated as si = − log pˆ(−i)(yixi) Next, for a hypothesized sample (xn+1, y) formed by a test sample xn+1 and any candidate label y ∈ Y, all n predictors pˆ(−i)(·x) are utilized to calculate their respective nonconformity scores s y i,n+1 = − log pˆ(−i)(yxn+1) and the minimum non-conformity score for (xn+1, y) is computed as s y min,n+1 = min i=1,… n s y i,n+1 By comparing this score with the calibration score set D = 5 Nov 2026, the p-value π(y) for the candidate label y is calculated as π(y) = 1/n + 1 Xn i=1 1(s y min,n+1 ≤ si) Accordingly, the prediction set for the test input xn+1 is defined as Γα(xn+1) = Y: π(y) ⩾ α In-Context Learning Mechanism Unlike conventional meta-learning methods that rely on iterative parameter updates, ICL requires no explicit gradient fine-tuning of the model; it can rapidly adapt to new tasks simply by implicitly extracting patterns from context samples during forward inference Specifically, given a context set Dcon = (xi, yi) n i=1 and a query input xn+1, the ICL model Gθ(·, ·) parameterized by θ directly outputs the predictive distribution corresponding to xn+1: pˆ(·xn+1) = Gθ(Dcon, xn+1) To train Gθ(·, ·), data are first collected from T auxiliary tasks For each task t = 1,..., T, a context sample set Dtcon = (x t i, yt i) n i=1 and a query sample pair (x t n+1, yt n+1) are drawn independently and identically distributed (i.i.d.) from a task-specific distribution The model parameters θ are then optimized by minimizing the negative log-likelihood loss across all tasks: L(θ) = − 1/T X T t=1 log Gθ(D t con, x t n+1) ICL+CVCP Integration As illustrated in Fig.

Rosa: 2, for each sample (xi, yi) in the dataset D = (xi, yi) n i=1, a LOO complement set D - (xi), yi is constructed to serve as the context for prediction This complement set is mapped by an embedding network h1(·) into a sequence of context features c1,..., ci−1, ci+1,..., cn Simultaneously, the current calibration input xi and the test input xn+1 are encoded by another embedding network h2(·) into query features qi and qn+1, respectively Subsequently, these features are concatenated into a unified input sequence

c1,..., ci−1, ci+1,..., cn, qi, qn+1: , which is then fed into a Transformer model with cascaded encoder layers By performing n such forward inferences in parallel, the prediction results pˆ(−i)(·xi) n i=1 and pˆ(−i)(·xn+1) n i=1 can be efficiently obtained for all LOO complement sets Performance Analysis The results show that the CP-based methods satisfy the prescribed coverage targets by adaptively adjusting the size of the candidate sets, whereas ICL+Top-L provides only fixed coverage Notably, the proposed ICL+CVCP constructs significantly more compact candidate sets than E-ICL+SCP and ICL+SCP, owing to its more efficient utilization of limited data For example, at 1 − α = 0.90, ICL+CVCP reduces the average candidate set size by 11.42% and 8.84% compared to ICL+SCP and E-ICL+SCP, respectively Importantly, its performance closely approaches that of the computationally intensive ICL+FCP baseline, incurring only a marginal 1.20% increase in set size while avoiding the associated exhaustive computation Efficiency Gains The proposed ICL+CVCP demonstrates a clear efficiency advantage over ICL+FCP CVCP avoids the exhaustive enumeration of all candidate labels required by FCP, reducing the number of evaluations from Yr(2n + 2) to K(n + r) Furthermore, ICL+CVCP naturally leverages the Key-Value (KV) Cache mechanism of large language models Since the LOO context features

c1,..., ci−1, ci+1,..., cn: and query qi remain fixed across different new test samples xn+1, their corresponding KV pairs are computed only once Reusing these cached representations eliminates redundant forward passes, drastically reducing computational overhead without compromising accuracy In this paper, we have presented ICL+CVCP, an efficient location-aided beam selection framework for EAI systems in mmWave networks To address data scarcity and localization errors, the proposed framework leverages ICL for rapid, training-free adaptation from few-shot demonstrations for beam prediction By integrating CVCP, the framework transforms unreliable point predictions into compact candidate sets with rigorous, distribution-free reliability guarantees Comprehensive evaluations confirm that ICL+CVCP consistently satisfies userdefined coverage requirement and achieve high optimal beam hit rates, while producing significantly tighter candidate sets than existing baselines Moreover, the proposed framework substantially reduces both pilot probing overhead and computational complexity Overall, ICL+CVCP offers a robust beam selection solution, making it well-suited for dynamic and resource-constrained EAI applications References

1: A.

Dev: Cangelosi, J.

Rosa: Bongard, M.

Title and authors: Rosa: So we're looking at this paper by Weihao Deng and Ruihan Li and Feihang Xu and Min Li called Few-Shot Beam Selection for Embodied AI via In-Context Learning and Conformal Prediction. It sounds like they're tackling the problem of finding the right wireless beam fast when you have massive amounts of sensory data coming from things like robots or self-driving systems.

Dev: Yeah, it's about this bottleneck with mmWave communication where you need to select a beam quickly and reliably because the overhead for traditional training methods is just too high. This paper proposes a framework called ICL plus CVCP to handle that specific challenge in Embodied Artificial Intelligence systems.

Taro: So what’s the big idea here? Is it going to solve the localization errors that always plague these systems, or is it more about how they pick the beam given limited training data?

Rosa: Well, they use In-Context Learning which lets a model adapt really fast with just a few examples. This means you don't need huge datasets or retraining for every new task, which is a big deal when you are in the field.

Dev: And on top of that, they combine that with Cross-Validation Conformal Prediction to build these candidate beam sets. The goal is to get those sets to be compact and distribution-free, meaning they don't rely on any specific assumptions about the data distribution.

Taro: So if I understand correctly, it’s about using In-Context Learning for quick learning and then using Conformal Prediction to make sure the set of possible beams is as small as possible while still guaranteeing you hit the right one with a certain probability.

Rosa: Exactly. The paper shows that this approach lets them operate effectively with only a small number of demonstration samples, which cuts down on data collection and fine-tuning costs significantly.

Dev: And the CVCP part is smart because it constructs these candidate sets in a way that provably contains the optimal beam, which means you get your coverage targets met without having to test every single possibility.

Taro: But I wonder about how this handles when the real world throws something weird at it, like sudden localization errors or when the robot is in a completely new environment. Does this method stay robust?

Rosa: The paper points out that traditional methods struggle with localization errors and needing extensive training data, and by using GPS coordinates as prior spatial information, they try to explicitly exploit how the geometry depends on where you are in the world.

Dev: And then they look at the practical challenges of classical CVCP, specifically how training on extremely small sets can increase the risk of severe overfitting and how retraining separate models adds computational load for resource-constrained systems.

Title and authors: Taro: That sounds like a real concern when you're talking about real-time loops where latency matters. If you have to retrain models constantly, that’s a failure mode we don't want in an embodied AI application.

Rosa: They address that by using the In-Context Learning mechanism, which avoids iterative parameter updates and gradient fine-tuning entirely, so it just adapts by extracting patterns from the context samples during forward inference.

Dev: That makes sense for latency because you skip all that heavy training setup during real operation; you just feed in the context and get a prediction distribution. The model parameters are optimized by minimizing a negative log-likelihood loss across several auxiliary tasks, which is a clever way to train it without traditional fine-tuning.

Taro: So it’s not just about adapting fast, but also using these auxiliary tasks for training to make sure the adaptation actually generalizes well when the world changes. What are those auxiliary tasks used for?

Rosa: The paper says they collect data from a set of T auxiliary tasks, and for each task t equals one through T, they draw context samples and a query sample pair that are independent and identically distributed from a task specific distribution. It’s like teaching the model general patterns across different scenarios.

Dev: And once you have those models trained on those tasks, you use them to calculate nonconformity scores for any new test input. Specifically, for a hypothesized sample, you take all n predictors and calculate their respective nonconformity scores based on the test sample and the candidate label y.

Taro: So if we have a test input and we guess a beam might be wrong, we compare how much that prediction model fails compared to how well it performed during training on those tasks, right? That sounds like a solid way to measure uncertainty.

Rosa: That's the core of the Conformal Prediction part. You find the minimum nonconformity score among all your predictors and compare it against your calibration scores from the demonstration set D. This gives you a p value for each candidate label y, which then defines your prediction set Gamma alpha of that test input as any label y where that p value is greater than or equal to some threshold alpha.

Dev: And the results show this CP-based method satisfies the prescribed coverage targets by adaptively adjusting the size of these candidate sets, whereas other methods like ICL plus Top-L just give you a fixed coverage level, which isn't as flexible.

Title and authors: Taro: The paper also claims that ICL plus CVCP constructs significantly more compact candidate sets than E-ICL plus SCP and ICL plus SCP because it uses the limited data more efficiently. For example, at one alpha minus alpha equals zero point nine zero, this method reduces the average candidate set size by eleven point four two percent compared to ICL plus SCP.

Rosa: That reduction in candidate set size is pretty significant when you're dealing with pilot probing overhead, which is what we were worried about initially. It means less testing needed before you can select a beam.

Dev: And they also note that their performance stays close to the computationally intensive ICL plus FCP baseline, only seeing a marginal one point two zero percent increase in set size while avoiding that exhaustive computation entirely. That’s good for low latency systems.

Taro: Speaking of efficiency, they mention something really interesting about how this framework uses the Key-Value cache mechanism of large language models. The context features and query features stay fixed across different test samples, so their corresponding key value pairs are computed only once.

Rosa: So that means reusing those cached representations saves a lot of redundant forward passes without losing accuracy, which is a major win for efficiency in deployment. It makes the entire beam selection process much faster than what we expected from just using standard ICL or CVCP alone.

Dev: So, to wrap up this paper on Few-Shot Beam Selection for Embodied AI via In-Context Learning and Conformal Prediction, they show that combining fast adaptation with distribution-free set construction gives you a robust and low latency solution for beam selection in dynamic systems.

Taro: I just want to circle back on the limitation they mentioned: classical CVCP still faces overfitting risks when training on extremely small leaves from the LOO subsets, and the requirement of retraining n separate models still adds computational overhead for resource-constrained environments.

Rosa: So, while it’s much better than those methods, you can't completely ignore that risk if your demonstration set is really tiny or if you have very tight latency constraints that forbid any retraining at all.

Dev: I think the practical implication is that this framework provides a strong balance: it gives you the reliability guarantees of Conformal Prediction while using In-Context Learning to keep the setup simple and fast enough for real-time embodied AI applications.

Taro: It seems like a solid path forward, especially when you consider how they leverage GPS coordinates as prior spatial information to help compensate for localization errors in those tough field conditions.

Rosa: Yeah, I think this is a framework that moves us closer to having more reliable and less pilot-heavy beam selection in the complex world of mmWave communication for embodied AI. We’ll take a break now before we look at what other papers are out there.

The paper's summary: Rosa: So, to summarize what we just heard, this paper is about finding that right wireless beam really fast when you have massive sensory data for an AI system, and they propose this method called ICL plus CVCP to handle that bottleneck.

Dev: Exactly. It’s combining In-Context Learning for learning new things quickly with Cross-Validation Conformal Prediction to make the candidate beam sets small enough to manage.

Rosa: What I find really interesting is how they use In-Context Learning, which means the AI model doesn't need massive retraining when it gets a new task; it just learns from a few examples in context.

Dev: That’s the fast adaptation part. But then they use Conformal Prediction to take those predictions and construct these candidate beam sets that are provably reliable, meaning they guarantee hitting the right beam with some level of confidence.

Rosa: And the results show that this combination is actually quite compact compared to other methods we’ve seen, like ICL plus SCP. They reduce the number of candidate beams needed a lot when they target high coverage levels, like ninety percent.

Dev: That reduction in set size is huge because it means less time spent on pilot probing and fewer computations for the system running in real-time loops. It’s about keeping the latency low while maintaining reliability.

Rosa: And what really stands out is how they use those large language model style features, like key value caching, to reuse parts of the prediction process without having to do all that heavy computation every single time a new test sample comes in.

Dev: That’s a big efficiency gain. It means the system can handle dynamic changes in the environment better because it doesn't have to re-calculate everything from scratch for every new situation.

Rosa: So, this moves us toward having a more robust way for embodied AI systems to select communication links even when they are dealing with limited training data or tricky localization errors in the field.

Dev: It certainly offers a path forward because it balances that need for rapid adaptation with the need for rigorous reliability guarantees in these demanding wireless scenarios.

The paper's improvements: Taro: So, we've talked about how they use In-Context Learning to adapt fast and Conformal Prediction to build reliable sets for beam selection, and now we’re looking at what the authors suggest to make it even better.

Rosa: What I see is that the authors focus on making the candidate beam sets smaller than they already are. They show how their approach can build much tighter sets than some other methods when you need high coverage, like ninety percent.

Dev: That makes sense because smaller candidate sets mean less overhead for probing, which cuts down on those time delays in the real-time loop. It’s a direct trade-off between set size and the computational cost of checking every possibility.

Taro: They also point out how they can use GPS coordinates as prior spatial information, which helps when the robot gets lost or the localization errors are big. It suggests that if you have that kind of spatial context, you can lean on it more heavily for adaptation.

Rosa: That’s because they aren't starting from a blank slate; they’re using what we already know about where the device is in the world to guide how quickly the AI model adapts to new conditions.

Dev: And regarding failure modes, the authors suggest that you can use this framework not just for selection, but for monitoring performance. They have some ideas on how to detect if an environment has changed drastically and needs a completely different beam selection strategy.

Taro: I like that idea of monitoring; it moves beyond just picking the best beam right now, and starts thinking about long-term system health when the world misbehaves unexpectedly.

Rosa: So, they’re suggesting that this whole setup isn't just a one-time selection tool, but something you can use to keep an eye on things while the AI is running in the field for a long time.

Dev: It points toward a more complete system where beam selection is part of a larger control loop, not just an isolated function that runs once and forgets it.

Taro: And if we combine this with what they’re doing on other topics, like using sensing-assisted waveforms or foundation models for planning, this beam selection method becomes a much more integrated part of the whole embodied AI stack.

Conclusion: Rosa: So, to wrap up, this paper introduces In-Context Learning and Conformal Prediction as a way to do beam selection for Embodied AI systems in mmWave networks when you have limited data.

Dev: Basically, they show how you can get rapid adaptation from just a few examples while using the Conformal Prediction module to build candidate sets that are provably good, meaning you’re guaranteed to find the right beam with a certain confidence level.

Taro: It’s about taking those fast adaptations and making sure the resulting beam choices are reliable, even when the robot is in a tricky spot or has localization errors.

Rosa: The implication here is that embodied AI systems can be much more robust in real-world situations because they don't need massive, expensive training datasets to figure out how to communicate reliably.

Dev: It also shows a way to keep the latency low because the In-Context Learning part avoids all that heavy, iterative model retraining during operation.

Taro: What this changes for someone testing autonomy is that you can deploy systems in environments where you don't have weeks of data to fine-tune every time.

Rosa: It also means less pilot probing overhead because their candidate sets are significantly more compact than some existing methods, which cuts down on the number of tests the robot has to do before it locks onto a connection.

Dev: The paper, "Few-Shot Beam Selection for Embodied AI via In-Context Learning and Conformal Prediction," gives us a concrete framework for balancing speed and reliability in these tough wireless scenarios.

Taro: I think the future work will be looking at how this framework handles even more extreme data scarcity, maybe when the robot is in a completely new physical space not covered by its training examples.

Rosa: That’s right, we’ll keep an eye on those real-world trials to see exactly how well this performs when the world throws some weirdness our way.

Weicao Deng, Ruihan Li, Feihang Xu, Min Li

Zhejiang University

eess.SP

Submitted: 2026-11-05

Updated: 2026-11-05

Comments: 6 pages, 4 figures. Accepted by the 2026 IEEE International Symposium on Information Theory Workshop (ISIT 2026 Workshop) on Reliable Machine Learning for Wireless Embodied Intelligence

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 98/100

The gist: Millimeter-wave (mmWave) communications are essential for supporting massive multimodal sensory data exchange in Embodied Artificial Intelligence (EAI) systems…

Key concepts

In-Context Learning (ICL)
ICL allows a model to adapt to new tasks simply by seeing a few examples in the prompt without needing extensive retraining or fine-tuning. In this context, it enables the beam prediction model to rapidly learn patterns from small demonstrations, making it suitable for data-scarce environments like Embodied AI systems.
Cross-Validation Conformal Prediction (CVCP)
CVCP is a method used to create a compact set of candidate beams that is guaranteed to contain the optimal beam with a specified probability. It works by partitioning the data and using non-conformity scores derived from predictions to select only the most promising candidates, ensuring reliable coverage.
Beam Selection Bottleneck
In mmWave communications, quickly and reliably selecting the correct radio beam is crucial but difficult. Traditional methods like exhaustive searching take too much time and overhead for real-time applications in Embodied AI systems that need to handle massive sensory data exchange.

Terminology

Summary

Millimeter-wave (mmWave) communications are essential for supporting massive multimodal sensory data exchange in Embodied Artificial Intelligence (EAI) systems, and fast and reliable beam selection remains a critical bottleneck due to the prohibitive overhead associated with conventional beam training

Problem Context

Millimeter-wave (mmWave) communications are essential for supporting massive multimodal sensory data exchange in Embodied Artificial Intelligence (EAI) systems, and fast and reliable beam selection remains a critical bottleneck due to the prohibitive overhead associated with conventional beam training To support the offloading of massive multimodal sensory data (e.g., high-resolution video and LiDAR point clouds) and enable real-time control, EAI devices require ultra-reliable and high-capacity wireless communication Millimeter-wave (mmWave) systems have emerged as key enabler for meeting these stringent data rate requirements Consequently, fast and reliable beam selection becomes critical for ensuring robust connectivity in EAI applications Traditional beam selection, such as exhaustive sweeping and hierarchical searching, incur substantial latency, which limits the real-time responsiveness of EAI systems

Framework Proposal

To address these challenges, we propose a novel framework termed In-Context Learning driven Cross-Validation Conformal Prediction (ICL+CVCP) for beam prediction The proposed framework utilizes the training-free adaptation capability of ICL, enabling effective operation with only a small number of demonstration samples and eliminating the need for large-scale data collection and model fine-tuning In addition, the CVCP module constructs compact, distribution-free candidate beam sets that provably contain the optimal beam with a user-defined probability

Classical Conformal Prediction

As a powerful tool for uncertainty quantification, CVCP improves data utilization by partitioning the dataset D into K subsets Specifically, each sample (xi, yi) is sequentially treated as a calibration sample, while the remaining n − 1 samples (i.e., D - 1) form the corresponding training set to learn the i-th prediction model pˆ(−i)(·x) Based on this predictor, the non-conformity score for the calibration sample (xi, yi) is calculated as si = − log pˆ(−i)(yixi) Next, for a hypothesized sample (xn+1, y) formed by a test sample xn+1 and any candidate label y ∈ Y, all n predictors pˆ(−i)(·x) are utilized to calculate their respective nonconformity scores s y i,n+1 = − log pˆ(−i)(yxn+1) and the minimum non-conformity score for (xn+1, y) is computed as s y min,n+1 = min i=1,… n s y i,n+1 By comparing this score with the calibration score set D = 5 Nov 2026, the p-value π(y) for the candidate label y is calculated as π(y) = 1/n + 1 Xn i=1 1(s y min,n+1 ≤ si) Accordingly, the prediction set for the test input xn+1 is defined as Γα(xn+1) = Y: π(y) ⩾ α

In-Context Learning Mechanism

Unlike conventional meta-learning methods that rely on iterative parameter updates, ICL requires no explicit gradient fine-tuning of the model; it can rapidly adapt to new tasks simply by implicitly extracting patterns from context samples during forward inference Specifically, given a context set Dcon = (xi, yi) n i=1 and a query input xn+1, the ICL model Gθ(·, ·) parameterized by θ directly outputs the predictive distribution corresponding to xn+1: pˆ(·xn+1) = Gθ(Dcon, xn+1) To train Gθ(·, ·), data are first collected from T auxiliary tasks For each task t = 1,..., T, a context sample set Dtcon = (x t i, yt i) n i=1 and a query sample pair (x t n+1, yt n+1) are drawn independently and identically distributed (i. p. 2i.d.) from a task-specific distribution The model parameters θ are then optimized by minimizing the negative log-likelihood loss across all tasks: L(θ) = − 1/T X T t=1 log Gθ(D t con, x t n+1)

ICL+CVCP Integration

As illustrated in Fig. 2, for each sample (xi, yi) in the dataset D = (xi, yi) n i=1, a LOO complement set D - (xi), yi is constructed to serve as the context for prediction This complement set is mapped by an embedding network h1(·) into a sequence of context features c1,. p. 2.., ci−1, ci+1,..., cn Simultaneously, the current calibration input xi and the test input xn+1 are encoded by another embedding network h2(·) into query features qi and qn+1, respectively Subsequently, these features are concatenated into a unified input sequence [c1,. p. 2.., ci−1, ci+1,..., cn, qi, qn+1], which is then fed into a Transformer model with cascaded encoder layers By performing n such forward inferences in parallel, the prediction results pˆ(−i)(·xi) n i=1 and pˆ(−i)(·xn+1) n i=1 can be efficiently obtained for all LOO complement sets

Performance Analysis

The results show that the CP-based methods satisfy the prescribed coverage targets by adaptively adjusting the size of the candidate sets, whereas ICL+Top-L provides only fixed coverage Notably, the proposed ICL+CVCP constructs significantly more compact candidate sets than E-ICL+SCP and ICL+SCP, owing to its more efficient utilization of limited data For example, at 1 − α = 0.90, ICL+CVCP reduces the average candidate set size by 11. p. 342% and 8.84% compared to ICL+SCP and E-ICL+SCP, respectively Importantly, its performance closely approaches that of the computationally intensive ICL+FCP baseline, incurring only a marginal 1. p. 320% increase in set size while avoiding the associated exhaustive computation

Efficiency Gains

The proposed ICL+CVCP demonstrates a clear efficiency advantage over ICL+FCP CVCP avoids the exhaustive enumeration of all candidate labels required by FCP, reducing the number of evaluations from Yr(2n + 2) to K(n + r) Furthermore, ICL+CVCP naturally leverages the Key-Value (KV) Cache mechanism of large language models Since the LOO context features [c1,..., ci−1, ci+1,..., cn] and query qi remain fixed across different new test samples xn+1, their corresponding KV pairs are computed only once Reusing these cached representations eliminates redundant forward passes, drastically reducing computational overhead without compromising accuracy

Conclusion

In this paper, we have presented ICL+CVCP, an efficient location-aided beam selection framework for EAI systems in mmWave networks To address data scarcity and localization errors, the proposed framework leverages ICL for rapid, training-free adaptation from few-shot demonstrations for beam prediction By integrating CVCP, the framework transforms unreliable point predictions into compact candidate sets with rigorous, distribution-free reliability guarantees Comprehensive evaluations confirm that ICL+CVCP consistently satisfies userdefined coverage requirement and achieve high optimal beam hit rates, while producing significantly tighter candidate sets than existing baselines Moreover, the proposed framework substantially reduces both pilot probing overhead and computational complexity Overall, ICL+CVCP offers a robust beam selection solution, making it well-suited for dynamic and resource-constrained EAI applications

References

[1] A. Cangelosi, J. p. 5 Bongard, M. p. 5 H. Fischer, and S. p. 5 Nolfi, “Embodied intelligence,” in Springer handbook of computational intelligence, 2015, pp. p. 5 697–714

[2] Z. Li et al., “Large model enabled embodied intelligence for 6G integrated perception, communication, and computation network,” arXiv preprint arXiv:2512. p. 515109, 2025

[3] M. Li, C. Liu, S. V. Hanly, I. B. Collings, and P. p. 5 Whiting, “Explore and eliminate: Optimized two-stage search for millimeter-wave beam alignment,” IEEE Transactions on Wireless Communications, vol 18 no 9 pp 4379–4393, 2019

[4] C. Liu, M. Li, S. V. Hanly, P. Whiting, and I. p. 5 B. Collings, “Millimeterwave small cells: Base station discovery, beam alignment, and system design challenges,” IEEE Wireless Commun. p. 5, vol 25 no 4 pp 40–46, 2018

[5] R. Li, L. Zhao, M. Li, M.-M. Zhao, and D. p. 5 W. K. Ng, “Sensing-based channel estimation for extremely large-scale RIS-assisted millimeterwave communication systems,” IEEE Internet Things J. p. 5, vol 12 no 23 pp 50 732–50 746, 2025

[6] Y. Liu, M. Li, W. Deng, and M. p. 0-J. Zhao, “Adaptive position-aware near-field beam training for millimeter-wave XL-MIMO,” IEEE Internet Things J. p. 5, vol 12 no 18 pp 38 185–38 197, 2025

[7] H. Si, X. Guo, G. O. Boateng, and H. p. 5 Xia, “Cross-scenario foundation localization models: Architecture, key technologies, and challenges,” IEEE Wireless Commun. p. 5, pp 1–8, 2025

[8] J. Zhu, L. Zhao, J. Zhou, H. Cai, and F. p. 5 Xiao, “Do as the romans do: Location imitation-based edge task offloading for privacy protection,” IEEE Trans Mobile Comput. p. 5, 2024

[9] Y. Jian, S. Chen, Z. Zhang, and L. p. 5 Zhang, “Protecting receiver-location privacy in wireless sensor networks,” in Proc IEEE INFOCOM, 2007 pp 1955–1963

[10] D. J. Torrieri, “Statistical theory of passive location systems,” IEEE Trans Aerosp Electron Syst. p. 5, no 2 pp 183–198, 2007

[11] M. Alrabeiah and A. p. 5 Alkhateeb, “Deep learning for mmwave beam and blockage prediction using sub-6 GHz channels,” IEEE Trans Commun. p. 5, vol 68 no 9 pp 5504–5518, 2020

[12] K. Ma, S. Du, H. Zou, W. Tian, Z. Wang, and S. p. 5 Chen, “Deep learning assisted mmWave beam prediction for heterogeneous networks: A dualband fusion approach,” IEEE Trans Commun. p. 5, vol 71 no 1 pp 115–130, 2022

[13] A. K. Kuchibhotla, “Exchangeability, conformal prediction, and rank tests,” arXiv preprint arXiv:2005. p. 506095, 2020

[14] B. Wang, M. Zecchin, and O. p. 5 Simeone, “Mirror online conformal prediction with intermittent feedback,” IEEE Signal Process Lett. p. 5, vol 32 pp 2888–2892, 2025

[15] A. Angelopoulos, E. p. 5 Candes, and R. p. 5 J. Tibshirani, “Conformal PID control for time series prediction,” Adv Neural Inf Process Syst. p. 5, vol 36 pp 23 047–23 074, 2023

[16] Y. Zhang, S. Park, and O. p. 5 Simeone, “Bayesian optimization with formal safety guarantees via online conformal prediction,” IEEE J Sel Topics Signal Process. p. 5, vol 19 no 1 pp 45–59, 2025

[17] G. Zhang, Y. Cai, G. Yu, and O. Simeone, “Prediction-powered risk monitoring of deployed models for detecting harmful distribution shifts,” arXiv preprint arXiv:2602. p. 502229, 2026

[18] K. M. Cohen, S. Park, O. Simeone, and S. p. 5 Shamai Shitz, “Calibrating AI models for wireless communications via conformal prediction,” IEEE Trans Mach Learn Commun Netw. p. 5, vol 1 pp 296–312, 2023

[19] W. Deng, B. Shi, M. Li, and O. Simeone, “SCAN-BEST: Sub-6GHzaided near-field beam selection with formal reliability guarantees,” IEEE Trans Cogn Commun Netw. p. 5, vol 12 pp 5506–5521, 2026

[20] J. Chen et al. p. 5, “Learning in-context learning for named entity recognition,” in Proc 61st Annu Meeting Assoc Comput Linguistics (ACL), 2023 pp 13 661–13 675

[21] Z. Huang, S. Rossi, R. Yuan, and T. p. 5 Hannagan, “From predictions to confidence intervals: An empirical study of conformal prediction methods for in-context learning,” arXiv preprint arXiv:2504. p. 515722, 2025

[22] W. Deng, S. Park, M. Li, and O. Simeone, “Optimizing in-context learning for efficient full conformal prediction,” IEEE Signal Process Lett. p. 5, vol 33 pp 311–315, 2026

[23] S. Sun, H. Yan, G. R. MacCartney, and T. p. 5 S Rappaport, “Millimeter wave small-scale spatial statistics in an urban microcell scenario,” in Proc IEEE Int Conf Commun (ICC), 2017 pp 1–7

[24] R. F. Barber, E. J. Candes, A. Ramdas, and R. p. 5 J Tibshirani, “Predictive inference with the jackknife+,” Ann Statist. p. 5, vol 49 no 1 pp 486–507, 2021

[25] S. M. Xie, A. Raghunathan, P. p. 5 Liang, and T. p. 5 Ma, “An explanation of in-context learning as implicit bayesian inference,” arXiv preprint arXiv:2111. p. 502080, 2021

[26] N. Wies, Y. Levine, and A. p. 5 Shashua, “The learnability of in-context learning,” Adv Neural Inf Process Syst. p. 5, vol 36 pp 36 637–36 651, 2023

[27] L. Fang, Y. Wang, K. Gatmiry, L. p. 5 Fang, and Y. p. 5 Wang, “Rethinking invariance in in-context learning,” arXiv preprint arXiv:2505. p. 504994, 2025

[28] S. Jaeckel, L. p. 5 Raschkowski, K. p. 5 Borner, and L. p. 5 Thiele, “QuaDRiGa: A ¨ 3-D multi-cell channel model with time evolution for enabling virtual field trials,” IEEE Trans Antennas Propag. p. 5, vol 62 no 6 pp 3242–3256, 2014

[29] PyTorch Contributors, “Cosineannealinglr — pytorch 2.8 documentation,” https://docs. p. 5pytorch.org/docs/2. p. 58/generated/torch. p. 5optim.lr scheduler

[30] T. Brown et al. p. 5, “Language models are few-shot learners,” Adv Neural Inf Process Syst. p. 5, vol 33 pp 1877–1901, 2020

[31] D. Stutz et al. p. 5, “Learning optimal conformal classifiers,” arXiv preprint arXiv:2110. p. 5

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. ICL+CVCP allows for effective operation with only a small number of demonstration samples and eliminates the need for large-scale data collection and model fine-tuning by utilizing the training-free adaptation capability of In-Context Learning (ICL).

  2. The system can construct compact, distribution-free candidate beam sets that provably contain the optimal beam with a user defined probability, satisfying target coverage requirements while significantly reducing pilot probing overhead.

  3. The proposed framework provides a robust and low latency solution for beam selection in dynamic EAI systems by combining ICL's rapid adaptation with CVCP's rigorous reliability guarantees, ensuring the optimal beam is included with a user defined probability.

  4. The system can achieve pilot overhead comparable to that of ICL+FCP while reducing overhead by 11.50% and 8.84% relative to ICL+SCP and E-ICL+SCP when targeting high coverage levels like 0.90, demonstrating superior trade-offs between accuracy and efficiency.

  5. The system can perform limited pilot measurements over the candidate set Γα(x) if it contains multiple indices, determining the final downlink beam by maximizing the received signal gain, or directly select a beam if Γα(x) contains exactly one index.

  6. The framework can operate under extreme data scarcity and localization errors by leveraging GPS coordinates as prior spatial information and using ICL to rapidly adapt to new environments using minimal data, overcoming the limitations of traditional methods in this regime.

Sources

Related papers