AI Dataset2022
Contains 40,000 teacher-generated reasoning traces distilled from the Qwen3.8-27B model for supervised fine-tuning and analysis. Covers code, math, science and logic; each example pairs a <think> chain-of-thought with a final response and is distributed in JSONL/Parquet for SFT workflows.
AI Agent Papers2026
Trains compact conversational agents to adapt at runtime to changing 'Harness' configurations (Skills, Hooks, prompts, tools) using Harness-Aware Training (HAT): Harness-State Augmentation, on-policy distillation, and RL to preserve generality while meeting low-latency deployment constraints.
AI Dataset2026
A synthetic, verifiable-first agentic training corpus with 19,072 training traces and 2,135 held-out evaluation rows. Provides per-turn visible reasoning, real sandboxed tool executions, 13 verifiable task families, and NeMo Gym / RL-ready reward contracts for SFT and RL workflows.
AI Dataset2026
Converts 200+ hours of expert Figma screen recordings into 3,469 Playwright-MCP action trajectories for training and evaluating vision-language and GUI agents; includes 126 long‑horizon tasks, phase labels, a 10‑skill taxonomy, and is CC‑BY‑4.0 licensed.
AI Video Papers2026
Yunheng Li, Guohong Mu +5VCIP, School of Computer Science, Nankai University, Brain and Artificial Intelligence Lab, Northwestern Polytechnical University +2
Treats human annotations as oracle rollouts and separates them from on-policy baselines to improve reinforcement learning for video multimodal LLMs. Key features include a decoupled advantage estimator, sign-balanced pruning, and scalable gains across model sizes and data budgets.
AI Model2026
A 4B-parameter on-device general-purpose LLM for chat, writing, translation, coding and agentic workflows with native 1,000,000-token context. Uses a hybrid attention design to enable long-context efficiency, pretrained on ~20T tokens, and compatible with vLLM, llama.cpp, Ollama and LM Studio.
Aozhe Wang, Zhengxi Lu +9Affiliation: Zhejiang University, Affiliation: Alibaba Group{waz,zhengxilu,syl}@zju.edu.cn [email protected]
A test-time method that adapts LLMs without labels by distilling rollouts that agree with majority pseudo-labels and penalizing disagreeing rollouts via grouped RL, improving robustness under frequent pseudo-label errors.
Generates compact keyword sets for both queries and items with LLMs and matches them directly via an inverted index. Uses supervised fine-tuning to align keyword spaces, then alternates GRPO-based reinforcement learning on query- and item-side generators to co-evolve representations and maximize retrieval F1 while staying compatible with keyword-based infrastructure.