| The power of localization for efficiently learning linear separators with noise P Awasthi, MF Balcan, PM Long Journal of the ACM (JACM) 63 (6), 1-27, 2017 | 206 | 2017 |
| The hardness of approximation of euclidean k-means P Awasthi, M Charikar, R Krishnaswamy, AK Sinop arXiv preprint arXiv:1502.03316, 2015 | 186 | 2015 |
| Fair k-center clustering for data summarization M Kleindessner, P Awasthi, J Morgenstern International Conference on Machine Learning, 3448-3457, 2019 | 176 | 2019 |
| Guarantees for spectral clustering with fairness constraints M Kleindessner, S Samadi, P Awasthi, J Morgenstern International conference on machine learning, 3458-3467, 2019 | 165 | 2019 |
| Center-based clustering under perturbation stability P Awasthi, A Blum, O Sheffet Information Processing Letters 112 (1-2), 49-54, 2012 | 161 | 2012 |
| Relax, no need to round: Integrality of clustering formulations P Awasthi, AS Bandeira, M Charikar, R Krishnaswamy, S Villar, R Ward Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 131 | 2015 |
| Improved spectral-norm bounds for clustering P Awasthi, O Sheffet International Workshop on Approximation Algorithms for Combinatorial …, 2012 | 127 | 2012 |
| Online Stochastic Optimization in the Large: Application to Kidney Exchange. P Awasthi, T Sandholm IJCAI 9, 405-411, 2009 | 119 | 2009 |
| Decision trees for entity identification: Approximation algorithms and hardness results VT Chakaravarthy, V Pandit, S Roy, P Awasthi, M Mohania Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on …, 2007 | 113* | 2007 |
| Stability yields a PTAS for k-median and k-means clustering P Awasthi, A Blum, O Sheffet 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 309-318, 2010 | 108 | 2010 |
| Local algorithms for interactive clustering P Awasthi, MF Balcan, K Voevodski Journal of Machine Learning Research 18 (3), 1-35, 2017 | 102 | 2017 |
| Efficient learning of linear separators under bounded noise P Awasthi, MF Balcan, N Haghtalab, R Urner Conference on Learning Theory, 167-190, 2015 | 99 | 2015 |
| Learning and 1-bit compressed sensing under asymmetric noise P Awasthi, MF Balcan, N Haghtalab, H Zhang Conference on Learning Theory, 152-192, 2016 | 96 | 2016 |
| Decision trees for entity identification: Approximation algorithms and hardness results VT Chakaravarthy, V Pandit, S Roy, P Awasthi, M Mohania Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on …, 2007 | 94 | 2007 |
| Learning mixtures of ranking models P Awasthi, A Blum, O Sheffet, A Vijayaraghavan Advances in Neural Information Processing Systems 27, 2014 | 88 | 2014 |
| Equalized odds postprocessing under imperfect group information P Awasthi, M Kleindessner, J Morgenstern International conference on artificial intelligence and statistics, 1770-1780, 2020 | 78 | 2020 |
| Adversarial learning guarantees for linear hypotheses and neural networks P Awasthi, N Frank, M Mohri International Conference on Machine Learning, 431-441, 2020 | 58 | 2020 |
| Supervised clustering P Awasthi, R Zadeh Advances in neural information processing systems 23, 2010 | 56 | 2010 |
| Part of speech tagging and chunking with hmm and crf P Awasthi, D Rao, B Ravindran Proceedings of NLP Association of India (NLPAI) Machine Learning Contest 2006, 2006 | 50 | 2006 |
| Evaluating fairness of machine learning models under uncertain and incomplete information P Awasthi, A Beutel, M Kleindessner, J Morgenstern, X Wang Proceedings of the 2021 ACM Conference on Fairness, Accountability, and …, 2021 | 49 | 2021 |
