arXiv AI
Power Mean Estimation in Stochastic Continuous Monte Carlo Tree Search
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jun 19
Flickering Multi-Armed Bandits
arXiv:2602. 17315v3 Announce Type: replace-cross Abstract: We introduce Flickering Multi-Armed Bandits (FMAB) to model sequential decision-making in environments with changing action availability, where accessibility of the next action is restricted to a subset dependent on the agent's current choice.
arXiv Machine Learning
2d ago
Strong and Compact Policies for Submodular Markov Decision Processes via LP-Based Submodular Orienteering
arXiv:2609.15539v1 Announce Type: cross Abstract: Finding policies for Markov Decision Processes (MDPs) is a central problem in areas such as Reinforcement Learning and Operations Research. Here, we...
arXiv AI
Jul 7
Graph Sparse Sampling: Breaking the Curse of the Horizon in Continuous MDP Planning
arXiv:2607. 05359v1 Announce Type: new Abstract: Planning under uncertainty in continuous domains is essential for autonomous systems, yet computationally demanding.
arXiv AI
Jul 13
Risk-Aware General-Utility Markov Decision Processes
arXiv:2607. 09298v1 Announce Type: cross Abstract: We study general-utility Markov decision processes (GUMDPs) with risk-aware objectives.
Hugging Face Trending Papers
Jul 6
Graph Sparse Sampling: Breaking the Curse of the Horizon in Continuous MDP Planning
Planning under uncertainty in continuous domains is essential for autonomous systems, yet computationally demanding. Tree-based search methods such as Monte Carlo Tree Search (MCTS) remain popular, but their branching structure can require sampling budgets that grow exponentially with lookahead depth in the worst case.
arXiv Machine Learning
Jun 24
Posterior Sampling Reinforcement Learning with Gaussian Processes for Continuous Control: Sublinear Regret Bounds for Unbounded State Spaces
arXiv:2603. 08287v2 Announce Type: replace-cross Abstract: We analyze the Bayesian regret of the Gaussian process posterior sampling reinforcement learning (GP-PSRL) algorithm.