Downloads · 30 days
27
11% of all-time downloads
Minbyul/Qwen3.5-35B-A3B-Asis-GRPO
Qwen3.5-35B-A3B-Asis-GRPO is a text generation model from Minbyul. Use it when you need the model to write or continue text. It is set up for transformers. The card lists the license as apache-2.0.
Asis-GRPO is a reinforcement-learning continuation of Qwen3.5-35B-A3B-Asis (a web-search-agent SFT of Qwen/Qwen3.5-35B-A3B) trained with turn-level GRPO on stop-decision pivot states (PivotRL-style). Instead of optimi…
Downloads · 30 days
27
11% of all-time downloads
All-time downloads
239
Public
Parameters
34.7B
69.3 GB on disk
Likes
1
Public
Click a slice to open those files.
.safetensors69.3 GB · 100%
From the Hugging Face model README
Asis-GRPO is a reinforcement-learning continuation of Qwen3.5-35B-A3B-Asis (a web-search-agent SFT of Qwen/Qwen3.5-35B-A3B) trained with turn-level GRPO on stop-decision pivot states (PivotRL-style). Instead of optimizing whole-episode returns, the policy is optimized specifically at the decision points where an agent chooses between stopping to answer and continuing to search — the locus of over-reflection. Qualitatively, the released checkpoint maintains baseline accuracy while substantially reducing post-answer over-search.
This repository contains the full serving weights (13 safetensors shards, ~65 GB, bf16) plus tokenizer, config, and chat template.
Turn-level GRPO on stop-decision pivot states: mid-trajectory states where the agent has just produced (or is about to produce) enough evidence to answer, and must decide whether to stop or keep searching. Rollouts are generated from each pivot state and rewarded by a deterministic stop-verifier — a rule-based checker of whether the continuation stops appropriately and remains grounded — rather than by a learned reward model.
| Component | Value |
|---|---|
| Algorithm | GRPO (group-relative policy optimization), turn-level |
| Group size | K = 8 rollouts per pivot state |
| Reward | deterministic stop-verifier (rule-based; no learned reward model) |
| KL regularization | to the frozen SFT (Asis) reference policy, coefficient 0.01, low-variance KL estimator |
| Global batch size | 128 sequences (rollout batches of 16 states x K = 8) |
| Released checkpoint | ~32 effective RL steps, selected by a downstream step-sweep |
The RL run was intentionally trained past its useful region and swept checkpoint-by-checkpoint on downstream browsing-agent evaluation. The released step (~32) is the accuracy-neutral over-search-reduction point: the latest checkpoint at which end-task accuracy is statistically indistinguishable from the SFT baseline while post-answer over-search (continued searching after the answer has been stated) is significantly reduced. Later checkpoints trade accuracy or healthy verification behavior for further efficiency and were not released.
Research artifact. Intended for studying stop-decision RL, over-search reduction, and the accuracy-efficiency frontier of tool-using web agents; also usable as a more search-efficient drop-in for the Asis SFT arm on the same tool surface (function-calling tools for web search, page opening, and in-page lookup).