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

推荐订阅源

人人都是产品经理
人人都是产品经理
量子位
月光博客
月光博客
罗磊的独立博客
宝玉的分享
宝玉的分享
博客园_首页
酷 壳 – CoolShell
酷 壳 – CoolShell
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
WordPress大学
WordPress大学
博客园 - 叶小钗
博客园 - 聂微东
阮一峰的网络日志
阮一峰的网络日志
V
V2EX
雷峰网
雷峰网
博客园 - 三生石上(FineUI控件)
Jina AI
Jina AI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - Franky
美团技术团队
爱范儿
爱范儿
V
Visual Studio Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Y
Y Combinator Blog

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
MIMO Over-the-Air Computation for High-Mobility Multi-Mod...
Guangxu Zhu, Kaibin Huang · 2018-03-30 · via cs.IT updates on arXiv.org

In future Internet-of-Things networks, sensors or even access points can be mounted on ground/aerial vehicles for smart-city surveillance or environment monitoring. To support the high-mobility sensing with low network latency, a technique called over-the-air-computation (AirComp) was recently developed which enables an access-point to receive a desired function of sensing-data from concurrent-transmissions by exploiting the superposition property of a multi-access-channel. This work aims at further developing AirComp for next-generation multi-antenna multi-modal sensor networks. Specifically, we design beamforming and channel-feedback techniques for multi-function AirComp. Given the objective of minimizing sum-mean-squared-error of computed functions, the optimization of receive-beamforming for multi-function AirComp is a NP-hard problem. The approximate problem based on tightening transmission-power constraints, however, is shown to be solvable using differential-geometry. The solution is proved to be the weighted-centroid of points on a Grassmann-manifold, where each point represents the subspace spanned by the channel matrix of a sensor. As a by-product, the beamforming problem is found to have the same form as the classic problem of multicast-beamforming, establishing the AirComp-multicasting-duality. Its significance lies in making the said Grassmannian-centroid solution transferable to the latter problem which otherwise is solved using the computation-intensive semidefinite-relaxation-technique. Last, building on the AirComp-beamforming solution, an efficient channel-feedback technique is designed for an access-point to receive the beamformer from distributed sensor transmissions of designed signals that are functions of local channel-state-information.