A solo developer training a small 'Engram' model posted an update on r/LocalLLaMA after roughly a week. The model pairs a 2.6B-parameter transformer with a 4.3B context-aware Engram table, aiming to test whether knowledge can be offloaded from network weights to a lookup table. At just 104M training tokens, completions show the Engram table already improving factual recall, and the developer is seeking a compute sponsor to finish training.
DeepSeek Harness link shared on Hacker News
DeepSeek Harness link shared on Hacker News
A user reports watching a DeepSeek model enter an infinite reasoning loop on 2-3 specific tokens, and asks whether this behavior still affects frontier models or if it stemmed from a quantized deployment during peak load.
A user reports watching a DeepSeek model enter an infinite reasoning loop on 2-3 specific tokens, and asks whether this behavior still affects frontier models or if it stemmed from a quantized deployment during peak load.
A new paper proposes a change to DeepSeek's Engram conditional memory module, replacing token-level N-gram hashing with a tokenizer-agnostic routine. This enables Engram embeddings to be reused across models with different tokenizers, avoiding retraining from scratch.
A new paper proposes a change to DeepSeek's Engram conditional memory module, replacing token-level N-gram hashing with a tokenizer-agnostic routine. This enables Engram embeddings to be reused across models with different tokenizers, avoiding retraining from scratch.
The DWARF-55M-Base model, the first from the DWARF architecture, has been released. It uses 9 Dynamic Sparse Query-Gather (DSQG) layers and a single full causal attention layer at 25% depth, achieving reliable retrieval up to 2048 context. This sparse attention design could reduce computational costs while maintaining performance.
The DWARF-55M-Base model, the first from the DWARF architecture, has been released. It uses 9 Dynamic Sparse Query-Gather (DSQG) layers and a single full causal attention layer at 25% depth, achieving reliable retrieval up to 2048 context. This sparse attention design could reduce computational costs while maintaining performance.
Researchers released Daedalus-150M, a 150M-parameter language model architected specifically for CPU inference. It uses convolution in 12 of 18 blocks to avoid re-reading a growing cache, achieving 47.31 on a five-task benchmark against a 42.20 baseline.
Researchers released Daedalus-150M, a 150M-parameter language model architected specifically for CPU inference. It uses convolution in 12 of 18 blocks to avoid re-reading a growing cache, achieving 47.31 on a five-task benchmark against a 42.20 baseline.