Uses word embeddings on action sequences from gameplay data to produce domain-independent game abstractions via vector clustering, with experiments showing effectiveness but no outperformance over specialized methods.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4representative citing papers
Adapting the KGW watermark to game strategies in extensive-form games enables statistical detection of watermarked agents with bounded expected-utility degradation.
AIVAT heuristics can be gamed for pathological low variance or p-hacking unless fixed before data observation, and uncertainty propagation yields additional variance reduction at possible cost to unbiasedness.
Reframing CFR as linear algebra operations enables GPU parallelization with up to 10,000x speedup over standard CPU implementations.
citing papers explorer
-
Domain-Independent Game Abstraction using Word Embedding Techniques
Uses word embeddings on action sequences from gameplay data to produce domain-independent game abstractions via vector clustering, with experiments showing effectiveness but no outperformance over specialized methods.
-
Watermarking Game-Playing Agents in Perfect-Information Extensive-Form Games
Adapting the KGW watermark to game strategies in extensive-form games enables statistical detection of watermarked agents with bounded expected-utility degradation.
-
Heuristic Pathologies and Further Variance Reduction via Uncertainty Propagation in the AIVAT Family of Techniques
AIVAT heuristics can be gamed for pathological low variance or p-hacking unless fixed before data observation, and uncertainty propagation yields additional variance reduction at possible cost to unbiasedness.
-
Parallelizing Counterfactual Regret Minimization
Reframing CFR as linear algebra operations enables GPU parallelization with up to 10,000x speedup over standard CPU implementations.