Imagen de Portada

PMCTS: Particle Monte Carlo Tree Search for Principled Parallelized Inference Time Scaling

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Oren, Yaniv, Vadocz, Viliam, de Vries, Joery A., Böhmer, Wendelin, Spaan, Matthijs T. J., Baier, Hendrik
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Epistemic Monte Carlo Tree Search
por: Oren, Yaniv, et al.
Publicado: (2022)

Twice Sequential Monte Carlo for Tree Search
por: Oren, Yaniv, et al.
Publicado: (2025)

Trust-Region Twisted Policy Improvement
por: de Vries, Joery A., et al.
Publicado: (2025)

VariBASed: Variational Bayes-Adaptive Sequential Monte-Carlo Planning for Deep Reinforcement Learning
por: de Vries, Joery A., et al.
Publicado: (2026)

Diverse Projection Ensembles for Distributional Reinforcement Learning
por: Zanger, Moritz A., et al.
Publicado: (2023)

AlphaExploitem: Going Beyond the Nash Equilibrium in Poker by Learning to Exploit Suboptimal Play
por: Murgoci, Vlad, et al.
Publicado: (2026)

Exploration Implies Data Augmentation: Reachability and Generalisation in Contextual MDPs
por: Weltevrede, Max, et al.
Publicado: (2024)

Explore-Go: Leveraging Exploration for Generalisation in Deep Reinforcement Learning
por: Weltevrede, Max, et al.
Publicado: (2024)

How Ensembles of Distilled Policies Improve Generalisation in Reinforcement Learning
por: Weltevrede, Max, et al.
Publicado: (2025)

Value Improved Actor Critic Algorithms
por: Oren, Yaniv, et al.
Publicado: (2024)

Sparse Masked Attention Policies for Reliable Generalization
por: Horsch, Caroline, et al.
Publicado: (2026)

Universal Value-Function Uncertainties
por: Zanger, Moritz A., et al.
Publicado: (2025)

Bayesian Meta-Reinforcement Learning with Laplace Variational Recurrent Networks
por: de Vries, Joery A., et al.
Publicado: (2025)

TransZero: Parallel Tree Expansion in MuZero using Transformer Networks
por: Malmsten, Emil, et al.
Publicado: (2025)

On the Equivalence of Random Network Distillation, Deep Ensembles, and Bayesian Inference
por: Zanger, Moritz A., et al.
Publicado: (2026)

EfficientTDMPC: Improved MPC Objectives for Sample-Efficient Continuous Control
por: Evers, Thomas, et al.
Publicado: (2026)

Contextual Similarity Distillation: Ensemble Uncertainties with a Single Model
por: Zanger, Moritz A., et al.
Publicado: (2025)

Improving Robustness of AlphaZero Algorithms to Test-Time Environment Changes
por: Tamassia, Isidoro, et al.
Publicado: (2025)

RecBayes: Recurrent Bayesian Ad Hoc Teamwork in Large Partially Observable Domains
por: Ribeiro, João G., et al.
Publicado: (2025)

To the Max: Reinventing Reward in Reinforcement Learning
por: Veviurko, Grigorii, et al.
Publicado: (2024)

Mitigating Premature Exploitation in Particle-based Monte Carlo for Inference-Time Scaling
por: Giannone, Giorgio, et al.
Publicado: (2025)

You Shall Pass: Dealing with the Zero-Gradient Problem in Predict and Optimize for Convex Optimization
por: Veviurko, Grigorii, et al.
Publicado: (2023)

Generalisation to unseen topologies: Towards control of biological neural network activity
por: Engwegen, Laurens, et al.
Publicado: (2024)

Rollout Roulette: A Probabilistic Inference Approach to Inference-Time Scaling of LLMs using Particle-Based Monte Carlo Methods
por: Puri, Isha, et al.
Publicado: (2025)

Distributed Influence-Augmented Local Simulators for Parallel MARL in Large Networked Systems
por: Suau, Miguel, et al.
Publicado: (2022)

Positive Experience Reflection for Agents in Interactive Text Environments
por: Lippmann, Philip, et al.
Publicado: (2024)

Bad Habits: Policy Confounding and Out-of-Trajectory Generalization in RL
por: Suau, Miguel, et al.
Publicado: (2023)

What model does MuZero learn?
por: He, Jinke, et al.
Publicado: (2023)

ETS: Efficient Tree Search for Inference-Time Scaling
por: Hooper, Coleman, et al.
Publicado: (2025)

Off-Policy Safe Reinforcement Learning with Constrained Optimistic Exploration
por: Li, Guopeng, et al.
Publicado: (2026)

Monte Carlo Tree Search with Boltzmann Exploration
por: Painter, Michael, et al.
Publicado: (2024)

Doubly Robust Monte Carlo Tree Search
por: Liu, Manqing, et al.
Publicado: (2025)

Entropic Risk-Aware Monte Carlo Tree Search
por: Santos, Pedro P., et al.
Publicado: (2026)

An Efficient Algorithm for Thresholding Monte Carlo Tree Search
por: Nameki, Shoma, et al.
Publicado: (2026)

Improving Monte Carlo Tree Search for Symbolic Regression
por: Huang, Zhengyao, et al.
Publicado: (2025)

Anytime Sequential Halving in Monte-Carlo Tree Search
por: Sagers, Dominic, et al.
Publicado: (2024)

Monte Carlo Tree Search in the Presence of Transition Uncertainty
por: Kohankhaki, Farnaz, et al.
Publicado: (2023)

Improving GFlowNets with Monte Carlo Tree Search
por: Morozov, Nikita, et al.
Publicado: (2024)

Monte Carlo Permutation Search
por: Cazenave, Tristan
Publicado: (2025)

Priors Matter: Addressing Misspecification in Bayesian Deep Q-Learning
por: van der Vaart, Pascal R., et al.
Publicado: (2025)