State Abstraction
Overview
State abstraction groups detailed states into simpler representations so agents and models can plan, learn, or act with less memory and data. Approaches include Markov and bisimulation quotients, decision- and task-conditioned representations, causal or topology-aware grouping, learned clustering, and hierarchical abstractions; they are tested in settings such as tabular MDPs, mazes, offline goal-conditioned learning, delayed control, and robotic planning. The central challenge is choosing what to preserve: abstractions that retain full predictive detail may be unnecessarily large, while aggressive compression can hide distinctions that matter for rewards, transitions, or transfer. Current work combines guarantees on value or plan preservation with adaptive and data-driven methods, but reliably balancing compression, decision quality, and generalization remains open.
Latest papers
27 papers0 papers in the last four weeks, down 100% on the four weeks before. 0.0% of all new papers.