[KongchangAI]
Unverified50% confidenceFactExact time

This study derives closed-form optimal policies for the pass@k and max@k objectives under KL regularization, showing that @k optimization is essentially redistributing learning pressure according to problem difficulty, shifting the optimization focus from easy problems to hard ones.

1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen

Sources

Related Entities

Related Claims

Cite This Claim

Stable URI
https://kongchang.com/claim/1130869
API
curl https://kongchang.com/api/v1/knowledge/claims/1130869
MCP
get_claim(id=1130869)