“Imprecise” language models are smaller, speedier—and nearly as accurate
  • @floofloof@lemmy.caEnglish
    8•29 days ago

    In February, Wei’s team announced BitNet 1.58b, in which parameters can equal -1, 0, or 1, which means they take up roughly 1.58 bits of memory per parameter. A BitNet model with 3 billion parameters performed just as well on various language tasks as a full-precision LLaMA model with the same number of parameters and amount of training, but it was 2.71 times as fast, used 72 percent less GPU memory, and used 94 percent less GPU energy. Wei called this an “aha moment.” Further, the researchers found that as they trained larger models, efficiency advantages improved.

    That’s pretty impressive.

  • @qjkxbmwvz@startrek.website
    6•29 days ago

    Only briefly skimmed, but don’t you need nonlinearity for these things to work (e.g., rectifier, sigmoid…)? Else, it’s just linear algebra, and more layers can’t help (since matrices can be multiplied, the dimensionality is the only thing that matters). I don’t think you can really get nonlinearity with one bit.

    Not my field, so I’m sure I’m missing something. If anyone wants to ELI5 though…

    • @howrar@lemmy.ca
      6•29 days ago

      This article got me curious about how these 1-bit models worked so I read up on it a bit.

      https://arxiv.org/html/2402.11295v3

      The model parameters aren’t completely converted to 1-bit. It’s decomposed into a sign matrix (the 1-bit part) and two full precision vectors which together make a rank 1 approximation of the original matrix. So if I understand correctly, this means everything still functions the same way as a regular transformer. Input vectors, intermediate values, and outputs, all are full precision and have no problem going through nonlinearities.