{
  "schemaVersion": 1,
  "paper": {
    "url": "https://arxiv.org/abs/1805.02867v2",
    "pdfUrl": "https://arxiv.org/pdf/1805.02867v2",
    "version": "v2 (2018-07-28)",
    "authors": ["Maxim Milakov", "Natalia Gimelshein"],
    "pages": 9,
    "licenseUrl": "https://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "pdfSha256": "722747b3a32eb90f5f0255d6b59f8bb0e1bc2257702ab7915e684c15275d44d7"
  },
  "crops": [
    {
      "key": "stable",
      "src": "/images/papers/online-softmax/stable.png",
      "page": 2,
      "bbox": [104, 427, 507, 574],
      "scale": 2,
      "href": "https://arxiv.org/pdf/1805.02867v2#page=2",
      "label": "Algorithm 2: maximum-first safe softmax",
      "selection": "Algorithm 2: maximum-first safe softmax",
      "alt": "Original Algorithm 2 with separate maximum, denominator and output loops.",
      "width": 806,
      "height": 294,
      "sha256": "584fd15acde1f916e5671e3ab1e9d56713c5bf14830d8580f915ba4dabf59658"
    },
    {
      "key": "online",
      "src": "/images/papers/online-softmax/online.png",
      "page": 3,
      "bbox": [104, 69, 507, 151],
      "scale": 2,
      "href": "https://arxiv.org/pdf/1805.02867v2#page=3",
      "label": "Algorithm 3, lines 1–6: online normalizer",
      "selection": "Algorithm 3, lines 1–6: online normalizer",
      "alt": "Original Algorithm 3 initialization and running maximum and denominator updates.",
      "width": 806,
      "height": 164,
      "sha256": "648711b368b696fbf7ae148aa9b0aa170945335ac427136f213241a718284848"
    },
    {
      "key": "merge",
      "src": "/images/papers/online-softmax/merge.png",
      "page": 4,
      "bbox": [104, 237, 507, 337],
      "scale": 2,
      "href": "https://arxiv.org/pdf/1805.02867v2#page=4",
      "label": "Equations 3–4: parallel summary merge",
      "selection": "Equations 3–4: parallel summary merge",
      "alt": "Original equations defining a softmax summary reduction and the binary merge operation.",
      "width": 806,
      "height": 200,
      "sha256": "3d560a2d2c19430eae70616f060e9814b0c95c90825f3c822f8a1e0d7a808ed3"
    },
    {
      "key": "output",
      "src": "/images/papers/online-softmax/output.png",
      "page": 3,
      "bbox": [108, 151, 280, 194],
      "scale": 2,
      "href": "https://arxiv.org/pdf/1805.02867v2#page=3",
      "label": "Algorithm 3, lines 7–9: final output pass",
      "selection": "Algorithm 3, lines 7–9: final output pass",
      "alt": "Original Algorithm 3 final loop that uses the complete maximum and denominator to produce probabilities.",
      "width": 344,
      "height": 86,
      "sha256": "2f11e7791286167a39ffdbc2d2589df505c1cdc7abf0febaf09632e9ff24cfa2"
    },
    {
      "key": "topk",
      "src": "/images/papers/online-softmax/topk.png",
      "page": 5,
      "bbox": [104, 69, 507, 327],
      "scale": 2,
      "href": "https://arxiv.org/pdf/1805.02867v2#page=5",
      "label": "Algorithm 4: online softmax and TopK",
      "selection": "Algorithm 4: online softmax and TopK",
      "alt": "Original Algorithm 4 keeping the top logits and the normalizer before writing selected probabilities and indices.",
      "width": 806,
      "height": 516,
      "sha256": "6df2b05ad136a8fc72ccb5077a2fcbc470c467d035259be47530f01352610d23"
    }
  ]
}
