Copertina

Achieving Optimal Sample Complexity for a Broader Class of Signals in Sparse Phase Retrieval

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Xu, Mengchu, Zhang, Yuxuan, Wang, Jian
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Information Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Sparse Principal Component Analysis with Energy Profile Dependent Sample Complexity
di: Xu, Mengchu, et al.
Pubblicazione: (2025)

Subspace Phase Retrieval
di: Xu, Mengchu, et al.
Pubblicazione: (2022)

Beyond the Flat-Spike: Adaptive Sparse CCA for Decaying and Unbalanced Signals
di: Xu, Mengchu, et al.
Pubblicazione: (2026)

A Fast and Provable Algorithm for Sparse Phase Retrieval
di: Cai, Jian-Feng, et al.
Pubblicazione: (2023)

Optimal Frames for Phase Retrieval from Edge Vectors of Optimal Polygons
di: Xu, Zhiqiang, et al.
Pubblicazione: (2025)

One-Bit Phase Retrieval: Optimal Rates and Efficient Algorithms
di: Chen, Junren, et al.
Pubblicazione: (2024)

Stable Phase Retrieval: Optimal Rates in Poisson and Heavy-tailed Models
di: Huang, Gao, et al.
Pubblicazione: (2025)

Channel Estimation for Rydberg Atomic Quantum Receivers: Unrolled Phase Retrieval from Holographic Snapshots
di: Xiao, Jian, et al.
Pubblicazione: (2025)

Stability in Phase Retrieval: Characterizing Condition Numbers and the Optimal Vector Set
di: Xia, Yu, et al.
Pubblicazione: (2024)

The Local Landscape of Phase Retrieval Under Limited Samples
di: Liu, Kaizhao, et al.
Pubblicazione: (2023)

Geno-Weaving: Low-Complexity Capacity-Achieving DNA Storage
di: Wang, Hsin-Po, et al.
Pubblicazione: (2024)

The Broader Landscape of Robustness in Algorithmic Statistics
di: Kamath, Gautam
Pubblicazione: (2024)

Sparse Regression Codes for Secret Key Agreement: Achieving Strong Secrecy and Near-Optimal Rates for Gaussian Sources
di: Athanasakos, Emmanouil M., et al.
Pubblicazione: (2025)

New Bounds on Quantum Sample Complexity of Measurement Classes
di: Heidari, Mohsen, et al.
Pubblicazione: (2024)

Sparse Phase Retrieval with Redundant Dictionary via $\ell_q (0<q\le 1)$-Analysis Model
di: Huo, Haiye, et al.
Pubblicazione: (2025)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
di: Lau, Ivan, et al.
Pubblicazione: (2025)

Sparse Signal Recovery from Random Measurements
di: Wong, Man Ting, et al.
Pubblicazione: (2026)

Sparse Superposition Codes with Binomial Dictionary are Capacity-Achieving with Maximum Likelihood Decoding
di: Takeishi, Yoshinari, et al.
Pubblicazione: (2025)

Capacity-Region-Achieving Sparse Regression Codes for MIMO Multiple-Access Channels
di: Yan, Hao, et al.
Pubblicazione: (2026)

Sub-Nyquist Sampling for Reaching Theoretical Minimal Sampling Rate Boundary
di: Xiao, Dong, et al.
Pubblicazione: (2026)

Order-Optimal Sample Complexity of Rectified Flows
di: Sahoo, Hari Krishna, et al.
Pubblicazione: (2026)

Signal Recovery on Algebraic Varieties Using Linear Samples
di: Xu, Zhiqiang
Pubblicazione: (2025)

Low Complexity Regularized Phase Retrieval
di: Godeme, Jean-Jacques, et al.
Pubblicazione: (2024)

Sampling to Achieve the Goal: An Age-aware Remote Markov Decision Process
di: Li, Aimin, et al.
Pubblicazione: (2024)

Necessary and Sufficient Conditions for Capacity-Achieving Private Information Retrieval with Adversarial Servers
di: Miki, Atsushi, et al.
Pubblicazione: (2025)

On A Class of Greedy Sparse Recovery Algorithms
di: Li, Gang, et al.
Pubblicazione: (2024)

Age Optimal Sampling for Unreliable Channels under Unknown Channel Statistics
di: He, Hongyi, et al.
Pubblicazione: (2024)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
di: Li, Gen, et al.
Pubblicazione: (2021)

An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes
di: Abreu, Zita, et al.
Pubblicazione: (2024)

Low-Complexity Channel Estimation for Internet of Vehicles AFDM Communications With Sparse Bayesian Learning
di: Li, Xiangxiang, et al.
Pubblicazione: (2025)

Optimizing Leaky Private Information Retrieval Codes to Achieve ${O}(\log K)$ Leakage Ratio Exponent
di: Zhao, Wenyuan, et al.
Pubblicazione: (2025)

Sparse Signal Recovery From Quadratic Systems with Full-Rank Matrices
di: Wen, Jinming, et al.
Pubblicazione: (2025)

Sparse Signal Recovery using Log-Sum Regularization and Adaptive Smoothing
di: Morita, Keisuke, et al.
Pubblicazione: (2026)

The Sample Complexity of Lossless Data Compression
di: Viaud, Terence, et al.
Pubblicazione: (2026)

Span-Based Optimal Sample Complexity for Average Reward MDPs
di: Zurek, Matthew, et al.
Pubblicazione: (2023)

A Low-Complexity Scheme for Multi-Message Private Information Retrieval
di: Wang, Ningze, et al.
Pubblicazione: (2025)

Necessary and Sufficient Conditions for Capacity-Achieving Private Information Retrieval with Non-Colluding and Colluding Servers
di: Miki, Atsushi, et al.
Pubblicazione: (2024)

Trajectory Optimization for Cellular-Connected UAV in Complex Environment with Partial CKM
di: Song, Yuxuan, et al.
Pubblicazione: (2025)

Optimal Binary Signaling for a Two Sensor Gaussian MAC Network
di: Sardellitti, Luca, et al.
Pubblicazione: (2024)

Reconstructing Graph Signals from Noisy Dynamical Samples
di: Aldroubi, Akram, et al.
Pubblicazione: (2024)