An MRP Formulation for Supervised Learning: Generalized Temporal Difference Learning Models
Yangchen Pan, Junfeng Wen, Chenjun Xiao, Philip Torr

TL;DR
This paper introduces a novel Markov reward process-based framework for supervised learning, reformulating it as a policy evaluation problem in reinforcement learning, and develops a generalized TD algorithm with proven convergence and practical benefits.
Contribution
It presents a new MRP formulation for supervised learning, connecting TD learning with OLS, and introduces a generalized Bellman operator with convergence guarantees.
Findings
TD solutions outperform OLS when noise is correlated.
The generalized Bellman operator has a unique fixed point.
Empirical results demonstrate the method's effectiveness across datasets.
Abstract
In traditional statistical learning, data points are usually assumed to be independently and identically distributed (i.i.d.) following an unknown probability distribution. This paper presents a contrasting viewpoint, perceiving data points as interconnected and employing a Markov reward process (MRP) for data modeling. We reformulate the typical supervised learning as an on-policy policy evaluation problem within reinforcement learning (RL), introducing a generalized temporal difference (TD) learning algorithm as a resolution. Theoretically, our analysis establishes connections between the solutions of linear TD learning and ordinary least squares (OLS). Under specific conditions -- particularly when the noise is correlated -- the TD solution serves as a more effective estimator than OLS. Furthermore, we show that when our algorithm is applied with many commonly used loss functions --…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsSpeech Recognition and Synthesis
