arXiv Statistics ML
Reinforcement Learning with Multi-Step Lookahead Information Via Adaptive Batching
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Oct 19
Reinforcement Learning in MDPs with Information-Ordered Policies
The paper introduces a framework for reinforcement learning in Markov decision processes where policies are ordered by the information they provide, allowing data from one policy to estimate the performance of others. An epoch‑based algorithm is developed for infinite‑horizon average‑cost MDPs with continuous state and action spaces, achieving regret that scales with the width of the policy class’s information order. The authors apply the framework to lost‑sales inventory, dual‑sourcing, and state‑dependent queueing systems, demonstrating improved regret bounds and empirical performance without requiring global convexity or specific arrival‑rate structures.
arXiv Machine Learning
Jun 16
Fast Non-Episodic Finite-Horizon RL with K-Step Lookahead Thresholding
arXiv:2602. 00781v2 Announce Type: replace Abstract: Online reinforcement learning in non-episodic, finite-horizon MDPs remains underexplored and is challenged by the need to estimate returns to a fixed terminal time.
arXiv Machine Learning
Oct 27
Reinforcement Learning with Multi-Step Transition Predictions: A Bellman Theory
arXiv:2610.32887v1 Announce Type: new Abstract: Multi-step predictions of future transition realizations can improve reinforcement learning, but their value remains difficult to quantify. Directly in...
arXiv Machine Learning
Sep 11
Near-Optimal Reinforcement Learning with Multi-Step Transition Lookahead
The paper investigates reinforcement learning with multi‑step transition look‑ahead, where an agent can foresee the states resulting from any sequence of λ actions before choosing its next move. It proves that exact planning remains NP‑hard for every fixed rational discount factor γ in (0,1), and introduces a randomized polynomial‑time approximation scheme that works for any fixed look‑ahead depth. Extending this to unknown transitions and stochastic rewards, the authors develop an algorithm with cumulative regret matching classical tabular discounted RL up to logarithmic factors, showing that efficient near‑optimal planning and learning are achievable despite the NP‑hardness of exact planning.
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.
Hugging Face Trending Papers
Sep 30
Learning Infinite-Horizon Average-Reward CMDPs via State Augmentation
We study infinite-horizon average-reward constrained Markov decision processes (CMDPs) under the weakly communicating assumption. Existing high-probability guarantees for this setting either require c...