Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
From MaRDI portal
Publication:2978654
DOI10.1109/TIT.2015.2401574zbMath1359.94150arXiv1212.3753OpenAlexW2110355775MaRDI QIDQ2978654
Samet Oymak, Yonina C. Eldar, Maryam Fazel, Amin Jalali, Babak Hassibi
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.3753
Related Items
An optimal statistical and computational framework for generalized tensor estimation, Tensor train rank minimization with hybrid smoothness regularization for visual data recovery, Constructing confidence intervals for the signals in sparse phase retrieval, An Unbiased Approach to Low Rank Recovery, Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation, Self-calibration and biconvex compressive sensing, Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing, Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication, Sharp MSE bounds for proximal denoising, Trace regression model with simultaneously low rank and row(column) sparse parameter, Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN, Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements, Enhanced image approximation using shifted rank-1 reconstruction, Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem, Generic error bounds for the generalized Lasso with sub-exponential data, Sparse disjointed recovery from noninflating measurements, Robust sensing of low-rank matrices with non-orthogonal sparse decomposition, Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs, Compressive total variation for image reconstruction and restoration, Compressive phase retrieval: Optimal sample complexity with deep generative priors, Riemannian thresholding methods for row-sparse and low-rank matrix recovery, Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements, Flavors of Compressive Sensing, Extreme point inequalities and geometry of the rank sparsity ball, A convex variational model for learning convolutional image atoms from incomplete data, Subspace clustering by \((k,k)\)-sparse matrix factorization, Equivalent Lipschitz surrogates for zero-norm and rank optimization problems, Sparse power factorization: balancing peakiness and sample complexity, A geometric analysis of phase retrieval, Low Complexity Regularization of Linear Inverse Problems, Tensor completion based on triple tubal nuclear norm, Sparse and low-rank covariance matrix estimation, Tensor theta norms and low rank recovery, Jointly low-rank and bisparse recovery: Questions and partial answers, Low-Rank Approximation and Completion of Positive Tensors, Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems, Solving equations of random convex functions via anchored regression, Non-intrusive tensor reconstruction for high-dimensional random PDEs, Proof methods for robust low-rank matrix recovery, Optimization on the hierarchical Tucker manifold - applications to tensor completion
