Showing 2026Show all
2 papers · 1 filter
cs.CC2026
On the Intractability of the Minimum Distance Problem for Regular LDPC Codes
Chenyuan Jia, Qingqing Peng, Ke Liu +2
The minimum distance problem (MDP) for low-density parity-check (LDPC) codes is a central problem in coding theory and is closely related to the analysis of low-weight codewords an…
cs.LG2026
SFT Overtraining Predicts Rank Inversion via Entropy Collapse Under RLVR
Siddharth Aphale, Kelly Liu
The standard heuristic of selecting the SFT checkpoint with the highest pass@1 for GRPO can fail when SFT compresses the rollout distribution. For binary rewards, the expected with…