KrwEmd: Revising the Imperfect-Recall Abstraction from Forgetting Everything

• URL: http://arxiv.org/abs/2511.12089v1
• Date: Sat, 15 Nov 2025 08:15:50 GMT
• Title: KrwEmd: Revising the Imperfect-Recall Abstraction from Forgetting Everything
• Abstract summary: This paper presents KrwEmd, the first practical algorithm designed to address this problem.<n>We first introduce the k-recall winrate feature, which not only qualitatively distinguishes signal observation infosets by leveraging both future and, crucially, historical game information, but also quantitatively captures their similarity.<n>We then develop the KrwEmd algorithm, which clusters signal observation infosets using earth mover's distance to measure discrepancies between their features.
• Score: 26.872387657059775
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Excessive abstraction is a critical challenge in hand abstraction-a task specific to games like Texas hold'em-when solving large-scale imperfect-information games, as it impairs AI performance. This issue arises from extreme implementations of imperfect-recall abstraction, which entirely discard historical information. This paper presents KrwEmd, the first practical algorithm designed to address this problem. We first introduce the k-recall winrate feature, which not only qualitatively distinguishes signal observation infosets by leveraging both future and, crucially, historical game information, but also quantitatively captures their similarity. We then develop the KrwEmd algorithm, which clusters signal observation infosets using earth mover's distance to measure discrepancies between their features. Experimental results demonstrate that KrwEmd significantly improves AI gameplay performance compared to existing algorithms.

Related papers

• Decision Making under Imperfect Recall: Algorithms and Benchmarks [77.12503122836422]
  We introduce the first benchmark suite for imperfect-recall decision problems.<n>Our benchmarks capture a variety of problem types, including ones concerning privacy in AI systems.<n>We evaluate the performance of different algorithms for finding first-order optimal strategies in such problems.
  arXiv  Detail & Related papers  (2026-02-16T23:19:01Z)
• Beyond Outcome-Based Imperfect-Recall: Higher-Resolution Abstractions for Imperfect-Information Games [26.872387657059775]
  Hand abstraction is crucial for scaling imperfect-information games (IIGs) such as Texas Hold'em.<n>We introduce signal observation ordered games (SOOGs), a subclass of IIGs tailored to hold'em-style games that cleanly separates signal from player action sequences.<n>We show that mainstream outcome-based imperfect-recall algorithms suffer substantial losses by arbitrarily discarding historical information.
  arXiv  Detail & Related papers  (2025-10-16T19:27:15Z)
• Text Anomaly Detection with Simplified Isolation Kernel [58.13924648777626]
  Two-step approaches combine pre-trained large language model embeddings and anomaly detectors.<n>High-dimensional dense embeddings extracted by large language models pose challenges due to substantial memory requirements and high computation time.<n>We introduce the Simplified Isolation Kernel (SIK), which maps high-dimensional dense embeddings to lower-dimensional sparse representations.
  arXiv  Detail & Related papers  (2025-10-15T06:35:54Z)
• Reasoning-based Anomaly Detection Framework: A Real-time, Scalable, and Automated Approach to Anomaly Detection Across Domains [3.804483269194178]
  Reasoning based Anomaly Detection Framework (RADF) is designed to perform real time anomaly detection on very large datasets.<n>RADF surpasses state-of-the-art anomaly detection models in AUC performance for 5 out of 9 public benchmarking datasets.
  arXiv  Detail & Related papers  (2025-10-03T20:06:31Z)
• Generalizing Multi-Step Inverse Models for Representation Learning to Finite-Memory POMDPs [23.584313644411967]
  We study the problem of discovering an informative, or agent-centric, state representation that encodes only the relevant information while discarding the irrelevant. Our results include theory in the deterministic dynamics setting as well as counter-examples for alternative intuitive algorithms. We show that these can be a double-edged sword: making the algorithms more successful when used correctly and causing dramatic failure when used incorrectly.
  arXiv  Detail & Related papers  (2024-04-22T19:46:16Z)
• SalienDet: A Saliency-based Feature Enhancement Algorithm for Object Detection for Autonomous Driving [160.57870373052577]
  We propose a saliency-based OD algorithm (SalienDet) to detect unknown objects. Our SalienDet utilizes a saliency-based algorithm to enhance image features for object proposal generation. We design a dataset relabeling approach to differentiate the unknown objects from all objects in training sample set to achieve Open-World Detection.
  arXiv  Detail & Related papers  (2023-05-11T16:19:44Z)
• NetRCA: An Effective Network Fault Cause Localization Algorithm [22.88986905436378]
  Localizing root cause of network faults is crucial to network operation and maintenance. We propose a novel algorithm named NetRCA to deal with this problem. Experiments and analysis are conducted on the real-world dataset from ICASSP 2022 AIOps Challenge.
  arXiv  Detail & Related papers  (2022-02-23T02:03:35Z)
• An algorithm-based multiple detection influence measure for high dimensional regression using expectile [0.4999814847776096]
  We propose an algorithm-based, multi-step, multiple detection procedure to identify influential observations. Our three-step algorithm to identify and capture undesirable variability in the data, $asymMIP,$ is based on two complementary statistics. The application of our method to the Autism Brain Imaging Data Exchange dataset resulted in a more balanced and accurate prediction of brain maturity.
  arXiv  Detail & Related papers  (2021-05-26T01:16:24Z)
• Unsupervised Feature Learning for Event Data: Direct vs Inverse Problem Formulation [53.850686395708905]
  Event-based cameras record an asynchronous stream of per-pixel brightness changes. In this paper, we focus on single-layer architectures for representation learning from event data. We show improvements of up to 9 % in the recognition accuracy compared to the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-09-23T10:40:03Z)
• Gravitational Models Explain Shifts on Human Visual Attention [80.76475913429357]
  Visual attention refers to the human brain's ability to select relevant sensory information for preferential processing. Various methods to estimate saliency have been proposed in the last three decades. We propose a gravitational model (GRAV) to describe the attentional shifts.
  arXiv  Detail & Related papers  (2020-09-15T10:12:41Z)
• Evolving Losses for Unsupervised Video Representation Learning [91.2683362199263]
  We present a new method to learn video representations from large-scale unlabeled video data. The proposed unsupervised representation learning results in a single RGB network and outperforms previous methods.
  arXiv  Detail & Related papers  (2020-02-26T16:56:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.