Towards a theory of smoothed analysis for distributed computing

在过去的一年里，我一直在与欧洲和以色列的合作者合作，考虑在线算法的平滑复杂性。我们有一些关于一般覆盖问题的初步结果，我们想要形式化并提交发表。我还在领先的机器学习会议ICLR上发表了一篇单一作者的论文。本文研究了小批量k-均值的基本问题。虽然目前的分析是最坏的情况，但分析从平滑的分析技术中获得了灵感。

In the past year I have been working with collaborators in Europe and Israel on considering the smoothed complexity of online algorithms. We have some preliminary results for general covering problems which we want to formalize and submit for publication.I've also published a single author paper in ICLR, a leading machine learning conference. The paper considers the fundamental problem of mini-batch k-means. While the current analysis is worst-case, the analysis draws inspiration from smoothed analysis techniques.