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

推荐订阅源

OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - Franky
T
Tailwind CSS Blog
Microsoft Azure Blog
Microsoft Azure Blog
The Cloudflare Blog
博客园 - 叶小钗
N
Netflix TechBlog - Medium
罗磊的独立博客
量子位
MyScale Blog
MyScale Blog
A
About on SuperTechFans
Blog — PlanetScale
Blog — PlanetScale
V
Visual Studio Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
GbyAI
GbyAI
B
Blog
腾讯CDC
爱范儿
爱范儿
Recent Announcements
Recent Announcements
有赞技术团队
有赞技术团队
F
Fortinet All Blogs
雷峰网
雷峰网
G
Google Developers Blog
Google DeepMind News
Google DeepMind News

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
Phase retrieval from the norms of affine transformations
Meng Huang, Zhiqiang Xu · 2018-05-21 · via cs.IT updates on arXiv.org

In this paper, we consider the generalized phase retrieval from affine measurements. This problem aims to recover signals ${\mathbf x} \in {\mathbb F}^d$ from the affine measurements $y_j=\norm{M_j^*\vx +{\mathbb b}_j}^2,\; j=1,\ldots,m,$ where $M_j \in {\mathbb F}^{d\times r}, {\mathbf b}_j\in {\mathbb F}^{r}, {\mathbb F}\in \{{\mathbb R},{\mathbb C}\}$ and we call it as {\em generalized affine phase retrieval}. We develop a framework for generalized affine phase retrieval with presenting necessary and sufficient conditions for $\{(M_j,{\mathbf b}_j)\}_{j=1}^m$ having generalized affine phase retrieval property. We also establish results on minimal measurement number for generalized affine phase retrieval. Particularly, we show if $\{(M_j,{\mathbf b}_j)\}_{j=1}^m \subset {\mathbb F}^{d\times r}\times {\mathbb F}^{r}$ has generalized affine phase retrieval property, then $m\geq d+\floor{d/r}$ for ${\mathbb F}={\mathbb R}$ ($m\geq 2d+\floor{d/r}$ for ${\mathbb F}={\mathbb C}$ ). We also show that the bound is tight provided $r\mid d$. These results imply that one can reduce the measurement number by raising $r$, i.e. the rank of $M_j$. This highlights a notable difference between generalized affine phase retrieval and generalized phase retrieval. Furthermore, using tools of algebraic geometry, we show that $m\geq 2d$ (resp. $m\geq 4d-1$) generic measurements ${\mathcal A}=\{(M_j,b_j)\}_{j=1}^m$ have the generalized phase retrieval property for ${\mathbb F}={\mathbb R}$ (resp. ${\mathbb F}={\mathbb C}$).