LiteResearcher: A Scalable Agentic RL Training Framework for Deep Research Agent
arXiv:2604. 17931v3 Announce Type: replace Abstract: Reinforcement Learning (RL) has emerged as a powerful training paradigm for LLM-based agents.
Project Greenhouse explores building fully open and sovereign agentic search models with modest computational resources. The authors present a competitive pointwise decoder-only reranker trained from scratch and fine-tuned on common datasets, avoiding reliance on third‑party open‑weight backbones. They demonstrate that most experiments can be run on a handful of GPUs and release data, code, configurations, and checkpoints for reproducibility.
arXiv:2604. 17931v3 Announce Type: replace Abstract: Reinforcement Learning (RL) has emerged as a powerful training paradigm for LLM-based agents.
arXiv:2610. 21055v1 Announce Type: new Abstract: Recursive self-improvement, in which AI systems build stronger AI systems, is one promising route to superintelligence.
arXiv:2610.16998v1 Announce Type: new Abstract: Deep search enables language agents to solve complex information-seeking tasks through iterative web exploration. However, developing robust open-sourc...
ZGCM-1 is a 7B dense foundation model trained from scratch with extreme data, system, and algorithmic efficiency. It uses a core premise that compact models can overcome capacity limits by combining deliberate internal thinking with active external tool use, supported by a 256K context and an end‑to‑end high‑efficiency training recipe that includes interleaved gated sliding‑window and full attention, a stable FP8 Muon optimizer, progressive curriculum scaling, and reformulation of interaction traces into Markov Decision Processes. The model is competitive with much larger frontier models on challenging mathematical reasoning and agentic search tasks, offers a ~4.2× efficiency improvement in pre‑training time‑to‑loss, and its weights, checkpoints, training code, data recipes, and logs are fully open‑source to support community research.
TMax is an open reinforcement‑learning recipe that trains terminal‑using agents from small language models, achieving 33% on Terminal‑Bench 2.0 with only 9B parameters and outperforming larger prior models. The approach generates training data via a novel taxonomy that blends difficulty control, personas, and verifier diversification, enabling cheap creation of many terminal environments for both RL and supervised fine‑tuning. The recipe is applicable to models ranging from 2B to 27B across different families, dominating the Pareto curve for open terminal‑agent performance at smaller sizes.
arXiv:2601.13247v2 Announce Type: replace-cross Abstract: Current Large Language Models (LLMs) exhibit a critical modal disconnect: they possess vast semantic knowledge but lack the procedural ground...
arXiv:2605.24218v2 Announce Type: replace Abstract: Deep research agents extend the role of search engines from retrieving keyword-matched pages to synthesizing knowledge, fundamentally changing how...
arXiv:2606. 24855v1 Announce Type: new Abstract: Agentic language models dramatically expand the applications of AI yet little is publicly known about how to curate training data for broadly capable agents.
arXiv:2610.24899v2 Announce Type: replace-cross Abstract: While LLM agents are increasingly capable of gathering and synthesizing evidence from a single homogeneous source, such as structured tables...
arXiv:2608. 11216v1 Announce Type: new Abstract: World modeling is an unsettled field: architectures, training objectives, and state representations interact in complex ways, and no single recipe dominates across environments.
arXiv:2609.09410v1 Announce Type: new Abstract: While autonomous agents have made significant strides in "deep research" by iteratively navigating the open web to synthesize information, real-world p...
arXiv:2601. 21754v3 Announce Type: replace Abstract: While Large Language Models (LLMs) excel in language-based agentic tasks, their applicability to unseen, nonlinguistic environments (e.