arXiv Machine Learning June 11, 2026 By Alexander Ryabchenko, Wenlong Mou

Reinforcement Learning with Action-Triggered Observations

Read the original on arXiv Machine Learning →

arXiv:2510. 02149v2 Announce Type: replace Abstract: 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.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 1

End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions

arXiv:2603. 23461v2 Announce Type: replace Abstract: We study reinforcement learning (RL) with linear function approximation in Markov Decision Processes (MDPs) satisfying \emph{linear Bellman completeness} -- a fundamental setting where the Bellman backup of any linear value function remains linear.

By Zakaria Mhammedi, Alexander Rakhlin, Nneka Okolo

reinforcement-learning

arXiv Machine Learning

Jun 3

Minimax Optimal Strategy for Delayed Observations in Online Reinforcement Learning

arXiv:2603. 03480v2 Announce Type: replace Abstract: We study reinforcement learning with delayed state observation, where the agent observes the current state after some random number of time steps.

By Harin Lee, Kevin Jamieson

agents reinforcement-learning

arXiv Machine Learning

Jun 2

Minimax-Optimal Policy Regret in Partially Observable Markov Games

arXiv:2606. 02363v1 Announce Type: new Abstract: We study sequential decision-making in partially observable environments against strategic, adaptive opponents, modeled as partially observable Markov games (POMGs).

By Raman Arora

arXiv Machine Learning

Jul 21

Theoretical Foundations of $\max$@$k$ Reinforcement Learning

arXiv:2607. 17823v1 Announce Type: new Abstract: Reinforcement Learning is a cornerstone technique for modern large reasoning models.

By Riccardo Poiani, Martino Bernasconi, Andrea Celli

agents reinforcement-learning

arXiv AI

Jul 22

Toward Learning POMDPs Beyond Full-Rank Actions and State Observability

arXiv:2601. 18930v4 Announce Type: replace-cross Abstract: We are interested in enabling autonomous agents to learn and reason about systems with hidden states, such as locking mechanisms.

By Seiji Shaw, Travis Manderson, Chad Kessens, Nicholas Roy

agents reinforcement-learning

arXiv Machine Learning

Jul 13

Stochastic Linear Bandits with Partially Observed Actions

arXiv:2607. 08971v1 Announce Type: new Abstract: The stochastic linear bandit, where actions are represented as vectors and rewards are linear, is a central paradigm for sequential decision making.

By Gautam Dasarathy, Vineet Gattani, Lalit Jain

agents reinforcement-learning

Related stories

End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions

Minimax Optimal Strategy for Delayed Observations in Online Reinforcement Learning

Minimax-Optimal Policy Regret in Partially Observable Markov Games

Theoretical Foundations of $\max$@$k$ Reinforcement Learning

Toward Learning POMDPs Beyond Full-Rank Actions and State Observability

Stochastic Linear Bandits with Partially Observed Actions