An interpretable Good--Turing restart criterion for k-means++

arXiv:2607.08243 · cs.LG, stat.ML · Submitted 2026-07-09 · Read on arXiv

Renato Cordeiro de Amorim

cs.LG, stat.ML

Submitted: 2026-07-09

Code: https://github.com/RCdeAmorim/Good-Turing-Restart-Criterion

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Clustering — 17× in this paper · explained in 2 episodes
• Benchmark — 5× in this paper · explained in 2 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Composition — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Good-Turing Restart Criterion — 1× in this paper
• K-means Clustering — 1× in this paper · explained in 3 episodes
• Unsupervised Learning — 1× in this paper · explained in 2 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks