Riemannian Difference-of-Convex Optimization for K-Means Clustering

arXiv:2609.34310 · cs.LG, math.OC · Submitted 2026-09-28 · Read on arXiv

cs.LG, math.OC

Submitted: 2026-09-28

Updated: 2026-09-28

Terminology

• Clustering — 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