{
  "id": "2312.01574",
  "version": "v1",
  "published": "2023-12-04T02:12:41.000Z",
  "updated": "2023-12-04T02:12:41.000Z",
  "title": "Fast Sampling for Linear Inverse Problems of Vectors and Tensors using Multilinear Extensions",
  "authors": [
    "Hao Li",
    "Dong Liang",
    "Zixi Zhou",
    "Zheng Xie"
  ],
  "categories": [
    "math.OC"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-12-04T02:12:41.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "linear inverse problems",
      "multilinear extensions",
      "named fast frank-wolfe algorithm",
      "fast sampling",
      "squares reconstruction yield superior results"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}