Paul Jorion's Blog

Tag: Combinatorial Magic

  • Comparison between Google S2R, Pribor’s Combinatorial Magic and Pribor’s CHE (Contextual Hyper-Embedding)

    Comparison between Google S2R, Pribor’s Combinatorial Magic and Pribor’s CHE (Contextual Hyper-Embedding) This document presents the characteristics, divergences and synergies between three approaches: Google S2R, Pribor’s Combinatorial Magic and Pribor’s CHE (Contextual Hyper-Embedding). 1. Google’s S2R * “S2R” means Speech-to-Retrieval. It is a recent voice search architecture that Google is deploying, which bypasses the explicit…

  • PRIBOR: CHE — Contextual Hyper-Embedding (uint8)

    A more economical alternative to classical attention CHE (Contextual Hyper-Embedding, uint8) offers a radical gain in efficiency compared with the standard attention mechanisms of large language models. Similar methods have appeared in recent research, but none reach CHE’s level of economy. 1 · Memory efficiency Standard attention: float16 / float32 matrices → 700 to 4000…

  • PRIBOR: “Combinatorial Magic” Logic – Proof of Concept

    Loss-less 4-scalar encoding × 175 memory reduction × 1-cycle decode Claim: Any simple sentence can be loss-lessly encoded into 4 scalars (3 UTF-8 strings ≤ 16 bytes each + 1 uint8) while preserving agent / patient / possessor roles and 10 categories + 4 causes. 1. 4-D Vector Definition Dim Type Max len Semantics 0…