Folded context condensation in Path Integral formalism for infinite context transformers
<|reference_start|>Folded context condensation in Path Integral formalism for infinite context transformers: This short note is written for rapid communication of long context training and to share the idea of how to train it with low memory usage. In the note, we generalize the attention algorithm and neural network of Generative Pre-Trained Transformers and reinterpret it in Path integral formalism. First, the role of the transformer is understood as the time evolution of the token state and second, it is suggested that the all key-token states in the same time as the query-token can attend to the attention with the query token states. As a result of the repetitive time evolution, it is discussed that the token states in the past sequence meats the token states in the present sequence so that the attention between separated sequences becomes possible for maintaining infinite contextual information just by using low memory for limited size of sequence. For the experiment, the $12$ input token window size was taken and one GPU with $24$GB memory was used for the pre-training. It was confirmed that more than $150$ length context is preserved. The sampling result of the training, the code and the other details will be included in the revised version of this note later.<|reference_end|>
@article{paeng2024folded,
    title={Folded context condensation in Path Integral formalism for infinite
  context transformers},
    author={Won-Gi Paeng and Daesuk Kwon},
    journal={arXiv preprint arXiv:2405.04620},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.04620},
    primaryClass={hep-ph cs.AI cs.CL cs.LG cs.NE}
}