In this paper, we consider the multi-dimensional Kesten algorithm studied in Xu and Dai (2012). The convergence in rth mean for the algorithm is established under the weaker assumptions than Xu and Dai (2012). Moreover, we obtain also the almost sure convergence of the algorithm under the...

Clustering with fast algorithms large samples of high dimensional data is an important challenge in computational statistics. A new class of recursive stochastic gradient algorithms designed for the k-medians loss criterion is proposed. By their recursive nature, these algorithms are very fast...