Cover Image

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Matsumoto, Namiko, Mazumdar, Arya
Format:	Preprint
Published:	2022
Subjects:	Information Theory Data Structures and Algorithms Signal Processing Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
by: Matsumoto, Namiko, et al.
Published: (2025)

Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
by: Li, Xiaxin, et al.
Published: (2025)

Learning Partitions with Optimal Query and Round Complexities
by: Black, Hadley, et al.
Published: (2025)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
by: Black, Hadley, et al.
Published: (2025)

The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolution
by: Ding, Zhiyan, et al.
Published: (2024)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
by: Li, Xiaxin, et al.
Published: (2024)

Logarithmic Positional Partition Interval Encoding
by: Alevizos, Vasileios, et al.
Published: (2024)

Random Subgraph Detection Using Queries
by: Huleihel, Wasim, et al.
Published: (2021)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
by: Bruno, Roberto, et al.
Published: (2025)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
by: Ahmadypour, Niloufar, et al.
Published: (2020)

Satisfying the Restricted Isometry Property with the Optimal Number of Rows and Slightly Less Randomness
by: Rao, Shravas
Published: (2023)

Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph
by: Fernández-Menduiña, Samuel, et al.
Published: (2024)

Fast Compressed-Domain N-Point Discrete Fourier Transform: The "Twiddless" FFT Algorithm
by: Queiroz, Saulo
Published: (2025)

Hardness and Approximability of Dimension Reduction on the Probability Simplex
by: Bruno, Roberto
Published: (2024)

Sample-Optimal Private Regression in Polynomial Time
by: Anderson, Prashanti, et al.
Published: (2025)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
by: Bruno, Roberto, et al.
Published: (2024)

Pcodec: Better Compression for Numerical Sequences
by: Loncaric, Martin, et al.
Published: (2025)

Key Compression Limits for $k$-Minimum Value Sketches
by: Dickens, Charlie, et al.
Published: (2024)

Lower Bounds on Adaptive Sensing for Matrix Recovery
by: Kacham, Praneeth, et al.
Published: (2023)

Towards Optimal Grammars for RNA Structures
by: Onokpasa, Evarista, et al.
Published: (2024)

Robust Gray Codes Approaching the Optimal Rate
by: Con, Roni, et al.
Published: (2024)

Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
by: Guruswami, Venkatesan, et al.
Published: (2023)

Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
by: Afzali, Mohammad, et al.
Published: (2023)

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
by: Chakraborty, Diptarka, et al.
Published: (2026)

Optimal high-precision shadow estimation
by: Chen, Sitan, et al.
Published: (2024)

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
by: Linares, Deijany Rodriguez, et al.
Published: (2025)

Fast Computation of the Discrete Fourier Transform Square Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2024)

Fast Computation of the Discrete Fourier Transform Rectangular Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2025)

Budget Recycling Differential Privacy
by: Jiang, Bo, et al.
Published: (2024)

Optimal Differentially Private Sampling of Unbounded Gaussians
by: Iverson, Valentio, et al.
Published: (2025)

Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold
by: Gu, Yuzhou, et al.
Published: (2025)

The I/O Complexity of Attention, or How Optimal is Flash Attention?
by: Saha, Barna, et al.
Published: (2024)

SpecTr: Fast Speculative Decoding via Optimal Transport
by: Sun, Ziteng, et al.
Published: (2023)

New Algorithmic Directions in Optimal Transport and Applications for Product Spaces
by: Beigi, Salman, et al.
Published: (2025)

Learning DNF through Generalized Fourier Representations
by: Heidari, Mohsen, et al.
Published: (2025)

Testing with Non-identically Distributed Samples
by: Garg, Shivam, et al.
Published: (2023)

The SMART approach to instance-optimal online learning
by: Banerjee, Siddhartha, et al.
Published: (2024)

Subsampling Suffices for Adaptive Data Analysis
by: Blanc, Guy
Published: (2023)