Copertina

An Observation on Lloyd's k-Means Algorithm in High Dimensions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Silva-Sánchez, David, Lederman, Roy R.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Catastrophic Failure of The k-Means Algorithm in High Dimensions, and How Hartigan's Algorithm Avoids It
di: Lederman, Roy R., et al.
Pubblicazione: (2026)

FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy
di: Diaa, Abdulrahman, et al.
Pubblicazione: (2024)

LocalKMeans: Convergence of Lloyd's Algorithm with Distributed Local Iterations
di: Vardhan, Harsh, et al.
Pubblicazione: (2025)

SOLVAR: Fast covariance-based heterogeneity analysis with pose refinement for cryo-EM
di: Yadgar, Roey, et al.
Pubblicazione: (2026)

Consistency of Lloyd's Algorithm Under Perturbations
di: Patel, Dhruv, et al.
Pubblicazione: (2023)

Entangled Mean Estimation in High-Dimensions
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2025)

Multi-Swap $k$-Means++
di: Beretta, Lorenzo, et al.
Pubblicazione: (2023)

Accelerating k-Means Clustering with Cover Trees
di: Lang, Andreas, et al.
Pubblicazione: (2024)

Dimension-free Private Mean Estimation for Anisotropic Distributions
di: Dagan, Yuval, et al.
Pubblicazione: (2024)

Conditional Mean and Variance Estimation via \textit{k}-NN Algorithm with Automated Variance Selection
di: Matabuena, Marcos, et al.
Pubblicazione: (2024)

Optimal Scaling for the Proximal Langevin Algorithm in High Dimensions
di: Pillai, Natesh S.
Pubblicazione: (2022)

Differentially Private Federated $k$-Means Clustering with Server-Side Data
di: Scott, Jonathan, et al.
Pubblicazione: (2025)

On the Saturation Effects of Spectral Algorithms in Large Dimensions
di: Lu, Weihao, et al.
Pubblicazione: (2025)

Memory-Guided Trust-Region Bayesian Optimization (MG-TuRBO) for High Dimensions
di: Saroj, Abhilasha, et al.
Pubblicazione: (2026)

Asymptotic Theory of Geometric and Adaptive $k$-Means Clustering
di: Jaffe, Adam Quinn
Pubblicazione: (2022)

Nearly Dimension-Independent Convergence of Mean-Field Black-Box Variational Inference
di: Kim, Kyurae, et al.
Pubblicazione: (2025)

Low-Dimension-to-High-Dimension Generalization And Its Implications for Length Generalization
di: Chen, Yang, et al.
Pubblicazione: (2024)

Graph-based Clustering Revisited: A Relaxation of Kernel $k$-Means Perspective
di: Lyu, Wenlong, et al.
Pubblicazione: (2025)

Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
di: Spalding-Jamieson, Jack, et al.
Pubblicazione: (2025)

Fixed-sized clusters $k$-Means
di: Malinen, Mikko I., et al.
Pubblicazione: (2025)

Exploration-free Algorithms for Multi-group Mean Estimation
di: Wei, Ziyi, et al.
Pubblicazione: (2025)

Approximate Algorithms For $k$-Sparse Wasserstein Barycenter With Outliers
di: Yang, Qingyuan, et al.
Pubblicazione: (2024)

A Case for Library-Level k-Means Binning in Histogram Gradient-Boosted Trees
di: Labovich, Asher
Pubblicazione: (2025)

Radius-Guided Post-Clustering for Shape-Aware, Scalable Refinement of k-Means Results
di: Kober, Stefan
Pubblicazione: (2025)

Cluster-Adaptive Feature Extraction and its Theoretical Foundation with Minkowski Weighted k-Means
di: de Amorim, Renato Cordeiro, et al.
Pubblicazione: (2026)

Utilizing Maximum Mean Discrepancy Barycenter for Propagating the Uncertainty of Value Functions in Reinforcement Learning
di: Roy, Srinjoy, et al.
Pubblicazione: (2024)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
di: Funk, Nicole, et al.
Pubblicazione: (2026)

A Quantum Approximation Scheme for k-Means
di: Jaiswal, Ragesh
Pubblicazione: (2023)

Careful Seeding for k-Medois Clustering with Incremental k-Means++ Initialization
di: Cheng, Difei, et al.
Pubblicazione: (2022)

Quantum Clustering with k-Means: a Hybrid Approach
di: Poggiali, Alessandro, et al.
Pubblicazione: (2022)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
di: Cheng, Kangke, et al.
Pubblicazione: (2026)

Moment Matters: Mean and Variance Causal Graph Discovery from Heteroscedastic Observational Data
di: Chikahara, Yoichi
Pubblicazione: (2026)

A Faster $k$-means++ Algorithm
di: Liang, Jiehao, et al.
Pubblicazione: (2022)

Statistical Mean Estimation with Coded Relayed Observations
di: Ling, Yan Hao, et al.
Pubblicazione: (2025)

Hierarchical Multiple Kernel K-Means Algorithm Based on Sparse Connectivity
di: Wang, Lei, et al.
Pubblicazione: (2024)

Misalignment from Treating Means as Ends
di: Marklund, Henrik, et al.
Pubblicazione: (2025)

Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithms
di: Schubert, Erich, et al.
Pubblicazione: (2018)

Scalable Importance Sampling in High Dimensions with Low-Rank Mixture Proposals
di: Kruse, Liam A., et al.
Pubblicazione: (2025)

Rethinking Trust Region Bayesian Optimization in High Dimensions
di: Tang, Wei-Ting, et al.
Pubblicazione: (2026)

Vanilla Bayesian Optimization Performs Great in High Dimensions
di: Hvarfner, Carl, et al.
Pubblicazione: (2024)