arXiv (All)
open access
On the Role of Normalization in Binary Iterative Hard Thresholding for 1-bit Compressed Sensing
Binary Iterative Hard Thresholding (BIHT) is a simple, yet effective, greedy method for recovering a sparse vector from one-bit sign measurements. In its original form, BIHT performs a ``gradient-descent'' step, followed by hard thresholding. A convergence analysis of this algorithm was left open in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Classifying Approximation Algorithms: Understanding the APX Complexity Class#1402868
- Smooth Hard-Thresholding for Singular Values with Stein's Unbiased Risk Estimate#1357186
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
- Euclidean SVP is deterministically NP-hard to approximate within any constant factor#997529
- Stronger Hardness for Submodular Maximization Subject to a Matroid Constraint#1216762
Record · ID 1399921
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive