# Sparse Recovery with Oversampling Ratio Greater than One Half

## TL;DR

This paper demonstrates the theoretical feasibility of sparse recovery with an oversampling ratio greater than one half and introduces two modified algorithms to achieve such performance.

## Contribution

It presents the first theoretical proof and practical algorithms for sparse recovery when the oversampling ratio exceeds one half.

## Key findings

- Theoretical proof of recovery feasibility beyond half oversampling ratio.
- Two modified HTP algorithms capable of high oversampling recovery.
- Empirical validation of the proposed algorithms' effectiveness.

## Abstract

Solving sparse recovery problem with high oversampling ratio is hard. We show that it is theoretically possible and we propose two modified HTP algorithms with such performances.