arXiv Analytics

Sign in

arXiv:2312.01574 [math.OC]AbstractReferencesReviewsResources

Fast Sampling for Linear Inverse Problems of Vectors and Tensors using Multilinear Extensions

Hao Li, Dong Liang, Zixi Zhou, Zheng Xie

Published 2023-12-04Version 1

Sampling vector and tensor signals is the process of choosing sites in vectors and tensors to place sensors in order to effectively recover the whole signals from a limited number of observations by solving linear inverse problems (LIPs). Here, we present closed-form multilinear extensions for the frame potential of pruned matrices, and based on these, we develop an algorithm named fast Frank-Wolfe algorithm for sampling vectors and tensors with low complexity. Then we provide the approximation factor of our proposed algorithm for a special class of sampling matrices. Then, we conduct experiments to verify the higher performance and lower complexity of our proposed algorithm. Finally, we demonstrate that FFW sampling and least squares reconstruction yield superior results for image data compared to convCNP completion with random sampling.

Related articles: Most relevant | Search more
arXiv:1407.1598 [math.OC] (Published 2014-07-07, updated 2014-12-08)
Low Complexity Regularization of Linear Inverse Problems
arXiv:1012.0621 [math.OC] (Published 2010-12-03, updated 2012-03-29)
The Convex Geometry of Linear Inverse Problems
arXiv:2101.02776 [math.OC] (Published 2021-01-07)
The Nonconvex Geometry of Linear Inverse Problems