mlsanityData to 14 Oct 2026

Autonomy-Aware Clustering: When Local Decisions Supersede Global Prescriptions

arXiv 2509.25775 ↗First posted 30 Sep 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 36 references that are in the map. First posted on arXiv 30 Sep 2025.

Builds on

10 of 36 references.

References · 10

  1. 2017Attention Is All You Needcited by 60,361
  2. 2023AI Alignment: A Comprehensive Surveycited by 263
  3. 2013Probabilistic Latent Semantic Analysiscited by 63
  4. 2021Better Algorithms for Individually Fair k-Clusteringcited by 28
  5. 2021CLASTER: Clustering with Reinforcement Learning for Zero-Shot Action Recognitioncited by 12
  6. 2018Approximation algorithms for stochastic clusteringcited by 7
  7. 2020Parameterized MDPs and Reinforcement Learning Problems -- A Maximum Entropy Principle Based Frameworkcited by 6
  8. 2021Online Deterministic Annealing for Classification and Clusteringcited by 6
  9. 2020Stochastic Optimization and Learning for Two-Stage Supplier Problemscited by 1
  10. 2022Orthogonal Nonnegative Matrix Factorization with Sparsity Constraintscited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Large Scale Constrained Clustering With Reinforcement Learning
  2. 2025Adaptive and Robust DBSCAN with Multi-agent Reinforcement Learning
  3. 2025Policy-Based Trajectory Clustering in Offline Reinforcement Learning
  4. 2024Just Cluster It: An Approach for Exploration in High-Dimensions using Clustering and Pre-Trained Representations
  5. 2025Clustering via Self-Supervised Diffusion
  6. 2025Consistent Amortized Clustering via Generative Flow Networks
  7. 2026Silence the Judge: Reinforcement Learning with Self-Verifier via Latent Geometric Clustering
  8. 2025Asymptotically optimal reinforcement learning in Block Markov Decision Processes