60
60
60
55
A Unified and Constrained View of Regularization-Based Robust Reinforcement Learning
Paper unifies regularization-based robust RL methods via new performance-gap upper bounds and jointly learned Lagrange multipliers.
The authors derive new upper bounds on the gap between nominal and worst-case deep RL policies, each expressible as an existing regularization objective plus a KL-divergence penalty. Robust training is reformulated as constrained optimization, where prior methods correspond to a fixed Lagrange multiplier. The multiplier is instead updated jointly with the policy, auto-tuning the regularization weight. Adversarial evaluations across several continuous control tasks validate the theory.
20
On the Regularization Landscape for the Linear Recommendation Models
Study shows leading linear recommendation models reduce to nuclear-norm or Frobenius-norm regularization, with two new closed-form low-rank solutions proposed.
The paper unifies top-performing linear recommendation algorithms under a single regularization framework, showing they effectively apply either nuclear-norm or Frobenius-norm regularizers. Nuclear-norm solutions have a rigid structure, are low-rank, and have closed form, while Frobenius-norm solutions are more expressive but full-rank or require hard-to-tune procedures such as ADMM. The authors derive two new low-rank, closed-form solutions that combine the advantages of both regularization families.
22
42
30
42
57
DavidAU/Qwen3.8-27B-TURBO-Fable-Cold-Fusion-735-882-Heretic-Uncensored-NEO-CODER-MAX-MTP-GGUF — new model trending #8 on Hugging Face
A new Qwen3.8-27B GGUF fine-tune claims ARC-C 735 at 8-bit with thinking tokens cut 2x-10x versus the base model.
Independent creator DavidAU released a GGUF fine-tune of Qwen3.8-27B built with Unsloth, claiming ARC-C of 735 at 8-bit and 719 at 4-bit, trending #8 on Hugging Face. The 'TURBO' variant cuts thinking tokens by one half to as much as one tenth while retaining output quality and detail. The repo ships both regular and MTP quants and claims gains over the base model across seven benchmarks, using 'Cold Fusion (GAIN + Unsloth)' and 'Fable Fusion 711' training methods.
42
30
30
55
55
Entropy-Regularized Rank-Masked Policy Optimization for Test-Time Reinforcement Learning in Code Generation
Researchers propose ERPO, enabling test-time reinforcement learning for code generation via probe-executed consensus rewards, rank masking, and entropy regularization.
The paper introduces probe-driven test-time reinforcement learning (TTRL) for code generation, where output-free probe inputs are constructed from problem statements and candidate programs are executed on them to compute a Probe Consensus Reward (PCR). Because PCR can be gamed through spurious consensus, the authors propose Entropy-Regularized Rank-Masked Policy Optimization (ERPO), which turns low-PCR outcomes into conservative negative updates via rank masking and constrains policy drift with an entropy ceiling. On coding benchmarks, ERPO substantially improves pass@1 and pass@k in both in-domain adaptation and zero-shot transfer.
38
30
42
55
55
42
57
57
57
60
55
57
55
60
42
30
60
57
55
30
57
60
57
57
55