Fundamental limits of weak recovery with applications to phase retrieval (Q2420637): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 12:51, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	Fundamental limits of weak recovery with applications to phase retrieval	scientific article

Statements

scholarly article

0 references

Fundamental limits of weak recovery with applications to phase retrieval (English)

0 references

0 references

Andrea Montanari

0 references

Foundations of Computational Mathematics

0 references

publication date

6 June 2019

0 references

full work available at URL

https://arxiv.org/abs/1708.05932

0 references

zbMATH Keywords

spectral initialization

0 references

phase transition

0 references

mutual information

0 references

second-moment method

0 references

phase retrieval

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

A flexible convex relaxation for phase retrieval

0 references

On sample eigenvalues in a generalized spiked population model

0 references

On signal reconstruction without phase

0 references

Saving phase: injectivity and stability for phase retrieval

0 references

Optimal errors and phase transitions in high-dimensional generalized linear models

0 references

Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation

0 references

Universality in polytope phase transitions and message passing algorithms

0 references

The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing

0 references

The LASSO Risk for Gaussian Matrices

0 references

Outliers in the spectrum of large deformed unitarily invariant models

0 references

The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices

0 references

Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow

0 references

Phase Retrieval via Matrix Completion

0 references

Phase retrieval from coded diffraction patterns

0 references

Phase Retrieval via Wirtinger Flow: Theory and Algorithms

0 references

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

0 references

The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences

0 references

Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems

0 references

An algebraic characterization of injectivity in phase retrieval

0 references

The Pauli problem, state reconstruction and quantum-real numbers

0 references

The Rotation of Eigenvectors by a Perturbation. III

0 references

Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time

0 references

Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing

0 references

The Noise-Sensitivity Phase Transition in Compressed Sensing

0 references

High dimensional robust M-estimation: asymptotic variance via approximate message passing

0 references

Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval

0 references

PhaseMax: Convex Phase Retrieval via Basis Pursuit

0 references

Low-rank matrix completion using alternating minimization

0 references

State evolution for general approximate message passing algorithms, with applications to spatial coupling

0 references

Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization

0 references

Matrix Completion From a Few Entries

0 references

Blind Recovery of Sparse Signals From Subsampled Convolution

0 references

Rapid, robust, and reliable blind deconvolution via nonconvex optimization

0 references

DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES

0 references

Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics

0 references

Estimation of low-rank matrices via approximate message passing

0 references

Belief propagation, robust reconstruction and optimal recovery of block models

0 references

Phase Retrieval Using Alternating Minimization

0 references

The Generalized Lasso With Non-Linear Observations

0 references

Recursive consistent estimation with bounded noise

0 references

Compressive Phase Retrieval via Generalized Approximate Message Passing

0 references

Spectral analysis of large dimensional random matrices

0 references

Analysis of the limiting spectral distribution of large dimensional random matrices

0 references

Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization

0 references

Free convolution and the random sum of matrices

0 references

SLOPE is adaptive to unknown sparsity and asymptotically minimax

0 references

Maximum likelihood estimation of liner signal parameters for Poisson processes

0 references

A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation

0 references

Limit laws for random matrices and free products

0 references

Phase recovery, MaxCut and complex semidefinite programming

0 references

Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow

0 references

Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study

0 references

Bits From Photons: Oversampled Image Acquisition Using Binary Poisson Statistics

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10208-018-9395-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2420637

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2420637&oldid=39070848"