让聚类自动适应个体自主性,提升真实场景下的分组准确性。
Autonomy-Aware Clustering: When Local Decisions Supersede Global Prescriptions
- 用强化学习+确定性退火框架建模个体自主行为对聚类的影响。
- 在无先验自主性模型下仍逼近真实聚类,误差仅3-4%,远优于忽略自主性的35-40%。
- 引入自适应距离网络,支持可变输入输出,适合跨任务迁移。
聚类广泛应用于各类问题,但现有方法通常假设聚类对象是被动且严格服从分配的。现实中,个体常表现出局部自主性,其行为会突破预设分组,而这种自主性无法被特征表示完全捕捉。它会显著改变聚类结果,包括簇组成、几何结构和数量,进而影响下游推理与决策。本文提出自治感知聚类(Autonomy-Aware Clustering),一种无需预先知道自主性形式的强化学习(RL)框架。该方法将强化学习与确定性退火(DA)结合,利用退火过程在早期促进探索、后期转向利用,自然生成有效聚类。我们还发现退火过程存在相变现象,可用于设计高效退火策略。为进一步增强适应性,提出基于Transformer的自适应距离估计网络(ADEN),在强化学习循环中学习实体与簇中心间的依赖关系,支持可变大小输入输出,并实现跨不同问题实例的知识迁移。实验表明,即使没有显式自主性模型,该框架仍能接近真实数据动态,误差仅为3-4%;而忽略自主性则导致高达35-40%的误差。代码与数据已公开于https://github.com/salar96/AutonomyAwareClustering。
原文摘要 · Abstract (English)
Clustering arises in a wide range of problem formulations, yet most existing approaches assume that the entities under clustering are passive and strictly conform to their assigned groups. In reality, entities often exhibit local autonomy, overriding prescribed associations in ways not fully captured by feature representations. Such autonomy can substantially reshape clustering outcomes -- altering cluster compositions, geometry, and cardinality -- with significant downstream effects on inference and decision-making. We introduce autonomy-aware clustering, a reinforcement learning (RL) framework that learns and accounts for the influence of local autonomy without requiring prior knowledge of its form. Our approach integrates RL with a Deterministic Annealing (DA) procedure, where, to determine underlying clusters, DA naturally promotes exploration in early stages of annealing and transitions to exploitation later. We also show that the annealing procedure exhibits phase transitions that enable design of efficient annealing schedules. To further enhance adaptability, we propose the Adaptive Distance Estimation Network (ADEN), a transformer-based attention model that learns dependencies between entities and cluster representatives within the RL loop, accommodates variable-sized inputs and outputs, and enables knowledge transfer across diverse problem instances. Empirical results show that our framework closely aligns with underlying data dynamics: even without explicit autonomy models, it achieves solutions close to the ground truth (gap ~3-4%), whereas ignoring autonomy leads to substantially larger gaps (~35-40%). The code and data are publicly available at https://github.com/salar96/AutonomyAwareClustering.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。