Downloads · 30 days
16
8% of all-time downloads
Minbyul/Qwen3.5-35B-A3B-Correct-GRPO
Qwen3.5-35B-A3B-Correct-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.
Correct-GRPO is a reinforcement-learning continuation of Qwen3.5-35B-A3B-Correct (the correctness-filtered SFT arm of a four-arm web-search-agent study on Qwen/Qwen3.5-35B-A3B) trained with turn-level GRPO on stop-dec…
Downloads · 30 days
16
8% of all-time downloads
All-time downloads
208
Public
Parameters
34.7B
69.3 GB on disk
Likes
0
Public
Click a slice to open those files.
.safetensors69.3 GB · 100%
From the Hugging Face model README
Correct-GRPO is a reinforcement-learning continuation of Qwen3.5-35B-A3B-Correct (the correctness-filtered SFT arm of a four-arm web-search-agent study on Qwen/Qwen3.5-35B-A3B) trained with turn-level GRPO on stop-decision pivot states (PivotRL-style). It applies the same RL recipe as Qwen3.5-35B-A3B-Asis-GRPO to a different SFT initialization, and exists primarily as the study's evidence that the safe RL window is base-dependent: on this initialization the beneficial region closes far earlier, and the released checkpoint sits at that earlier sweet spot (~14 effective RL steps vs ~32 for the Asis base).
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 must decide between stopping to answer and continuing to search. Rollouts from each pivot state are rewarded by a deterministic stop-verifier (rule-based; no 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 (Correct) reference policy, coefficient 0.01, low-variance KL estimator |
| Global batch size | 128 sequences (rollout batches of 16 states x K = 8) |
| Released checkpoint | ~14 effective RL steps, selected by a downstream step-sweep |
As with the Asis-based run, the RL run was swept checkpoint-by-checkpoint on downstream browsing-agent evaluation, and the released step is the accuracy-neutral over-search-reduction point for this base. The step-sweep found that on the correctness-filtered initialization, accuracy regression sets in several times earlier and more sharply than on the unfiltered Asis initialization — hence the much earlier selected checkpoint. This asymmetry is a central observation of the study: the same stop-decision RL recipe has a base-dependent safe window, and checkpoints (or step budgets) must not be transplanted across initializations.
Research artifact. Intended for studying how the SFT initialization shapes the safe window of stop-decision RL, and for arm-invariance / generality analyses alongside its Asis-based counterpart. It expects a browsing-agent tool surface compatible with its training format (function-calling tools for web search, page opening, and in-page lookup).