April 25, 2024, 7:42 p.m. | Yangchen Pan, Junfeng Wen, Chenjun Xiao, Philip Torr

cs.LG updates on arXiv.org arxiv.org

arXiv:2404.15518v1 Announce Type: new
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 draws connections between …

abstract arxiv cs.ai cs.lg data data modeling difference distributed distribution generalized markov modeling paper probability process statistical supervised learning temporal type

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne