惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

腾讯CDC
The Cloudflare Blog
IT之家
IT之家
V
V2EX
雷峰网
雷峰网
MyScale Blog
MyScale Blog
P
Proofpoint News Feed
Stack Overflow Blog
Stack Overflow Blog
博客园 - Franky
Engineering at Meta
Engineering at Meta
S
SegmentFault 最新的问题
GbyAI
GbyAI
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - 司徒正美
云风的 BLOG
云风的 BLOG
小众软件
小众软件
博客园 - 叶小钗
Blog — PlanetScale
Blog — PlanetScale
C
Check Point Blog
A
About on SuperTechFans
B
Blog
月光博客
月光博客
宝玉的分享
宝玉的分享
Last Week in AI
Last Week in AI

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Reinforcement Learning-Based Secure Beamforming Against S...
[Submitted on 19 Jun 2026] · 2026-06-23 · via math updates on arXiv.org

Authors:Juhwan Seo (Samsung Electronics, South Korea), Hyesang Cho (Inha University, South Korea), Dong-Hyun Jung (Soongsil University, South Korea)

View PDF HTML (experimental)

Abstract:This paper investigates physical-layer security for uplink low Earth orbit (LEO) satellite communications in the presence of multiple non-colluding satellite eavesdroppers. Secure beamforming design in such systems is challenging due to time-varying orbital geometry and probabilistic fading-induced outage constraints. To address this, we first derive tractable closed-form expressions for both connection and secrecy outage probabilities under Nakagami-m fading, and develop differentiable upper-bound cost functions that are amenable to optimization. Next, to exploit the predictable orbital dynamics and temporal correlation of satellite mobility, we reformulate the non-convex secrecy rate maximization problem as a constrained Markov decision process. We then develop a primal-dual soft actor-critic algorithm with a multi-head cost critic that jointly optimizes beamforming while enforcing average outage constraints via Lagrangian relaxation. Numerical results show that the proposed framework improves the ergodic secrecy rate over maximum ratio transmission across all eavesdropper configurations, and outperforms zero-forcing in dense eavesdropping regimes. It achieves within 7 percent of an offline successive convex approximation benchmark while requiring only a single forward pass, enabling low-complexity real-time operation. These results indicate that the proposed approach is applicable to secure beamforming in dynamic LEO satellite environments.

Submission history

From: Juhwan Seo [view email]
[v1] Fri, 19 Jun 2026 01:25:44 UTC (1,547 KB)