Turning Gemini Robotics On‑Device into Humanoid Specialists
via Non‑Invasive Closed‑Loop Iterative Fine‑Tuning
Yuxin Chen, Hari Srikanth, Nathan Jew, Menglin Wu, Pengcheng Wang, Junli Ren,
Masayoshi Tomizuka, Peng Xu, Jinyu Xie, Ran “Thomas” Tian
Bimanual manipulation
Humanoids
Language-conditioned skills
One generalist policy — many tasks, many embodiments, out of the box. footage: Google DeepMind, Gemini Robotics
$ curl https://api.openai.com/v1/fine_tuning/jobs \ -H "Authorization: Bearer $OPENAI_API_KEY" \ -d '{ "model": "gpt-4o", "training_file": "file-demos-abc123" }' { "object": "fine_tuning.job", "status": "queued", ... } → ft:gpt-4o:your-org::a1b2c3

Box packing
Cup insertion
Bimanual plate handover
success rate % · 100 trials · same demonstrations


Success rate slides as contact gets richer

A limit of SFT-only adaptation — for any policy, not any particular model.

The only access point: a managed SFT API.

problem setting
// the managed SFT interface, abstractly FSFT : D → π D = { (ot, ℓ, at) } obs · instruction · action chunk → returns a fine-tuned policy π exposed: submit data · receive policy hidden: weights ✕ gradients ✕ likelihoods ✕ losses ✕
problem setting
π∗ = arg maxπ 𝔼o ∼ pπ [ Σt Rθ(ot; ℓ) ] − β · KL( π ∥ π0 )
Every route that needs internal signals is ruled out. FSFT only accepts data.
Score deployment rollouts · write the verdict into each training tuple · let the API run ordinary SFT.
The model and its training procedure stay untouched.
the flywheel
A reward model calibrated to human preference scores every rollout, step by step
Each action chunk earns an advantage token, judged against similar states
Fine-tune on successes and failures alike; at inference, the token flips to True
Append, re-fine-tune from the base model, deploy again — a stronger specialist each cycle
↻ 04 hands the new policy back to 01 — the loop is the method
01Score
Tracks surface progress, but misses execution failures — a jerky, unsafe rollout can still “look” complete
Humans judge execution quality reliably — but dense per-step labels for every rollout are prohibitive
Let the VLM generate candidate dense rewards, let human preferences select among them — then distill the winners into one reusable reward model
100 pairwise comparisons is the entire per-rollout labeling budget — plus one short rubric per task.
01Score
K = 12 candidate per-step reward traces per rollout, via temperature sampling
100 rollout pairs, judged side-by-side from three viewpoints by an expert
Qwen3-VL, regressed onto the ≈200 preference-labeled rollouts · per-step, reusable across cycles
Select: keep the candidates whose induced return rankings best match human preferences · calibrate once, score every rollout.
01Score
You are an expert reward labeler for robot manipulation videos. TASK: {TASK_INSTRUCTION} REWARD RUBRIC (anchor scores in [0,100]; interpolate): - 0: no relevant action; robot has not engaged - {RUBRIC} ← milestones → anchor scores HARD FAILURES (override the rubric): if visible in a frame, its reward MUST be 0 — no matter what milestone was reached earlier. Frames arrive in SHUFFLED order — judge each purely on visual content. OUTPUT: JSON — { frame_index, task_reward, frame_description }
01Score
One trace is chosen per rollout; keep the picks whose returns agree with the most human verdicts — A ≻ B should mean GA > GB
Regress per-step rewards onto the ≈200 selected traces · one shared model for all tasks
The human budget is spent exactly once — the distilled Rθ scores every rollout of every later cycle for free.
01Score

01Score
A failed packing episode still contains well-executed chunks · a successful insertion contains chunks a human would reject — episode-level labels can express neither.
02Relabel
most attempts from here fail
most attempts from here succeed
CLIFT’s baseline is non-parametric: retrieve what the robot did from lookalike states.
02Relabel
G(τ) = Σ γΔt Rθ(ot; ℓ)
the chunk’s discounted return over its window



