arXiv paper· machine learning (reinforcement learning)· method paper

Selective Agent Guidance via Entropy: Learning Autonomous Policies from Imperfect VLM Teachers

Giovanni Bonetta, Matteo Merler, Davide Zago, Rossella Cancelliere, Bernardo Magnini

cs.AI · cs.CL · cs.LG

Quick verdict

SAGE: entropy-gated VLM guidance distilled into PPO via BC; gains on several sparse-reward tasks at low teacher cost, but 3 seeds and mixed wins temper claims.

Summary

The paper proposes SAGE, a framework for training a lightweight reinforcement learning policy from an expensive, imperfect vision-language model (VLM) used as an online teacher. The student (PPO on visual observations) monitors its normalized policy entropy and queries the VLM only above a threshold, executes the suggested action, and distills it through behavioral cloning, with PPO updates restricted to learner-generated transitions; an advantage-weighted cloning variant (AWBC) is proposed to down-weight bad advice. Across six sparse-reward environments plus an exploratory ALFWorld test, SAGE surpasses unguided PPO on CardMaze (1.000 vs 0.007), GoToDoor, Fetch, and ALFWorld, and far exceeds its VLM teacher on CardMaze (1.000 vs 0.000); it fails on EZPoints and falls below PPO on LavaGap (0.688 vs 0.945). VLM queries drop to 1.2–13.3% of training steps with zero calls at deployment. Teacher-quality experiments show weak direct policies (Gemma3-27B scores -3.400 on EZPoints) can still yield optimal learned policies (10.000). Ablations find behavioral cloning essential but advantage weighting unhelpful. Main limitations: only 3 seeds without significance tests, per-environment threshold tuning with high sensitivity, discrete action spaces only, and peak-return reporting.

Review complete

Assessment at a glance

machine learning (reinforcement learning)

5

risk flags identified

● high 0

● medium 4

● low 1

Reproducibility readinessmedium
Code & data availableyes
Review confidencehigh
AI text signal0/20 passages flagged
Deep research viableCode-reproducibleNeeds GPU

5 strengths · 5 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • Querying a VLM teacher only in high-entropy states, executing its actions, and distilling them via behavioral cloning yields autonomous PPO policies that beat unguided RL on several sparse-reward tasks (e.g., CardMaze 1.000 vs 0.007).
  • The learned policy can outperform its own VLM teacher, demonstrated on CardMaze (SAGE 1.000 vs VLM-as-policy 0.000).
  • Selective guidance cuts VLM queries to 1.2–13.3% of training steps and requires zero VLM calls at deployment.
  • A VLM's closed-loop policy performance does not predict its usefulness as a teacher (Gemma3-27B scores -3.400 directly on EZPoints but enables 10.000 via SAGE).
  • Behavioral-clone distillation of guided actions is essential, while advantage-weighted distillation (AWBC) provides no consistent benefit.

Strengths

  • Unusually honest negative results and boundary conditions

    SAGE loses to plain PPO on LavaGap (0.688 vs 0.945), fails on EZPoints with the default teacher, and is far below the VLM it distills on Fetch (0.122 vs 0.310); Sec 5.2 analyzes these as teacher-quality failures rather than hiding them.

  • Teacher-quality analysis is a genuine empirical contribution

    Table 2 shows direct-policy competence does not predict teacher usefulness: Gemma3-27B scores -3.400 acting directly on EZPoints, yet Gemma-guided SAGE reaches the optimum 10.000 while Qwen-guided SAGE stays at 0.000; a random-teacher control confirms uninformative guidance never helps.

  • Decisive ablation isolating the essential mechanism

  • Transparent cost accounting

  • Long-horizon control separates trajectory discovery from sample efficiency

Weaknesses

  • Statistical fragility of headline comparisons

  • Optimistic, under-specified evaluation metric

  • The teacher-exceeding claim rests on a self-introduced environment

  • Per-environment threshold tuning with collapse sensitivity

  • Baseline budget asymmetry and an unsupported headline component

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

SAGE (arXiv 2609.01567v2) addresses learning a cheap autonomous RL policy from an expensive, frozen, imperfect VLM teacher. Its claims: (1) entropy-gated selective queries plus execution plus BC distillation beat unguided PPO on several sparse-reward tasks; (2) the learned policy can exceed its teacher (CardMaze 1.000 vs 0.000); (3) VLM usage drops to 1.2–13.3% of training steps with zero calls at deployment; (4) advantage-weighted distillation can exploit environment feedback to filter bad advice. Evaluation spans visual FrozenLake 8×8, three MiniGrid tasks, EZPoints, the authors' novel CardMaze, plus exploratory ALFWorld — 100k steps (40k ALFWorld), 3 seeds, Qwen3.5-27B as default teacher, Gemma3-27B on ALFWorld and in the teacher-quality study.

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 5 strengths & 5 weaknesses, analyzed in detail
  • 5 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What is SAGE in reinforcement learning?

SAGE (Selective Agent Guidance via Entropy) is a training framework in which a lightweight PPO agent queries an expensive vision-language model only when its policy entropy — used as an uncertainty proxy — exceeds a threshold. The VLM's suggested action is executed in the environment and learned via behavioral cloning. The deployed policy acts entirely without the VLM.

Does the SAGE-trained policy outperform its VLM teacher?

Only in some settings. On CardMaze the teacher scores 0.000 acting directly while the SAGE policy reaches 1.000. But on Fetch, the VLM-as-policy (0.310) far outperforms the learned policy (0.122), and on LavaGap SAGE (0.688) is worse than plain unguided PPO (0.945).

How much does SAGE reduce VLM usage compared to using a VLM as the policy?

Per the paper's Table 9, SAGE queries the teacher on 1.2%–13.3% of training steps across its six controlled environments (26.9% on exploratory ALFWorld), versus one call per step for always-query methods; at evaluation/deployment the learned policy makes zero VLM calls.

Is code or data available for the SAGE paper (arXiv 2609.01567)?

The paper points to github.com/giobin/SAGE and says code, prompts, and the new CardMaze environment assets will be released under a permissive license. All VLM prompts and hyperparameters are reproduced in Appendices A, B, and F; environments (Gymnasium, MiniGrid, ALFWorld) and teacher models (Qwen3.5-27B, Gemma3-27B) are public.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Table 5's column-to-value alignment is garbled by PDF extraction; in particular, which environments receive the AWBC temperature (τ=0.5 vs '—') is read with residual ambiguity, though the ν values per environment are clear.

Go deeper on this paper

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
Selective Agent Guidance via Entropy: Learning Autonomous Policies from Imperfect VLM Teachers | Evolve.Pub