Large language models

Model releases, architecture work and prompting research on large language models — from frontier-lab announcements to the arXiv papers behind them.

26,848 stories · RSS feed

arXiv AI
Oct 5

Multi-Task Evolution for Zero-Shot Cross-Problem Generalization using LLMs

The paper introduces MECo, a large language model–driven multi‑task evolutionary framework that enables zero‑shot cross‑problem generalization for combinatorial optimization. MECo maintains task‑conditioned heuristic populations, uses a transfer gap based on cross‑task performance to guide interactions, and selects a compact heuristic set that covers source combinations. Experiments on 32 variants of vehicle routing and flexible job‑shop scheduling demonstrate that MECo achieves lower mean costs than eight automated heuristic design baselines and improves both in‑domain and out‑of‑domain performance when integrated with other methods.

By Zhouliang Xie, Changliang Zhou, Genghui Li, Zhenkun Wang
Simon Willison
Oct 3

September sponsors-only newsletter

Simon Willison has released the September edition of his sponsors‑only monthly newsletter. The issue covers new Fable class models, a pricing war, 3D graphics with Blender and pixel art, LLMs applied to mathematics, accidental cyberattacks, the vulnapocalypse affecting Datasette, his current tools, and software releases for 2026. Sponsors can access the full newsletter for $10/month, with an August preview available for free.

Towards Data Science
Oct 3

Measuring the Creativity Potential of LLM Agents

The article explores whether large language model (LLM) agents can discover new ideas by examining their creative potential. It frames this inquiry through the lens of creativity, aiming to assess how LLM agents might generate novel insights or solutions. The discussion is presented as a post on Towards Data Science.

By Shitanshu Bhushan
arXiv Machine Learning
Oct 3

Format-Aware Fusion for Fast FP4 Pretraining

The paper introduces format‑aware fusion, a method that co‑designs quantization producers with their scale domains and consumer layouts to fully exploit four‑bit floating‑point (FP4) Tensor Cores. Using this approach, the authors pretrain the Llama‑3‑family 8B model on 160 billion tokens, achieving up to 37.9 K tokens/s/GPU—significantly higher than standard bfloat16 or Transformer Engine FP4 baselines. The study demonstrates that FP4 performance depends on the interplay of scaling, operand packing, layout, and execution path, with downstream task rankings diverging from training‑loss rankings.

By Robert Hu
arXiv Machine Learning
Oct 3

Constant-Memory Recall: Learned Associations in a Fixed Matrix State

The paper introduces a small DeltaNet variant that uses a fixed-size recurrent memory to store 32 key‑value pairings per sequence. With only 32 KiB of matrix state, the model attains 99.95 % mean accuracy across three training seeds when selecting the correct value, and this performance persists even when the pre‑query context is extended to 1,798 tokens. Zeroing the first memory block eliminates recall, and exploratory tests with 48 pairs show near‑chance performance after a quarter of the training budget, indicating no clear capacity limit. Baseline models matched in parameters, including a Transformer, remain near chance, preventing a direct memory‑efficiency comparison.

By Samuel Larson