Imbalanced clusters are provably easier to recover than balanced ones, and a two-step gradient ascent algorithm with normalized-sample initialization achieves Θ~(d²p²) sample complexity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Recovering Imbalanced Clusters via Gradient-Based Projection Pursuit
Imbalanced clusters are provably easier to recover than balanced ones, and a two-step gradient ascent algorithm with normalized-sample initialization achieves Θ~(d²p²) sample complexity.