20 citations · 75 across the 17 of their papers we have counts for
4 papers · 1 filter
Connecting Interpretability and Robustness in Decision Trees through Separation
Michal Moshkovitz, Yao-Yuan Yang, Kamalika Chaudhuri
Recent research has recognized interpretability and robustness as essential properties of trustworthy classification. Curiously, a connection between robustness and interpretabilit…
Bounded Memory Active Learning through Enriched Queries
Max Hopkins, Daniel Kane, Shachar Lovett +1
The explosive growth of easily-accessible unlabeled data has lead to growing interest in active learning, a paradigm in which data-hungry learning algorithms adaptively select info…
Online -means Clustering on Arbitrary Data Streams
Robi Bhattacharjee, Jacob Imola, Michal Moshkovitz +1
We consider online -means clustering where each new point is assigned to the nearest cluster center, after which the algorithm may update its centers. The loss incurred is the s…
A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering
Tom Hess, Michal Moshkovitz, Sivan Sabato
We study k-median clustering under the sequential no-substitution setting. In this setting, a data stream is sequentially observed, and some of the points are selected by the algor…