| Explainable k-means and k-medians clustering M Moshkovitz, S Dasgupta, C Rashtchian, N Frost International conference on machine learning, 7055-7065, 2020 | 197 | 2020 |
| ExKMC: Expanding Explainable -Means Clustering N Frost, M Moshkovitz, C Rashtchian arXiv preprint arXiv:2006.02399, 2020 | 80 | 2020 |
| Framework for evaluating faithfulness of local explanations S Dasgupta, N Frost, M Moshkovitz International Conference on Machine Learning, 4794-4815, 2022 | 55 | 2022 |
| Mixing implies lower bounds for space bounded learning D Moshkovitz, M Moshkovitz Conference on Learning Theory, 1516-1566, 2017 | 51 | 2017 |
| Entropy samplers and strong generic lower bounds for space bounded learning D Moshkovitz, M Moshkovitz 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 2018 | 34 | 2018 |
| Connecting interpretability and robustness in decision trees through separation M Moshkovitz, YY Yang, K Chaudhuri International Conference on Machine Learning, 7839-7849, 2021 | 25 | 2021 |
| Explainable k-means clustering: Theory and practice S Dasgupta, N Frost, M Moshkovitz, C Rashtchian XXAI Workshop. ICML, 2020 | 17 | 2020 |
| Towards a combinatorial characterization of bounded-memory learning A Gonen, S Lovett, M Moshkovitz Advances in Neural Information Processing Systems 33, 9028-9038, 2020 | 16 | 2020 |
| Mixing complexity and its applications to neural networks M Moshkovitz, N Tishby arXiv preprint arXiv:1703.00729, 2017 | 16 | 2017 |
| Principled option learning in Markov decision processes R Fox, M Moshkovitz, N Tishby arXiv preprint arXiv:1609.05524, 2016 | 15 | 2016 |
| Principal-agent reward shaping in mdps O Ben-Porat, Y Mansour, M Moshkovitz, B Taitler Proceedings of the AAAI Conference on Artificial Intelligence 38 (9), 9502-9510, 2024 | 10 | 2024 |
| Unexpected Effects of Online no-Substitution -means Clustering M Moshkovitz Algorithmic Learning Theory, 892-930, 2021 | 10* | 2021 |
| No-substitution k-means clustering with adversarial order R Bhattacharjee, M Moshkovitz Algorithmic Learning Theory, 345-366, 2021 | 8 | 2021 |
| Bounded memory active learning through enriched queries M Hopkins, D Kane, S Lovett, M Moshkovitz Conference on Learning Theory, 2358-2387, 2021 | 7 | 2021 |
| Explainable 𝑘-means and 𝑘-medians clustering S Dasgupta, N Frost, M Moshkovitz, C Rashtchian arXiv preprint arXiv:2002.12538, 2020 | 6 | 2020 |
| Mixing implies strong lower bounds for space bounded learning D Moshkovitz, M Moshkovitz Electronic Colloquium on Computational Complexity (ECCC) 24 (116), 1-2, 2017 | 6 | 2017 |
| XAudit: A Theoretical Look at Auditing with Explanations C Yadav, M Moshkovitz, K Chaudhuri arXiv preprint arXiv:2206.04740, 2022 | 5 | 2022 |
| A constant approximation algorithm for sequential no-substitution k-median clustering under a random arrival order T Hess, M Moshkovitz, S Sabato | 5 | 2021 |
| A general memory-bounded learning algorithm M Moshkovitz, N Tishby arXiv preprint arXiv:1712.03524, 2017 | 5 | 2017 |
| Online k-means clustering on arbitrary data streams R Bhattacharjee, J Imola, M Moshkovitz, S Dasgupta International Conference on Algorithmic Learning Theory, 204-236, 2023 | 4 | 2023 |
