Portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 2
Konstantin Makarychev, Ilias Papanikolaou, Liren Shan
Published in NeurIPS (Spotlight Presentation), 2025
We study the problem of explainable \(k\)-medians clustering introduced by Dasgupta, Frost, Moshkovitz, and Rashtchian (2020). In this problem, the goal is to construct a threshold decision tree that partitions data into \(k\) clusters while minimizing the \(k\)-medians objective. These trees are interpretable because each internal node makes a simple decision by thresholding a single feature, allowing users to trace and understand how each point is assigned to a cluster. We design an accurate static explainable clustering algorithm for the \(k\)-medians objective under the \(\ell_p\) norm for every \(p \geq 1\) and then show how to implement it in the dynamic setting, where the input is gradually revealed to the algorithm.
Published:
This is a description of your talk, which is a markdown file that can be all markdown-ified like any other post. Yay markdown!
Published:
Published:
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
Undergraduate course, National Technical University of Athens, 2022
Undergraduate course, National Technical University of Athens, 2022
Undergraduate course, Northwestern University, 2025