Skip to content

Marginal Coverage Credit Reduces Redundant Exploration in Parallel State-Entropy Optimization

Aug 2026 · 0 citations · 32 references
Computer Science

TL;DR

Marginal Coverage Credit for PGPSE (MCC-PGPSE), which combines leave-one-policy-out coverage with state-owner specialization to estimate policy-specific credit, is introduced and supports contribution-conditioned auxiliary reward allocation as an interpretable approach to improving complementary coverage among parallel policies in discrete state spaces.

Abstract

Policy Gradient for Parallel State Entropy maximization (PGPSE) expands state-space coverage by training independently parameterized policies in replicated copies of the same environment. However, its pooled team-entropy score measures only collective exploration and cannot identify policies that contribute non-redundant coverage. We introduce Marginal Coverage Credit for PGPSE (MCC-PGPSE), which combines leave-one-policy-out coverage with state-owner specialization to estimate policy-specific credit. MCC-PGPSE preserves PGPSE's pooled objective and redistributes non-negative auxiliary intrinsic rewards according to these credits without changing their total mass. This redistribution is designed to discourage redundant visitation and promote complementary coverage. We evaluated MCC-PGPSE in controlled environments, seven public discrete-state benchmarks, and representative Room and Maze settings from the original PGPSE protocol. Across all tested settings, MCC-PGPSE produced positive final window gains in normalized team state entropy and state support over the Entropy baseline. Controlled-task comparisons and the fixed-suite public aggregate were significant, whereas five-seed original-protocol comparisons were directionally consistent. Ablations and credit alignment controls indicate that most gains arise from leave-one-policy-out coverage rather than non-uniform weighting, mismatched credit, or neural novelty alone. These results support contribution-conditioned auxiliary reward allocation as an interpretable approach to improving complementary coverage among parallel policies in discrete state spaces.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Semifactual Credit-Augmented Policy Optimization

Reinforcement learning with verifiable rewards (RLVR) has improved the reasoning capabilities of large language models (LLMs), yet their predictions remain sensitive to task-irrelevant prompt features. We investigate this sensitivity through semifactual prompt interventions that preserve the underlying problem and its...

Jun-Shu Pan, Zhi-Zhang Fu, Shu-Lin Huang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Advancing Entropy-Level Credit Assignment in RLVR via Proximal Entropy Policy Optimization

Value-model-free RLVR methods such as GRPO assign uniform advantages to all tokens in a rollout, ignoring that tokens contribute unequally. Recent methods use token entropy as an importance proxy but compute it globally across the batch, conflating importance with prompt difficulty and positional trends. We argue that...

Yunghyun Kim, Nojun Kwak · 0 citations
#machine learning Preprint Aug 2026

Influence-Directed Distillation: Solving the Diversity Bottleneck in Sampled-Token On-Policy Distillation

Experiments show Influence-Directed Adaptive On-Policy Distillation (IDA-OPD), rather than relying on costly full-vocabulary Forward-KL objectives, preserves entropy-expanding updates while replacing entropy-contracting ones with divergence-adaptive advantage shrinkage, using only the teacher's sampled-token log-probab...

Run Yang, Runpeng Dai, Jie Sun et al. · 2 citations
#artificial intelligence Preprint Sep 2026

HISPO: Hierarchical Importance-Sampling Policy Optimization with Entropy-Derived Segments

HISPO is introduced, a segment-level policy-optimization method that constructs rollout-time entropy-derived contiguous segments, assigns soft entropy-based saliency weights, and applies clipped importance-sampling correction at the segment granularity, suggesting that segment-level correction is a promising granularit...

Quoc-Vinh Lai-Dang, Hyo-Sang Shin · 0 citations
#artificial intelligence Preprint Sep 2026

CREDO: Variance-Guided Rubric Evolution for Replay-Corrected Credit Assignment

Credo is proposed, a framework that couples evolving semantic rubrics with selective, execution-based credit correction, and derives conditional unbiasedness and a variance decomposition that connects two design choices: which rubric features to retain, and where to allocate a fixed expected replay budget.

Xuxian Hu · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.