This page provides GGUF quantized versions of DiffusionGemma 26B A4B-it, a multimodal model from Google DeepMind based on the Gemma 4 architecture. The model employs discrete text diffusion through block-autoregressive multi-canvas sampling to achieve significantly faster decoding speeds than standard autoregressive models. It is capable of processing interleaved inputs consisting of text, images with variable resolutions and aspect ratios, and video content for generating textual outputs.
Key topics:
- Mixture-of-Experts architecture with 3.8 billion active parameters.
- High-speed generation through parallel denoising of token blocks.
- Multimodal input support including image and video understanding.
- Extensive context window capability up to 256K tokens.
- Integrated reasoning modes for step-by-step thought processes.
Key topics:
- Mixture-of-Experts architecture with 3.8 billion active parameters.
- High-speed generation through parallel denoising of token blocks.
- Multimodal input support including image and video understanding.
- Extensive context window capability up to 256K tokens.
- Integrated reasoning modes for step-by-step thought processes.
Google DeepMind has released the Gemma 4 12B, a dense multimodal model featuring an encoder-free architecture. Unlike previous iterations that used separate vision and audio encoders, this model allows these modalities to flow directly into the LLM backbone. This streamlined design reduces latency and memory overhead, allowing the model to perform agentic reasoning tasks on consumer laptops with as little as 16 GB of VRAM while approaching the performance levels of much larger models like the 26B MoE variant.
- Unified decoder-only architecture for text, image, video, and native audio input.
- Encoder-free design using a 35M vision embedder and direct raw audio wave projection.
- Optimized to run locally on Apple Silicon Macs and consumer GPU laptops.
- Released under an Apache 2.0 license with support for llama.cpp, MLX, vLLM, and Ollama.
- Unified decoder-only architecture for text, image, video, and native audio input.
- Encoder-free design using a 35M vision embedder and direct raw audio wave projection.
- Optimized to run locally on Apple Silicon Macs and consumer GPU laptops.
- Released under an Apache 2.0 license with support for llama.cpp, MLX, vLLM, and Ollama.
Google DeepMind has introduced AlphaEvolve, an LLM-powered evolutionary coding agent that automates the design of algorithms for Multi-Agent Reinforcement Learning (MARL) in imperfect-information games. Using Gemini 2.5 Pro to mutate Python source code, the system discovered two novel algorithms: VAD-CFR and SHOR-PSRO. These evolved algorithms matched or surpassed state-of-the-art hand-designed baselines in various scenarios, including poker and Liars Dice. The research highlights the ability of automated search to discover non-intuitive mechanisms, such as volatility-adaptive discounting and hybrid meta-solvers, which generalize effectively to larger, unseen games, proving that LLMs can evolve complex algorithmic logic more efficiently than manual human iteration.
>As autonomous agents powered by LLM are increasingly deployed in society, understanding their collective behaviour in social dilemmas becomes critical. We introduce an evaluation framework where LLMs generate strategies encoded as algorithms, enabling inspection prior to deployment and scaling to populations of hundreds of agents—substantially larger than in previous work. We find that more recent models tend to produce worse societal outcomes compared to older models when agents prioritise individual gain over collective benefits. Using cultural evolution to model user selection of agents, our simulations reveal a significant risk of convergence to poor societal equilibria, particularly when the relative benefit of cooperation diminishes and population sizes increase. We release our code as an evaluation suite for developers to assess the emergent collective behaviour of their models
