The current source text is the original text and can be switched to the Chinese translation.
SaveShare
Overview
arXiv:2508.06243v3 Announce Type: replace-cross Abstract: The increasing demand for connected vehicular services poses significant challenges for AI-based network and service management due to the high volume and rapid variability of network state information. Traditional management and control mechanisms struggle to scale when processing fine-grained metrics such as Channel Quality Indicators (CQIs) in dynamic vehicular environments. To address this challenge, we propose SCAR (State-Space Compression for AI-Based Radio Resource Management), an edge-assisted framework that abstracts high-dimensional CQI information into compact representations for AI-based management. SCAR employs machine-learning (ML)-based compression techniques, including clustering and radial basis function (RBF) networks, to reduce the dimensionality of CQI-derived state information while preserving essential features relevant to management decisions. The resulting compressed states are used to train reinforcement learning (RL)-based management policies that dynamically adapt the throughput-fairness trade-off according to service-level fairness objectives defined by the NGMN. Simulation results show that CQI compression improves average NGMN feasible-region occupancy from 56.32% to 88.07% across ten RL algorithms, reaching 97.76% for the best-performing RL configuration, with limited throughput degradation and competitive computational overhead. Furthermore, simulated annealing with stochastic tunneling (SAST)-based clustering reduces state compression distortion by approximately 10% compared with conventional K-means clustering. These results demonstrate SCAR's ability to provide compact state representations for RL-based network and service management while improving service-level fairness in dynamic vehicular systems.
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .
READ THE ORIGINAL
Read the original for the full context.
The content of this article comes from arXiv cs.NE,Copyright belongs to the original author and publisher.
arXiv:2611.23410v1 Announce Type: new Abstract: While multimodal language models can interpret diagrams and generate structured outputs, their capacity to connect passive radio-frequency (RF) design intent, layout geometry, and electromagnetic behavior remains largely untested. To address this gap, we introduce RFBench, a simulator-grounded dataset and benchmark for passive RF layout design and understanding.
arXiv:2611.25011v1 Announce Type: new Abstract: The sample compression conjecture is a longstanding open problem in learning theory, originating in the work of Littlestone and Warmuth in the 1980s. At its heart is a connection between simplification and generalization: if a predictor consistent with a training sample is defined using only a small part of that sample, then it is likely to generalize.
arXiv:2611.23365v1 Announce Type: new Abstract: Language models increasingly exhibit behaviors that are difficult to detect in transcripts, such as reward hacking, deception, and sycophancy. Asking the assistant follow-up questions about its actions is unreliable, since models are generally not trained to report their own misbehavior. As a result, approaches to oversight typically involve querying external models.
Loading comments…