arXiv: cs.AI preprintsInternational19 November 2026
Proximal Targets: Training Looped Refiners on Problems with Many Correct Answers
This is an official announcement record
Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2611.22737v1 Announce Type: new Abstract: Looped refiners such as HRM and TRM apply one small network repeatedly to a draft answer, and deep supervision trains every pass toward one stored answer per puzzle. We prove that when a puzzle has many correct answers this target sets a loss floor that no model capacity removes, and that the loss-minimising pass blends the answers into an invalid grid. We propose the proximal target: train each pass toward the correct answer nearest to its own input, found by scanning a list of answers, by a search solver started at the draft, or within a band o
Read the official announcement
Opens arxiv.org
More from arXiv: cs.AI preprints
- Human-AI Mutualism Is Unstable under Capability Asymmetry20 November 2026
- Training Language Models for Introspective Oversight20 November 2026
- Where the Tokens Go: Heat, Entropy and Error in Agentic Coding20 November 2026
- HardwareDx: A Foundational Graph Model System for Datacenter Machine Repairs20 November 2026
- RFBench: A Simulator-Grounded Multimodal Benchmark for Passive RF Layout Design and Understanding20 November 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.