Search arXiv⌕ Search

arXiv · 2610.30911

Energy-Efficient Risk-Constrained Adaptive Semantic Communications Under Uncertain Adversarial Threats

Abstract

Semantic communication systems based on deep joint source-channel coding can provide task-oriented wireless transmission, but adversarial robustness may require substantial radio and receiver-side defensive-computation energy. This paper develops an energy-efficient, risk-constrained semantic communication framework under source-domain, over-the-air (OTA), and potentially composite adversarial conditions. Long-term total energy, including communication and diffusion-purification energy, is minimized subject to average semantic-loss, trajectory-level tail-risk, and end-to-end latency constraints. A recurrent primal-dual proximal policy optimization controller jointly adapts transmit power, semantic/channel bandwidth ratio, and purification complexity using causal channel observations, semantic confidence, imperfect attack-belief estimates, and recurrent history. A conditional value-at-risk (CVaR) constraint explicitly limits severe semantic failures. On CIFAR-100, at the unseen source-domain level $ε=12/255$, the proposed controller achieves approximately $61\%$ robust Top-1 accuracy with $\mathrm{CVaR}_{0.9}\approx0.36$ while using about $9\%$ less total energy than diffusion-only defense. At the unseen OTA level $Γ_A=-5$ dB, it achieves approximately $52\%$ robust Top-1 accuracy, reduces semantic tail risk by $40\%$, and consumes about $8\%$ less total energy than diffusion-only defense. These results demonstrate energy-efficient semantic defense under partially observable adversarial conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maedeh Fallahreyhani, Paeiz Azmi, Nader Mokari, M. Reza Abedi. 2026-10-22. Energy-Efficient Risk-Constrained Adaptive Semantic Communications Under Uncertain Adversarial Threats. https://arxiv.org/abs/2610.30911

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Task-Based Evaluation of Raw Radar Data Compression: A Pre-Registered Study of Where Classical Codecs Fail to Preserve Target Detection, and Why

Synthetic aperture radar (SAR) systems collect raw I/Q echo data at rates that exceed downlink capacity; fielded systems compress onboard with block-adaptive quantization (BAQ/FDBAQ). Proposed replacements, including learned compression, are evaluated with image-quality metrics (PSNR, SSIM, SQNR); none measures whether the data still supports its operational use. We introduce a task-based evaluation methodology for raw radar compression, with a published pre-registration trail: codecs are scored after SAR focusing against a two-sided criterion -- a CFAR detection-retention floor and a spurious-detection budget at matched threshold -- using frozen task models trained once on uncompressed data. On Sentinel-1 stripmap Level-0 data the evaluation brackets the fielded FDBAQ operating point at the resolution of the BAQ grid (3-bit BAQ sustains utility at 6.12 bits per complex sample; 2-bit does not), with a reported lattice artifact found to change retention by at most 0.004. Under the final plane-mapping rule no classical configuration sustains utility below 4.86 bits per complex sample on this scene. Energy concentration after focusing delivers the predicted retention gain (0.888 vs 0.691 at 2 bits) but converts it into target-adjacent false alarms for wavelet and block-transform codecs alike: a retention-only rule certifies focused-domain JPEG2000 at 4 bits while it produces 2.5 times the tolerable spurious count. On AFRL Gotcha GMTI data (airborne, never compressed onboard) the frontier is bracketed at 7.4-8.0 bits per complex sample and the same trade reappears; on an Umbra spotlight image JPEG2000 passes the retention floor at 2, 1, and 0.5 bits while producing 10-14 times the spurious budget. We report the full pre-registration trail, including the chronology of the criterion's two clauses, one retracted overclaim, and a bounded negative result for a small learned codec.

eess.SP↗

Pinching Antenna Systems (PASS): Principles, Positioning and Opportunities

Pinching-antenna systems (PASS) have garnered significant attention owing to their ability to enhance the capacity and coverage of wireless networks by guiding electromagnetic waves through waveguides before radiation. As such, PASS are regarded as promising enabling technologies for sixth-generation (6G) communication networks. In this paper, we present a comprehensive survey of the state of the art in PASS, covering operating principles, positioning methodologies, performance evaluation, resource allocation, and the application of artificial intelligence (AI) to PASS-enhanced wireless networks. We first introduce the fundamental principles of PASS from both materials and physics perspectives. Building on this foundation, we present positioning methodologies for both the user side and the base station side. We then evaluate the communication performance of PASS in both uplink and downlink scenarios under different blockage models. Furthermore, we systematically review existing designs for PASS-enhanced wireless networks from a performance optimization perspective. Finally, we survey research efforts that leverage AI to address challenges in dynamic and complex scenarios.

eess.SP↗

QoE-Driven Hybrid Resource Allocation for Multi-User OFDMA Semantic Communications

In this paper, we develop a quality-of-experience (QoE)-driven hybrid resource allocation framework for multi-user downlink orthogonal frequency-division multiple access semantic communication systems, where the hybrid framework jointly handles continuous and discrete decision variables. Specifically, we formulate a mixed continuous-discrete optimization problem to jointly optimize transmit power, subcarrier allocation, and semantic decisions under coupled power and spectrum constraints. To better characterize semantic service quality, we propose a preference-inverse multiplicative exponential QoE that is bounded and non-compensatory, capturing the intrinsic ``both-required'' property of semantic rate and similarity. To solve the optimization problem, we develop a projection-based multi-agent deep deterministic policy gradient framework that enforces feasibility for continuous and discrete actions. Furthermore, we integrate Gumbel-softmax relaxation with an adaptive performance-driven temperature annealing scheme to enhance the learning of discrete semantic decisions. Simulation results demonstrate that our proposed framework achieves superior convergence, greater stability, and higher QoE compared to the conventional QoE design and penalty-based or fixed-temperature baselines, highlighting the benefits of our QoE design and the effectiveness of hybrid decision learning in semantic communications.

eess.SP↗