Across eight experiments, the authors say the model reads, repairs and writes network weights from plain-language goals. A video walkthrough points out that most of the headline math gain came from stopping reasoning loops.
A paper on OpenAI's servers builds a smooth, compactly supported force that drives a flow from rest to unbounded velocity at the origin while its energy stays bounded. The library holds no independent check yet.
Refusal of harmful instructions in open-source chat models is controlled by a single direction in the residual stream. Erasing this direction stops refusal, and adding it induces refusal on harmless prompts. The same finding enables a rank-one weight edit that works as a white-box jailbreak, and it explains how adversarial suffixes suppress refusal.
AI may transform mathematical discovery and careers without eliminating the value of doing, learning, and sharing mathematics. Steven Strogatz and Grant Sanderson locate that value in understanding, personal struggle, teaching, individuality, and human connection, while considering new forms of AI-assisted work and mathematical education.
The paper proposes the Transformer, a sequence transduction architecture built only on attention mechanisms, with recurrence and convolution removed. It reports state-of-the-art machine translation results on WMT 2014 English-to-German and English-to-French at a fraction of earlier training cost, and good results on English constituency parsing. The authors argue that attention alone is more parallelizable and faster to train.
The Google AI Language team announces the open-source release of BERT, a pre-training technique for natural language processing. BERT is a deeply bidirectional model pre-trained on unannotated text, which can be fine-tuned quickly on small task datasets. The post reports state-of-the-art results on 11 NLP tasks.
The paper introduces two simple log-linear architectures, CBOW and Skip-gram, for learning vector representations of words from very large text corpora. It defines a word-relationship test set on which the vectors answer syntactic and semantic questions by vector arithmetic, and reports accuracy, training time and a sentence completion result.
Transformers enabled modern LLMs through an architecture that scales with data, compute, and parameters. Their foundations combine tokenization and learned embeddings with positional information, attention, and feedforward networks to build contextual representations and generate text.
Large language models build on transformers, with decoder-only generation becoming dominant alongside representation-based approaches such as BERT. Their effectiveness depends on balancing model size and training data, using efficient architectures, and choosing suitable decoding methods. Prompting and reasoning techniques can improve responses without changing weights, but longer contexts can impair retrieval and increase costs.
LLM training progresses from reusable next-token pretraining through targeted midtraining, supervised instruction tuning, preference alignment, and reasoning training. RLHF, DPO, verifiable rewards, and on-policy distillation provide different ways to improve behavior and capabilities, while data quality, computational costs, and capability preservation remain central constraints.
Reinforcement learning trains LLMs for human preferences and reasoning by maximizing learned or verifiable rewards, but must address noisy gradients, token-level credit assignment, and excessive policy changes. PPO and GRPO make different trade-offs between these problems, while on-policy distillation provides token-level teacher feedback on student-generated responses, with extensions to self-distillation and domain-specific teachers.