MOAI speeds non-interactive homomorphic transformer inference
It cuts BERT-base evaluation time 52.8% versus THOR and reports 2.36 minutes amortized per input on one GPU.
74 stories, newest first · one card per story
It cuts BERT-base evaluation time 52.8% versus THOR and reports 2.36 minutes amortized per input on one GPU.
It reports F1 of 0.984 on HDFS and scores a session in 5.5-10.5 ms without a GPU.
Applied atop existing objectives, it narrows most of the gap to a retain-trained reference on memorization, privacy, and utility.
FWL-ToPM provides over 8x speedup and nearly 9-point F1 gain on Ghost-FWL benchmark.
On 300 unseen objects it scores 38.08 dB PSNR, versus 44.02 dB when rasterizing the same pruned splats.
LoopVQ jointly quantizes channels across multiple loop steps in looped transformers to reduce memory while preserving accuracy.

The available text names ZHA but gives no architecture, benchmarks, or release details.
Hugging Face Blog announces Transformers model integration contracts for AI tooling.
Exact tiled computation incorporates additive position terms into FlashAttention without redundant indexing or memory overhead.
Block-wise grouping with wider residuals and learned projections improves FLOPs efficiency while preserving standard layer structure.
A GPT-style decoder uses ESM-2 embeddings of the protein of interest instead of designing only the linker.
Only the lowest-frequency slot per spatial anchor attends globally; higher-frequency detail stays local.
On a multi-scene dataset, the method cut normalized mean squared error 15.42% and improved all five metrics by more than 10%.
After controlling for sequence length, the reported edge over model confidence disappears; topology shifts ROC-AUC by at most 0.004.
The training-free method synthesizes a native target update from activation changes instead of moving parameters.
Attention-side sparsity nests with mixture-of-experts sparsity and adapts to new domains with less forgetting.
The framework recovers standard, causal, linear, and tensor attention plus recurrent networks, then proposes new geometric spaces.
Two fully trained loops beat the compute-optimal non-looped model with about 27% fewer non-embedding parameters.
Plane parameters need no ground-truth geometry and can be learned from view synthesis alone or taken from foundation models.
Hidden-state distance between two prompts decays as a power law; trained models forget faster than untrained ones.
LangDiT redesigns Transformers for continuous diffusion LMs, cutting OpenWebText generation perplexity to 11.33–21.72.
A retraining-free method turns transformers into elastic models that prune smoothly up to 60% sparsity.
Continuum Attention beats softmax and focal attention by integrating a continuous memory curve.

A TypeScript guide shows how to build a GPT-style language model from scratch in Node.js.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views