Math 2.0

Resources / preprint

Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing SMC03CWP4R

URIm2://res/SMC03CWP4R
Kindpreprint
CreatorsJing Ma, Yujia Wu, Zhaoqiang Liu
Date2026-10-08
Subjectsarxiv cs.LG, arxiv cs.IT, arxiv math.IT
Scopeborder

Expressions

e1: version, preprint

Date2026-10-08
IdsarXiv 2610.11834

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Geodesic Wasserstein distancedefinitiondefinition 3arxiv
79GQJ43B4Fstatementlemma 1arxiv
Adaptedstatementlemma B.2arxiv
Expected Hamming distance between noisy and noiseless one-bit measurementsstatementlemma 3.2arxiv
One-bit probit conditional likelihooddefinitiondefinition 6arxiv
CH2ZFZQHA3statementlemma A.1arxiv
Mutual Information Boundstatementlemma 3.7arxiv
Variant of spherical Fano inequalitystatementlemma 3.8arxiv
FEQK6V9VRDstatementlemma A.2arxiv
Maximum row $\ell_2$ normdefinitiondefinition 5arxiv
Overall recovery upper bound for one-bit posterior sampling under a covering partitionstatementlemma 3.4arxiv
JMAZME4NF2statementlemma B.1arxiv
One-bit near--far test lemmastatementlemma 3.3arxiv
Information lower bound for one-bit compressed sensingstatementtheorem 3.6arxiv
R\'enyi stability under spherical $W_{\infty,\mathrm{geo}}$ mismatchstatementlemma 3.5arxiv
One-bit separation gapdefinitiondefinition 4arxiv
Signal and observation distancesdefinitiondefinition 1arxiv
$(\eta,\delta)$-approximate covering numberdefinitiondefinition 2arxiv
One-bit posterior sampling upper boundstatementtheorem 3.1arxiv

Catalogue records