A retrieval benchmark suite focused on “oblique queries,” where relevance depends on latent attributes rather than surface keywords. Includes five tasks with large corpora, qrels (and pooled judgments), and task-specific constraints for evaluating embedding-based retrievers and reasoning-augmented retrieval.
Provides a curriculum-aligned knowledge graph extracted from Chinese K–12 textbooks and accompanying benchmarks and training data to evaluate and train educational LLMs. Releases a 23,640-question multi-select benchmark and a 7,335-sample graph-guided training corpus with multimodal VQA pairs and the full construction pipeline.
Multimodal STEM problem set for verifiable, answer-supervised training and RL: contains single-image, multi-panel, and multi-image PhD-level questions across physics, math, chemistry and biology. Each example has a deterministic ground-truth answer, enabling reward modeling and automated evaluation.
Measures how well LLMs and agent-driven workflows prepare supervised training data end-to-end by jointly benchmarking data construction and data-quality evaluation across six domains, using a downstream-grounded protocol and new metrics.
Supervised fine-tuning dataset of instruction-style examples in English and Chinese covering generation, QA, reasoning, math and code — targeted for SFT of 10–100B-parameter LLMs. Associated with arXiv:2602.09003; first published May 21, 2026.
Fine-tuned reasoning model that speeds up structured multi-step outputs using Multi-Token Prediction (MTP) from a Qwen3.6-27B base. Produces more concise, faster generations for coding, DevOps, math, and constrained-format tasks; experimental community release for research and evaluation.
Generates text with explicit chain-of-thought traces for multi-step reasoning and math-heavy tasks, emitting reasoning inside <think>...</think> blocks. Uses a Mixture-of-Experts design and 131k token context for long, verifiable workflows—best when you need inspectable reasoning.
Analyzes how single-domain RL fine-tuning on LLMs induces cross-domain interference and shows this damage concentrates in a low-dimensional shared conflict subspace; proposes a local perturbation theory and short domain "refresh" procedures that selectively recover earlier domains with minimal collateral loss.
A 3B-parameter causal LLM tuned for verifiable multi-step reasoning in math, coding and STEM using a Spectrum-to-Signal post-training pipeline (SFT, RL, offline self-distillation); not recommended for tool-calling/agent tasks.
Runs a full 27B-class Qwen3.6-derived language model in a ~3.9 GB 1-bit GGUF pack for on-device inference with a 262K-token context; true 1.125 bits/weight binary representation, DSpark speculative drafter, and llama.cpp (CUDA/Metal/CPU) support.
Stabilizes on-policy policy distillation by dynamically constructing a proximal teacher that controls gradient variance. Provides theoretical global convergence and monotonic improvement bounds, and shows improved training stability, sample efficiency, and final performance on mathematical reasoning tasks with zero extra compute overhead.
50,000 distilled conversational traces (≈120M tokens) generated from GLM-5.2 for high-reasoning text generation and QA, covering STEM, programming, creative and support dialogues; Apache-2.0 licensed.