Optimal sparse phase retrieval via a quasi-Bayesian approach

DOI10.1007/S11222-025-10779-4MaRDI QIDQ6879403zbMATH OpenFDO

Authors The Tien Mai

Publication date 30 December 2025

Published in Statistics and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11222-025-10779-4

zbMATH Keywords

contraction ratesLangevin Monte Carlominimax-optimal ratephase retrievalProbably Approximately Correct (PAC)-Bayes boundssparsity

Mathematics Subject Classification ID

Minimax procedures in statistical decision theory (62C20) Bayesian inference (62F15)

Cites work

• A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution
• A geometric analysis of phase retrieval
• A reduced-rank approach to predicting multiple binary responses through machine learning
• Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
• Compressive Phase Retrieval via Generalized Approximate Message Passing
• Compressive Phase Retrieval via Reweighted Amplitude Flow
• Concentration inequalities. A nonasymptotic theory of independence
• Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
• GESPAR: Efficient Phase Retrieval of Sparse Signals
• High-dimensional Bayesian inference via the unadjusted Langevin algorithm
• High-dimensional sparse classification using exponential weighting with empirical hinge loss
• scientific article; zbMATH DE number 5544465 (Why is no real title available?)
• scientific article; zbMATH DE number 7272386 (Why is no real title available?)
• Langevin diffusions and Metropolis-Hastings algorithms
• Lasso meets horseshoe: a survey
• Minimax rate of convergence and the performance of empirical risk minimization in phase recovery
• Mirror averaging with sparsity priors
• Misclassification bounds for PAC-Bayesian sparse deep learning
• Nearly minimax-optimal rates for noisy sparse phase retrieval via early-stopped mirror descent
• Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
• Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
• Optimal Scaling of Discrete Approximations to Langevin Diffusions
• PAC-Bayesian bounds for sparse regression estimation with exponential weights
• PAC-Bayesian estimation and prediction in sparse additive models
• PAC-Bayesian risk bounds for group-analysis sparse regression by exponential weighting
• Phase Retrieval Using Alternating Minimization
• Phase retrieval via sparse Wirtinger flow
• Phase retrieval via Wirtinger flow: theory and algorithms
• Phase retrieval: stability and recovery guarantees
• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Sparse Phase Retrieval via Truncated Amplitude Flow
• Sparse regression learning by aggregation and Langevin Monte-Carlo
• Sparsity information and regularization in the horseshoe and other shrinkage priors
• Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001.
• Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
• User-friendly Introduction to PAC-Bayes Bounds
• Variable selection using shrinkage priors

Cited in

(1)

• Kullback-Leibler excess risk bounds for exponential weighted aggregation in generalized linear models

This page was built for publication: Optimal sparse phase retrieval via a quasi-Bayesian approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879403)