DINOv3 cosine · best frame per rollout
their returns form the comparison set
The percentile threshold auto-calibrates credit to state difficulty · human demonstrations are always Advantage=True.
02Relabel
sim(o, o′) = ⟨φ(o), φ(o′)⟩
φ = frozen DINOv3 (ViT-S/16, d = 384), ℓ2-normalized — cosine similarity on the unit sphere. Nothing task-specific to train.
me = arg maxt sim(oet, oq)
Each other rollout contributes only its single most-similar frame — a trajectory’s near-identical neighboring frames can’t flood the comparison set.
sim ≥ δ → one peer chunk
A single global threshold δ, tuned so a query gathers |N| comparable peers on average. Peers share the starting state — their returns differ mainly in what the policy did next.
No value network, nothing retrained per cycle — the baseline is the robot’s own accumulated experience.
02Relabel

02Relabel
“⟨task prompt⟩,
Advantage=True”
always positive, in every cycle’s dataset
“⟨task prompt⟩,
Advantage=True”
top 30% among peers from similar states
“⟨task prompt⟩,
Advantage=False”
kept as contrastive signal — not discarded
“⟨task prompt⟩”
no advantage token
not every chunk gets a verdict — these stay unlabeled
Observations and actions exactly as executed · both labels are trained on — to FSFT, all of it is ordinary supervised data.
03Condition

03Condition
// every inference call, every task, every cycle o = head cameras (regular + wide) + proprioception ℓ = "Stack the plate from the rack, Advantage=True" a = π(o, ℓ) classifier-free guidance, β = 0.2 execute the 1.6 s action chunk → observe → replan
03Condition
Same family as advantage-conditioned policies & “guidance as policy improvement” — injected purely through data.
04Iterate

04Iterate
Dk = Ddemo ∪ Drollout1:k
πk+1 = FSFT(Dk) from the base checkpoint
04Iterate
Bimanual plate handover · after 2 cycles
Box packing · cup insertion
success rate % · both variants near-perfect on the easier tasks · the gap opens where failures dominate
Failure is not waste — it is exactly the training signal the hard tasks need.
04Iterate
Everything travels through FSFT as ordinary supervised data — the model box never opens.

Whole-body VR teleoperation for demonstrations
Box packing · cup insertion · bimanual plate handover
Whole-body balancing throughout — end-effector pose and contact geometry keep shifting.
Box packing
93%→100%
Cup insertion
70%→98%
Bimanual plate handover
53%→96%
Success rate over 100 trials per task · API-only · no additional human demonstrations
results
100 trials per bar · hatching = flywheel cycle, still dimmed · SFT alone: GROD 93/70/53 · π0.5 59/50/5
results · finding 1
Both GROD recipes beat the SFT baseline at every cycle · dense chunk relabeling wins the hardest task (96 vs ≈84)
results · finding 2
With the high-return recipe, two cycles net a gain on every task — zero model surgery — but progress is uneven, and the ceiling sits far below GROD’s.
results · finding 3
π0.5 granted invasive FiLM conditioning (green) — an architectural change CLIFT forgoes — still trails API-only GROD (blue) on every task (one invasive baseline evaluated).

reorients the box in-hand to set up an easier grasp

recovers from a failed first insertion — retries and succeeds
Behaviors absent from the teleoperated demonstrations.
zero-shot: unseen objects & configs · only the base model differs
The base model sets the ceiling — CLIFT can only climb toward it.
why the collapse
hand is empty ✕
after identical sft · bimanual plate handover GROD53%vsπ0.55%
hypothesis — over-reliance on proprioceptive cues; on-policy SFT may reinforce those correlations.
Task mastery for closed-weight robot foundation models —
without ever opening the model box.
Yuxin Chen, Hari Srikanth, Nathan Jew, Menglin Wu, Pengcheng Wang, Junli Ren,
Masayoshi Tomizuka, Peng Xu, Jinyu Xie, Ran “Thomas” Tian



Learning to reason, act, and self-improve
On-device self-improve
on-device RL that keeps improving the model at deployment
Act · closed loop
real-to-sim closed-loop RL for robots
Learning in sensor-physics joint sim
Reason
RL for task understanding, planning & decision-making
Agentic research
agents propose, run, and analyze the experiments at every layer
This work is supported by Google DeepMind funding.
3
published papers
more under development
7
undergraduate students
working on the robot
1
award
ICRA WBCD challenge
1st in the US · 3rd globally