Reinforcement Learning with Action-Triggered Observations

We introduce Action-Triggered Sporadically Traceable Markov Decision Processes (ATST-MDPs), a reinforcement learning framework for partial observability in which full state observations occur stochastically at each step, with probability determined by the chosen action. We derive Bellman equations tailored to this setting and establish the existence of an optimal policy. Exploiting the fact that sporadic observations reveal the full state, we provide an equivalent formulation in which agents commit to action-sequences between consecutive observations. Under the linear MDP assumption, we show that the value function over such action-sequences admits a linear representation in a finite-dimensional feature map, enabling standard regression-based methods. As an application, we derive ATST-LSVI-UCB, an optimistic algorithm achieving regret widetildeO(√Kd3(1-γ)-3) for episodic learning with geometrically distributed horizons, where K is the number of episodes, d the feature dimension, and γ the discount factor (episode continuation probability), matching the known rate for linear MDPs with full observability.