activity
20172026
most citedImproving Search with Supervised Learning in Trick-Based Card Games

14 citations · 14 across the 5 of their papers we have counts for

collaborators

11 papers

cs.LG2026

Universal Sample-Based Embeddings of Higher-Order Objects

Radovan Haluška, Christopher Solinas, Nathan R. Sturtevant +2

Neural networks operate naturally on finite-dimensional vectors, yet many problems require reasoning about higher-order objects such as distributions, functions, and graphs. Such o…

cs.AI2026

Belief Embedding Tree Search

Christopher Solinas, Radovan Haluška, Martin Schmid +3

Beliefs in a Partially Observable Markov Decision Process (POMDP) are posterior distributions over the hidden state given the agent's history of actions and observations. They summ…

cs.AI2026

GTO Wizard Benchmark

Marc-Antoine Provost, Nejc Ilenic, Christopher Solinas +1

We introduce GTO Wizard Benchmark, a public API and standardized evaluation framework for benchmarking algorithms in Heads-Up No-Limit Texas Hold'em (HUNL). The benchmark evaluates…

cs.LG2025

Neural Bayesian Filtering

Christopher Solinas, Radovan Haluska, David Sychrovsky +6

Sequential estimation under partial observability requires tracking beliefs that may be high-dimensional, multimodal, and non-Gaussian. Classical Bayesian filters generalize zero-s…

cs.GT2025

Approximating Nash Equilibria in General-Sum Games via Meta-Learning

David Sychrovský, Christopher Solinas, Revan MacQueen +4

Nash equilibrium is perhaps the best-known solution concept in game theory. Such a solution assigns a strategy to each player which offers no incentive to unilaterally deviate. Whi…

cs.AI2024

Transformer Based Planning in the Observation Space with Applications to Trick Taking Card Games

Douglas Rebstock, Christopher Solinas, Nathan R. Sturtevant +1

Traditional search algorithms have issues when applied to games of imperfect information where the number of possible underlying states and trajectories are very large. This challe…