:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Xu, Mengchu, Zhang, Yuxuan, Wang, Jian
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2503.01335
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Subspace Phase Retrieval
by: Xu, Mengchu, et al.
Published: (2022)

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

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

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

The Broader Landscape of Robustness in Algorithmic Statistics
by: Kamath, Gautam
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Signal Recovery on Algebraic Varieties Using Linear Samples
by: Xu, Zhiqiang
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

Exact Minimax Optimality of Spectral Methods in Phase Synchronization and Orthogonal Group Synchronization
by: Zhang, Anderson Ye
Published: (2022)

Recovery Performance of PhaseLift for Phase Retrieval from Coded Diffraction Patterns
by: Huang, Meng, et al.
Published: (2025)

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

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