6 September 2024 in Knowledge-Based Systems
27 January 2022 in Applied Intelligence
11 April 2024 in Neurocomputing
8 May 2026 in Complex & Intelligent Systems
Traditional reinforcement learning (RL) methods typically assume complete observation data, but real-world scenarios are often far more complex. Real-world deployments face missing data where part of the state dimensions become unavailable due to sensor failures, communication blackouts, or temporal sampling discontinuities. While recent research has achieved significant progress in handling missing data scenarios, current methodologies remain fundamentally constrained by their inability to effectively manage prolonged observation gaps and their low tolerance thresholds for high missing rates. In this work, we investigate the performance of reinforcement learning under the condition of missing data. We introduce a novel method, Mutual Information Aligned Generative Reinforcement Learning(MIA-GRL), which employs a spatiotemporal collaborative reconstruction to learn from historical reinforcement learning trajectories. This method synthesizes trajectories that encapsulate environmental characteristics and diversity through contextual information. We design an auxiliary loss function based on mutual information maximization, aiming to maximize the mutual information between the completed data and the original data, thereby ensuring that the completed data retains as much critical information from the original data as possible. Additionally, we utilize missing-aware contrastive learning to learn representations robust to missing patterns, enabling the policy network to capture intrinsic features relevant to the task. Experiments show our method outperforms state-of-the-art methods under the missing data conditions.
11 October 2023 in Autonomous Intelligent Systems
Because the number of clustering cores needs to be set before implementing the K-means algorithm, this type of algorithm often fails in applications with increasing data and changing distribution characteristics. This paper proposes an evolutionary algorithm DCC, which can dynamically adjust the number of clustering cores with data change. DCC algorithm uses the Gaussian function as the activation function of each core. Each clustering core can adjust its center vector and coverage based on the response to the input data and its memory state to better fit the sample clusters in the space. The DCC algorithm model can evolve from 0. After each new sample is added, the winning dynamic core can be adjusted or split by competitive learning, so that the number of clustering cores of the algorithm always maintains a better adaptation relationship with the existing data. Furthermore, because its clustering core can split, it can subdivide the densely distributed data clusters. Finally, detailed experimental results show that the evolutionary clustering algorithm DCC based on the dynamic core method has excellent clustering performance and strong robustness.