| Near-optimal sample complexity bounds for robust learning of gaussian mixtures via compression schemes H Ashtiani, S Ben-David, NJA Harvey, C Liaw, A Mehrabian, Y Plan Journal of the ACM (JACM) 67 (6), 1-42, 2020 | 121* | 2020 |
| Clustering with same-cluster queries H Ashtiani, S Kushagra, S Ben-David Advances in neural information processing systems 29, 2016 | 104 | 2016 |
| Private and polynomial time algorithms for learning Gaussians and beyond H Ashtiani, C Liaw Conference on Learning Theory, 1075-1076, 2022 | 53 | 2022 |
| On the sample complexity of privately learning unbounded high-dimensional gaussians I Aden-Ali, H Ashtiani, G Kamath Algorithmic Learning Theory, 185-216, 2021 | 49 | 2021 |
| Graph signature for self-reconfiguration planning of modules with symmetry M Asadpour, H Ashtiani, A Sproewitz, A Ijspeert Intelligent Robots and Systems (IROS 2009), IEEE/RSJ International …, 2009 | 38 | 2009 |
| Disentangled behavioural representations A Dezfouli, H Ashtiani, O Ghattas, R Nock, P Dayan, CS Ong Advances in neural information processing systems 32, 2019 | 32 | 2019 |
| Sample-Efficient Learning of Mixtures H Ashtiani, S Ben-David, A Mehrabian AAAI Conference on Artificial Intelligence (AAAI), 2018 | 31 | 2018 |
| Black-box certification and learning under adversarial perturbations H Ashtiani, V Pathak, R Urner International Conference on Machine Learning, 388-398, 2020 | 25 | 2020 |
| Polynomial time and private learning of unbounded gaussian mixture models J Arbas, H Ashtiani, C Liaw International Conference on Machine Learning, 1018-1040, 2023 | 19 | 2023 |
| Privately learning mixtures of axis-aligned gaussians I Aden-Ali, H Ashtiani, C Liaw Advances in Neural Information Processing Systems 34, 3925-3938, 2021 | 18 | 2021 |
| Online nearest neighbor search using hamming weight trees S Eghbali, H Ashtiani, L Tahvildari IEEE Transactions on Pattern Analysis and Machine Intelligence 42 (7), 1729-1740, 2019 | 18 | 2019 |
| Online nearest neighbor search in binary space S Eghbali, H Ashtiani, L Tahvildari 2017 IEEE International Conference on Data Mining (ICDM), 853-858, 2017 | 17 | 2017 |
| Representation learning for clustering: a statistical framework H Ashtiani, S Ben-David Conference on Uncertainty in Artificial Intelligence. AUAI Press, 2015, 2015 | 16 | 2015 |
| A disaster invariant feature for localization B Soleimani, H Ashtiani, BH Soleimani, H Moradi Intelligent Robots and Systems (IROS 2010), IEEE/RSJ International …, 2010 | 16 | 2010 |
| Bandit-based local feature subset selection H Ashtiani, MN Ahmadabadi, BN Araabi Neurocomputing 138, 371-382, 2014 | 14 | 2014 |
| Some techniques in density estimation H Ashtiani, A Mehrabian arXiv preprint arXiv:1801.04003, 2018 | 11 | 2018 |
| A dimension-independent generalization bound for kernel supervised principal component analysis H Ashtiani, A Ghodsi Feature Extraction: Modern Questions and Challenges, 19-29, 2015 | 10 | 2015 |
| Mixtures of gaussians are privately learnable with a polynomial number of samples M Afzali, H Ashtiani, C Liaw arXiv preprint arXiv:2309.03847, 2023 | 9 | 2023 |
| Adversarially robust learning with tolerance H Ashtiani, V Pathak, R Urner International Conference on Algorithmic Learning Theory, 115-135, 2023 | 7 | 2023 |
| Benefits of additive noise in composing classes with bounded capacity A Fathollah Pour, H Ashtiani Advances in Neural Information Processing Systems 35, 32709-32722, 2022 | 3 | 2022 |
Christopher LiawResearch Scientist, GoogleVerified email at google.com
