Provides a locally runnable, quantized GGUF release of Gemma 4 12B fine-tuned for Python coding with chain-of-thought distilled from Composer 2.5 and supplemented by Fable 5. Multiple quant options for low‑VRAM setups and execution‑verified training traces. Not safety‑aligned; validate before production.
Refines large-scale English pretraining corpora by predicting per-instance structured edits (insert, delete, replace) and deterministically applying them to produce cleaner text for LLM training. Provides five ~20B-token refined corpora in parquet with edit metadata and simple loading configs.
Shifts branching and credit assignment in agentic RL from coarse units to fine-grained decision points in generated sequences. Uses a Branching Score combining token uncertainty and policy-induced likelihood gains plus procedure-level advantage scaling; improves performance across 13 benchmarks while keeping efficient tool calls.
Orchestrates teams of sub-agents across text, image, audio and video by modality-aware task decomposition, online sub-agent specialization, and parallel execution; introduces DA-GRPO to train Orchestra-o1-8B and reports a ~10.3% accuracy improvement on the OmniGAIA benchmark.
Provides GGUF quantized weights and runnable instructions to run CohereLabs' North-Mini-Code-1.0 (30B A3B MoE) locally via llama.cpp or vLLM; includes quant files, build/run notes, and recommended sampling and tool-use settings for agentic coding.
A community-distributed GGUF bundle of Google DeepMind’s DiffusionGemma (26B A4B) with multiple quantization variants for local image-text-to-text inference. Targets experimentation and offline deployment via the DiffusionGemma llama.cpp branch and llama-diffusion-cli; choose quantization for GPU memory vs. fidelity trade-offs.
Proposes a router redesign for Mixture-of-Experts (MoE) that aligns each router row with its expert's principal singular direction using Manifold Power Iteration (MPI), improving token–expert affinity. MPI applies a 'power‑then‑retract' step to push router rows toward principal singular vectors while enforcing norm constraints; the paper gives convergence theory and pretraining results on 1B–11B MoE models.
Lets an AI agent propose, run, and evaluate multi-step research experiments using a persistent Hypothesis Tree that links hypotheses, artifacts, evidence, and distilled insights. Combines a long-lived coordinator with short-lived executors to carry lessons across time; evaluated on six ML tasks.
Benchmarks evolving environments as sequences of progressive updates and introduces EvoMem, a patch-based memory that records structured update histories so LLM agents can reason about environment evolution. Demonstrates measurable gains on EvoArena and other benchmarks.
A quantized 27B coder LLM fine-tuned for repository-level code generation, multi-turn tool calling, and agentic workflows — packaged for local GGUF/llama.cpp deployment with MTP speculative decoding and trace-inversion SFT. Optimized for developer tooling; experimental and not fully safety-validated.
Implements a blockwise sparse attention (MiniMax Sparse Attention) that scores and Top-k selects key-value blocks per Grouped Query Attention group to enable attention over million-token contexts. Paired with an exp-free Top-k GPU kernel and KV-outer sparse execution, it reduces per-token attention compute and yields large prefill/decoding speedups.
A post-trained Mixture-of-Experts multimodal LLM with ~397B total (≈17B active) and a 1,010,000-token context for image-text-to-text and conversational tasks. Integrates SwiReasoning to switch between latent and explicit reasoning; MIT-licensed and optimized for Portuguese/English research and on-prem inference.