Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Xu, Mengchu, Zhang, Yuxuan, Wang, Jian
Formato:	Preprint
Publicado:	2025
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Subspace Phase Retrieval
por: Xu, Mengchu, et al.
Publicado: (2022)

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

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

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

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

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

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

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

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

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

The Broader Landscape of Robustness in Algorithmic Statistics
por: Kamath, Gautam
Publicado: (2024)

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

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

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

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

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

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

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

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

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

Signal Recovery on Algebraic Varieties Using Linear Samples
por: Xu, Zhiqiang
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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