43 citations · 103 across the 26 of their papers we have counts for
26 papers
Dynamic Resource Allocation for Ensemble Determinization MCTS
Jakub Kowalski, Adam Ciężkowski, Artur Krzyżyński +1
Simulation-based algorithms are especially suited for high-uncertainty environments such as adversarial board games with significant elements of randomness and hidden information.…
Magic-Informed Quantum Architecture Search
Vincenzo Lipardi, Domenica Dibenedetto, Georgios Stamoulis +1
Nonstabilizerness, commonly referred to as magic, is a fundamental resource underpinning quantum advantage. In this paper, we propose a magic-informed quantum architecture search (…
StratFormer: Adaptive Opponent Modeling and Exploitation in Imperfect-Information Games
Andy Caen, Mark H. M. Winands, Dennis J. N. J. Soemers
We present StratFormer, a transformer-based meta-agent that learns to simultaneously model and exploit opponents in imperfect-information games through a two-phase curriculum. The…
An Efficient Algorithm for Thresholding Monte Carlo Tree Search
Shoma Nameki, Atsuyoshi Nakamura, Junpei Komiyama +1
We introduce the Thresholding Monte Carlo Tree Search problem, in which, given a tree and a threshold , a player must answer whether the root node value of $\mathc…
Asymmetric regularization mechanism for GAN training with Variational Inequalities
Spyridon C. Giagtzoglou, Mark H. M. Winands, Barbara Franci
We formulate the training of generative adversarial networks (GANs) as a Nash equilibrium seeking problem. To stabilize the training process and find a Nash equilibrium, we propose…
A 1-bit quantum filter for particle trajectory reconstruction
Xenofon Chiotopoulos, Davide Nicotra, George Scriven +5
The transition to the High-Luminosity Large Hadron Collider (HL-LHC) presents a computational challenge where particle reconstruction complexity may outpace classical computing res…