# Sublinear- Time Algorithms for Compressive Phase Retrieval

@article{Li2018SublinearTA,
title={Sublinear- Time Algorithms for Compressive Phase Retrieval},
author={Yi Li and Vasileios Nakos},
journal={2018 IEEE International Symposium on Information Theory (ISIT)},
year={2018},
pages={2301-2305}
}
• Published 2018
• Computer Science, Mathematics
• 2018 IEEE International Symposium on Information Theory (ISIT)
• In the compressive phase retrieval problem, the goal is to reconstruct a sparse or approximately k-sparse vector $x\in \mathbb{R}^{n}$ given access to $y=\vert \Phi x\vert$, where $\vert v\vert$ denotes the vector obtained from taking the absolute value of $v\in \mathbb{R}^{n}$ coordinate-wise. In this paper we present sublinear-time algorithms for different variants of the compressive phase retrieval problem which are akin to the variants of the classical compressive sensing problem considered… CONTINUE READING
1

#### Citations

##### Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

## Improved Algorithms for Adaptive Compressed Sensing

• Mathematics, Computer Science
• ICALP
• 2018

## On the Information-Theoretic Limits of Noisy Sparse Phase Retrieval

• Computer Science
• 2019 IEEE Information Theory Workshop (ITW)
• 2019
VIEW 1 EXCERPT
CITES BACKGROUND

## Sparse Phase Retrieval via Truncated Amplitude Flow

• Computer Science, Mathematics
• IEEE Transactions on Signal Processing
• 2018

## Support Recovery in the Phase Retrieval Model: Information-Theoretic Fundamental Limits

• Mathematics, Computer Science, Engineering
• ArXiv
• 2019
VIEW 1 EXCERPT
CITES BACKGROUND

## Stronger L2/L2 compressed sensing; without iterating

• Computer Science, Mathematics
• STOC
• 2019

## Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time

• Computer Science, Mathematics
• ArXiv
• 2020

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 65 REFERENCES

## Fast Phase Retrieval from Local Correlation Measurements

• Mathematics, Computer Science
• SIAM J. Imaging Sciences
• 2016
VIEW 2 EXCERPTS

## A Geometric Analysis of Phase Retrieval

• Mathematics, Computer Science
• 2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
VIEW 1 EXCERPT

## Stable Signal Recovery from Phaseless Measurements

• Mathematics, Computer Science
• ArXiv
• 2015
VIEW 2 EXCERPTS

## On the Power of Adaptivity in Sparse Recovery

• Mathematics, Computer Science
• 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
• 2011
VIEW 1 EXCERPT

## (1 + eps)-Approximate Sparse Recovery

• Mathematics, Computer Science
• 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
• 2011

## Almost optimal phaseless compressed sensing with sublinear decoding time

• Vasileios Nakos
• Computer Science, Mathematics
• 2017 IEEE International Symposium on Information Theory (ISIT)
• 2017
VIEW 9 EXCERPTS

## PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming

• Mathematics, Computer Science
• ArXiv
• 2011
VIEW 1 EXCERPT

## PhaseMax: Convex Phase Retrieval via Basis Pursuit

• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2018
VIEW 1 EXCERPT

## Phase Retrieval via Wirtinger Flow: Theory and Algorithms

• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2015
VIEW 1 EXCERPT

## Improved Algorithms for Adaptive Compressed Sensing

• Mathematics, Computer Science
• ICALP
• 2018
VIEW 1 EXCERPT