English
Related papers

Related papers: Near-optimal matrix recovery from random linear me…

200 papers

In phase retrieval problems, a signal of interest (SOI) is reconstructed based on the magnitude of a linear transformation of the SOI observed with additive noise. The linear transform is typically referred to as a measurement matrix. Many…

Information Theory · Computer Science 2018-02-14 Nir Shlezinger , Ron Dabora , Yonina C. Eldar

The subdifferential of convex functions of the singular spectrum of real matrices has been widely studied in matrix analysis, optimization and automatic control theory. Convex analysis and optimization over spaces of tensors is now gaining…

Machine Learning · Statistics 2015-06-09 Stephane Chretien , Tianwen Wei

Matrix decomposition is ubiquitous and has applications in various fields like speech processing, data mining and image processing to name a few. Under matrix decomposition, nonnegative matrix factorization is used to decompose a…

Optimization and Control · Mathematics 2019-05-14 R. Jyothi , P. Babu , R. Bahl

We study low rank matrix and tensor completion and propose novel algorithms that employ adaptive sampling schemes to obtain strong performance guarantees. Our algorithms exploit adaptivity to identify entries that are highly informative for…

Machine Learning · Statistics 2013-11-12 Akshay Krishnamurthy , Aarti Singh

We introduce a novel optimization algorithm for image recovery under learned sparse and low-rank constraints, which we parameterize as weighted extensions of the $\ell_p^p$-vector and $\mathcal S_p^p$ Schatten-matrix quasi-norms for…

Computer Vision and Pattern Recognition · Computer Science 2023-04-21 Stamatios Lefkimmiatis , Iaroslav Koshelev

The aim of sparse phase retrieval is to recover a $k$-sparse signal $\mathbf{x}_0\in \mathbb{C}^{d}$ from quadratic measurements $|\langle \mathbf{a}_i,\mathbf{x}_0\rangle|^2$ where $\mathbf{a}_i\in \mathbb{C}^d, i=1,\ldots,m$. Noting…

Functional Analysis · Mathematics 2021-05-05 Yu Xia , Zhiqiang Xu

A cumbersome operation in many scientific fields, is inverting large full-rank matrices. In this paper, we propose a coded computing approach for recovering matrix inverse approximations. We first present an approximate matrix inversion…

Information Theory · Computer Science 2022-12-21 Neophytos Charalambides , Mert Pilanci , Alfred Hero

Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the results in compressive sensing concern random sampling…

Numerical Analysis · Mathematics 2014-04-02 Guangliang Chen , Atul Divekar , Deanna Needell

In this paper we present a fast and efficient method for the reconstruction of Magnetic Resonance Images (MRI) from severely under-sampled data. From the Compressed Sensing theory we have mathematically modeled the problem as a constrained…

Numerical Analysis · Computer Science 2017-12-01 Damiana Lazzaro , Elena Loli Piccolomini , Fabiana Zama

We study coded distributed matrix multiplication from an approximate recovery viewpoint. We consider a system of $P$ computation nodes where each node stores $1/m$ of each multiplicand via linear encoding. Our main result shows that the…

Information Theory · Computer Science 2021-05-06 Haewon Jeong , Ateet Devulapalli , Viveck R. Cadambe , Flavio Calmon

This paper presents a two-stage online algorithm for recovery of low-rank parameter matrix in non-stationary stochastic systems. The first stage applies the recursive least squares (RLS) estimator combined with its singular value…

Systems and Control · Electrical Eng. & Systems 2025-06-25 Yanxin Fu , Junbao Zhou , Yu Hu , Wenxiao Zhao

Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery…

Information Theory · Computer Science 2017-12-27 Yanjun Li , Kiryung Lee , Yoram Bresler

Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery…

Information Theory · Computer Science 2018-01-03 Yanjun Li , Kiryung Lee , Yoram Bresler

We study an approach to solving the phase retrieval problem as it arises in a phase-less imaging modality known as ptychography. In ptychography, small overlapping sections of an unknown sample (or signal, say $x_0\in \mathbb{C}^d$) are…

Numerical Analysis · Mathematics 2019-10-09 Brian Preskitt , Rayan Saab

Reduced model spaces, such as reduced basis and polynomial chaos, are linear spaces $V_n$ of finite dimension $n$ which are designed for the efficient approximation of families parametrized PDEs in a Hilbert space $V$. The manifold…

Numerical Analysis · Mathematics 2020-08-04 Albert Cohen , Wolfgang Dahmen , Ron DeVore , Jalal Fadili , Olga Mula , James Nichols

In this paper we tackle the problem of recovering the phase of complex linear measurements when only magnitude information is available and we control the input. We are motivated by the recent development of dedicated optics-based hardware…

Machine Learning · Computer Science 2020-02-17 Sidharth Gupta , Rémi Gribonval , Laurent Daudet , Ivan Dokmanić

In the undetermined linear system $\bm{b}=\mathcal{A}(\bm{X})+\bm{s}$, vector $\bm{b}$ and operator $\mathcal{A}$ are the known measurements and $\bm{s}$ is the unknown noise. In this paper, we investigate sufficient conditions for exactly…

Optimization and Control · Mathematics 2023-08-08 Yan Li , Liping Zhang

This paper considers the phase retrieval (PR) problem, which aims to reconstruct a signal from phaseless measurements such as magnitude or power spectrograms. PR is generally handled as a minimization problem involving a quadratic loss.…

Sound · Computer Science 2022-08-17 Pierre-Hugo Vial , Paul Magron , Thomas Oberlin , Cédric Févotte

In this paper, we study a spiked Wigner problem with an inhomogeneous noise profile. Our aim in this problem is to recover the signal passed through an inhomogeneous low-rank matrix channel. While the information-theoretic performances are…

Machine Learning · Statistics 2023-02-15 Aleksandr Pak , Justin Ko , Florent Krzakala

We study a nonconvex optimization algorithmic approach to phase retrieval and the more general problem of semidefinite low-rank matrix sensing. Specifically, we analyze the nonconvex landscape of a quartic Burer-Monteiro factored…

Optimization and Control · Mathematics 2026-04-20 Andrew D. McRae
‹ Prev 1 8 9 10 Next ›