Entropy-Regularized Rank-Masked Policy Optimization for Test-Time Reinforcement Learning in Code Generation
Paper recorded by Signals 4 on 2026-09-08 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-08 on arXiv · recorded by Signals 4 on 2026-09-09
Category: cs.LG · 机器学习 · first seen 2026-09-09
Abstract
Existing methods for test-time reinforcement learning (TTRL) derive rewards from answer-level self-voting on unlabeled test-time tasks with canonical answers, but this breaks down for code generation because programs cannot be compared by surface form and therefore do not directly provide a usable training signal. To make TTRL applicable to code generation, we propose probe-driven TTRL, which cons
Read on arXiv →
Cite this page: Entropy-Regularized Rank-Masked Policy Optimization for Test-Time Reinforcement Learning in Code Generation: the #96 most recent of 215 cs.LG papers we have recorded (as of 2026-09-08). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/entropy-regularized-rank-masked-policy-optimization-for-test-time-reinforcement-.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable:
papers.json
Get 4 AI signals a day by email — free.
Get 4 AI signals a day by email — free