arXiv Computation and Language By Jimmy Lin, Sahel Sharifymoghaddam, Lingwei Gu, Nour Jedidi

Project Greenhouse: Progress Toward Fully Open and Sovereign Agentic Search

Read the original on arXiv Computation and Language →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Oct 15

Glasseek: A Transparent Recipe for Training and Trustworthy Evaluation of DeepSearch Agents

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...

By Cong Pang, Jiaqi Su, Chengrui Wu, Kuihao Yan, Tianrui Zhang, Zixuan Qiu, Chao Lin, Zixiu Lin, Zixuan Chen, Zelin Xiao, Tiankuo Yao, Jiawei Hong, Zixuan Chen, Dan Xu, Lewei Lu, Wenjie Wang, Xin Lou
arXiv AI
Sep 15

ZGCM-1: A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search

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.

By Jiyan He, Guang Liang, Hao Liu, Haoxiang Guan, Jinbo Sun, Junyi Guo, Wenjun Feng, Yantai Xie, Yifei Shen, Bin Shao, Chuyang Wei, Kai Chen, Kexin Zhou, Minghang Zhu, Shuxin Zheng, Tie-Yan Liu, Taine Zhao, Wenhui Zhu, Xueyin Xu, Xiaoqing Zhang, Yatao Li, Yuxuan Ren
arXiv Computation and Language
3d ago

Tmax: A simple recipe for terminal agents

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.

By Hamish Ivison, Junjie Oscar Yin, Rulin Shao, Teng Xiao, Nathan Lambert, Hannaneh Hajishirzi