Cover Image

LocalKMeans: Convergence of Lloyd's Algorithm with Distributed Local Iterations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vardhan, Harsh, Zhu, Heng, Ghosh, Avishek, Mazumdar, Arya
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Effectiveness of Distributed Gradient Descent with Local Steps for Overparameterized Models
by: Zhu, Heng, et al.
Published: (2024)

Learning and Generalization with Mixture Data
by: Vardhan, Harsh, et al.
Published: (2025)

Collaborative Compressors in Distributed Mean Estimation with Limited Communication Budget
by: Vardhan, Harsh, et al.
Published: (2026)

Agnostic Learning of Mixed Linear Regressions with EM and AM Algorithms
by: Ghosh, Avishek, et al.
Published: (2024)

Optimal Compression of Unit Norm Vectors in the High Distortion Regime
by: Zhu, Heng, et al.
Published: (2023)

Client Selection in Federated Learning with Data Heterogeneity and Network Latencies
by: Vardhan, Harsh, et al.
Published: (2025)

Improving Selective Classification with Pairwise Queries for Binary Classification
by: Vardhan, Harsh, et al.
Published: (2026)

On the Theory of Continual Learning with Gradient Descent for Neural Networks
by: Taheri, Hossein, et al.
Published: (2025)

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
by: Matsumoto, Namiko, et al.
Published: (2022)

Expectation Maximization (EM) Converges for General Agnostic Mixtures
by: Ghosh, Avishek
Published: (2026)

Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements
by: Mazumdar, Arya, et al.
Published: (2025)

Stationary Reweighting Yields Local Convergence of Soft Fitted Q-Iteration
by: van der Laan, Lars, et al.
Published: (2025)

On the sample complexity of parameter estimation in logistic regression with normal design
by: Hsu, Daniel, et al.
Published: (2023)

Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets
by: Pagare, Tejas, et al.
Published: (2024)

Convergence of Distributed Adaptive Optimization with Local Updates
by: Cheng, Ziheng, et al.
Published: (2024)

An Observation on Lloyd's k-Means Algorithm in High Dimensions
by: Silva-Sánchez, David, et al.
Published: (2025)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
by: Matsumoto, Namiko, et al.
Published: (2025)

Sharper Guarantees for Learning Neural Network Classifiers with Gradient Methods
by: Taheri, Hossein, et al.
Published: (2024)

Maximum a Posteriori Inference for Factor Graphs via Benders' Decomposition
by: Dubey, Harsh Vardhan, et al.
Published: (2024)

Local Feature Selection without Label or Feature Leakage for Interpretable Machine Learning Predictions
by: Oosterhuis, Harrie, et al.
Published: (2024)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
by: Chen, Zaiwei, et al.
Published: (2024)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
by: Vaidyan, Kevin Kurian Thomas, et al.
Published: (2026)

Anomaly Detection and Improvement of Clusters using Enhanced K-Means Algorithm
by: Shorewala, Vardhan, et al.
Published: (2025)

Learning Partitions with Optimal Query and Round Complexities
by: Black, Hadley, et al.
Published: (2025)

The Behavior and Convergence of Local Bayesian Optimization
by: Wu, Kaiwen, et al.
Published: (2023)

Transfer Learning for Latent Variable Network Models
by: Jalan, Akhil, et al.
Published: (2024)

Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces
by: Zhu, Linglingzhi, et al.
Published: (2024)

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

Kernel KMeans clustering splits for end-to-end unsupervised decision trees
by: Ohl, Louis, et al.
Published: (2024)

Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework
by: Chen, Zaiwei, et al.
Published: (2026)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

Joint Cooperative and Non-Cooperative Localization in WSNs with Distributed Scaled Proximal ADMM Algorithms
by: Zhu, Qiaojia, et al.
Published: (2025)

Random Subgraph Detection Using Queries
by: Huleihel, Wasim, et al.
Published: (2021)

Near Optimal Best Arm Identification for Clustered Bandits
by: Yash, et al.
Published: (2025)

On Convergence of the Alternating Directions SGHMC Algorithm
by: Ghosh, Soumyadip, et al.
Published: (2024)

Stochastic Localization via Iterative Posterior Sampling
by: Grenioux, Louis, et al.
Published: (2024)

Iterative Methods via Locally Evolving Set Process
by: Zhou, Baojian, et al.
Published: (2024)

Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)

PLOT: Progressive Localization via Optimal Transport in Neural Causal Abstraction
by: Chang, Jonathn, et al.
Published: (2026)

On the Stability of Iterative Retraining of Generative Models on their own Data
by: Bertrand, Quentin, et al.
Published: (2023)