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

推荐订阅源

B
Blog RSS Feed
量子位
Recent Announcements
Recent Announcements
T
The Blog of Author Tim Ferriss
美团技术团队
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Blog — PlanetScale
Blog — PlanetScale
H
Help Net Security
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - Franky
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
宝玉的分享
宝玉的分享
大猫的无限游戏
大猫的无限游戏
V
Visual Studio Blog
博客园 - 聂微东
aimingoo的专栏
aimingoo的专栏
Microsoft Security Blog
Microsoft Security Blog
U
Unit 42
J
Java Code Geeks
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
IT之家
IT之家
Hugging Face - Blog
Hugging Face - Blog
腾讯CDC
L
LangChain Blog

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
Spatially Robust Near-Field SWIPT Using Pinching Antennas...
[Submitted on 18 Jun 2026] · 2026-06-19 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Pinching Waveguide Antennas (PWAs) offer significant potential for simultaneous wireless information and power transfer (SWIPT) by enabling precise near-field energy focusing. However, existing optimization frameworks are largely point-based (targeting a single coordinate for maximum gain), and thus highly sensitive to positioning errors and mobility, as near-field signals fluctuate significantly even over small spatial displacements. In this paper, we propose a spatially robust design framework based on discrete antenna selection optimized for service area (SA) coverage. Unlike point-based approaches, our model guarantees quality of service within predefined SAs for both information decoding (ID) and energy harvesting (EH) receivers, thereby improving robustness to user displacements. We formulate the problem as a non-convex binary quadratic program aimed at maximizing harvested energy within the EH SA subject to robust rate constraints in the ID SA. To characterize fundamental performance limits, we develop a semidefinite relaxation (SDR) framework that provides an upper bound on the achievable rate-energy (R-E) region. For the lower bound, we employ a low-complexity swap-based local search algorithm enforcing binary hardware constraints. Numerical results demonstrate that the proposed coverage-oriented design yields a robust R-E tradeoff and maintains stable performance across service regions, highlighting the advantages of discrete antenna activation over point-based near-field optimization approaches.

Submission history

From: Zoran Hadzi-Velkov [view email]
[v1] Thu, 18 Jun 2026 11:55:53 UTC (30 KB)