Abstract:Standard supervised classification trains models to imitate the exact labels provided by a perfect oracle. This imitation happens in a single pass, restricting the model to a fixed compute budget even when inputs vary in complexity. Moreover, the rigid training objective forces the model to express absolute certainty on its training data, resulting in overconfident predictions during evaluation. We propose Reinforced Iterative Classification (RIC), which replaces the imitative objective with Reinforcement Learning (RL). RIC deploys a recurrent agent that iteratively updates a predictive distribution over classes, receiving reward for stepwise improvement in prediction quality. The value function provides a natural halting criterion by estimating the remaining scope for improvement. We prove that the iterative formulation recovers the same optimal predictions as cross-entropy while yielding an anytime classifier. On image classification benchmarks, RIC matches the accuracy of supervised baselines with improved calibration and learns to allocate computation adaptively across inputs.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.22110 [cs.LG] |
| (or arXiv:2604.22110v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.22110 arXiv-issued DOI via DataCite (pending registration) |
From: Mahdi Kallel [view email]
[v1]
Thu, 23 Apr 2026 23:06:48 UTC (893 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。