Search Results - "Maleki, Arian"
-
1
A scalable estimate of the out‐of‐sample prediction error via approximate leave‐one‐out cross‐validation
Published in Journal of the Royal Statistical Society. Series B, Statistical methodology (01-09-2020)“…Summary The paper considers the problem of out‐of‐sample risk estimation under the high dimensional settings where standard techniques such as K‐fold…”
Get full text
Journal Article -
2
Message-passing algorithms for compressed sensing
Published in Proceedings of the National Academy of Sciences - PNAS (10-11-2009)“…Compressed sensing aims to undersample certain high-dimensional signals yet accurately reconstruct them by exploiting signal characteristics. Accurate…”
Get full text
Journal Article -
3
Spectral Method for Phase Retrieval: An Expectation Propagation Perspective
Published in IEEE transactions on information theory (01-02-2021)“…Phase retrieval refers to the problem of recovering a signal <inline-formula> <tex-math notation="LaTeX"> {x}_{\star }\in \mathbb {C}^{n}…”
Get full text
Journal Article -
4
The Noise-Sensitivity Phase Transition in Compressed Sensing
Published in IEEE transactions on information theory (01-10-2011)“…Consider the noisy underdetermined system of linear equations: y = Ax 0 + z, with A an n × N measurement matrix, n <; N, and z ~ N(0, σ 2 I) a Gaussian white…”
Get full text
Journal Article -
5
CONSISTENT PARAMETER ESTIMATION FOR LASSO AND APPROXIMATE MESSAGE PASSING
Published in The Annals of statistics (01-12-2017)“…This paper studies the optimal tuning of the regularization parameter in LASSO or the threshold parameters in approximate message passing (AMP). Considering a…”
Get full text
Journal Article -
6
Optimization-Based AMP for Phase Retrieval: The Impact of Initialization and \ell Regularization
Published in IEEE transactions on information theory (01-06-2019)“…We consider an <inline-formula> <tex-math notation="LaTeX">\ell _{2} </tex-math></inline-formula>-regularized non-convex optimization problem for recovering…”
Get full text
Journal Article -
7
Optimality of large MIMO detection via approximate message passing
Published in 2015 IEEE International Symposium on Information Theory (ISIT) (01-06-2015)“…Optimal data detection in multiple-input multiple-output (MIMO) communication systems with a large number of antennas at both ends of the wireless link entails…”
Get full text
Conference Proceeding Journal Article -
8
Message passing algorithms for compressed sensing: I. motivation and construction
Published in 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo) (01-01-2010)“…In a recent paper, the authors proposed a new class of low-complexity iterative thresholding algorithms for reconstructing sparse signals from a small set of…”
Get full text
Conference Proceeding -
9
WHICH BRIDGE ESTIMATOR IS THE BEST FOR VARIABLE SELECTION?
Published in The Annals of statistics (01-10-2020)“…We study the problem of variable selection for linear models under the high-dimensional asymptotic setting, where the number of observations n grows at the…”
Get full text
Journal Article -
10
On the Gaussianity of Kolmogorov Complexity of Mixing Sequences
Published in IEEE transactions on information theory (01-02-2020)“…It has been proved that for all stationary and ergodic processes the average Kolmogorov complexity of the first n observations converges almost surely to its…”
Get full text
Journal Article -
11
From Denoising to Compressed Sensing
Published in IEEE transactions on information theory (01-09-2016)“…A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several…”
Get full text
Journal Article -
12
Correction to "Compressed sensing in the presence of speckle noise"
Published in IEEE transactions on information theory (03-06-2024)“…This paper presents a correction to Theorem 2 in [1] which follows from fixing an error in Lemma 5 and a minor correction in the constant of Lemma 3. Despite…”
Get full text
Journal Article -
13
Signal-to-Noise Ratio Aware Minimaxity and Higher-Order Asymptotics
Published in IEEE transactions on information theory (01-05-2024)“…Since its development, the minimax framework has been one of the corner stones of theoretical statistics, and has contributed to the popularity of many…”
Get full text
Journal Article -
14
Toward Designing Optimal Sensing Matrices for Generalized Linear Inverse Problems
Published in IEEE transactions on information theory (01-01-2024)“…We consider an inverse problem [Formula Omitted], where [Formula Omitted] is the signal of interest, [Formula Omitted] is the sensing matrix, [Formula Omitted]…”
Get full text
Journal Article -
15
OVERCOMING THE LIMITATIONS OF PHASE TRANSITION BY HIGHER ORDER ANALYSIS OF REGULARIZATION TECHNIQUES
Published in The Annals of statistics (01-12-2018)“…We study the problem of estimating a sparse vector β ∈ ℝ p from the response variables y = Xβ + w, where w ~ N ( 0 , σ w 2 I n × n ) , under the following…”
Get full text
Journal Article -
16
Towards Designing Optimal Sensing Matrices for Generalized Linear Inverse Problems
Published in IEEE transactions on information theory (21-08-2023)“…We consider an inverse problem y = f(Ax) , where x ∈ R n is the signal of interest, A is the sensing matrix, f is a nonlinear function and y ∈ R m is the…”
Get full text
Journal Article -
17
From compression to compressed sensing
Published in Applied and computational harmonic analysis (01-03-2016)“…Can compression algorithms be employed for recovering signals from their underdetermined set of linear measurements? Addressing this question is the first step…”
Get full text
Journal Article -
18
Compressed Sensing in the Presence of Speckle Noise
Published in IEEE transactions on information theory (01-10-2022)“…Speckle or multiplicative noise is a critical issue in coherence-based imaging systems, such as synthetic aperture radar and optical coherence tomography…”
Get full text
Journal Article -
19
Using Black-Box Compression Algorithms for Phase Retrieval
Published in IEEE transactions on information theory (01-12-2020)“…Compressive phase retrieval refers to the problem of recovering a structured <inline-formula> <tex-math notation="LaTeX">n…”
Get full text
Journal Article -
20
Information Theoretic Limits for Phase Retrieval With Subsampled Haar Sensing Matrices
Published in IEEE transactions on information theory (01-12-2020)“…We study information theoretic limits of recovering an unknown <inline-formula> <tex-math notation="LaTeX">{n} </tex-math></inline-formula> dimensional,…”
Get full text
Journal Article