{
  "id": "2004.12530",
  "version": "v1",
  "published": "2020-04-27T01:09:39.000Z",
  "updated": "2020-04-27T01:09:39.000Z",
  "title": "Analysis of the Stochastic Alternating Least Squares Method for the Decomposition of Random Tensors",
  "authors": [
    "Yanzhao Cao",
    "Somak Das",
    "Luke Oeding",
    "Hans-Werner van Wyk"
  ],
  "comment": "22 pages",
  "categories": [
    "math.NA",
    "cs.NA",
    "math.OC"
  ],
  "abstract": "Stochastic Alternating Least Squares (SALS) is a method that approximates the canonical decomposition of averages of sampled random tensors. Its simplicity and efficient memory usage make SALS an ideal tool for decomposing tensors in an online setting. We show, under mild regularization and readily verifiable assumptions on the boundedness of the data, that the SALS algorithm is globally convergent. Numerical experiments validate our theoretical findings and demonstrate the algorithm's performance and complexity.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-04-27T01:09:39.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "65K10",
      "90C15",
      "15A69",
      "68W20"
    ],
    "keywords": [
      "squares method",
      "stochastic alternating",
      "decomposition",
      "efficient memory usage",
      "algorithms performance"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 22,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}