Toggle navigation
OpenReview
.net
Login
×
Go to
ICML 2021
homepage
Near-Optimal Algorithms for Explainable k-Medians and k-Means
Konstantin Makarychev
,
Liren Shan
2021 (modified: 18 Apr 2023)
ICML 2021
Readers:
Everyone
Abstract:
We consider the problem of explainable $k$-medians and $k$-means introduced by Dasgupta, Frost, Moshkovitz, and Rashtchian (ICML 2020). In this problem, our goal is to find a \emph{threshold decisi...
0 Replies
Loading