Near-optimal-sample estimators for spherical gaussian mixtures AT Suresh, A Orlitsky, J Acharya, A Jafarpour Advances in Neural Information Processing Systems 27, 2014 | 105 | 2014 |
Competitive closeness testing J Acharya, H Das, A Jafarpour, A Orlitsky, S Pan Proceedings of the 24th Annual Conference on Learning Theory, 47-68, 2011 | 65 | 2011 |
Competitive classification and closeness testing J Acharya, H Das, A Jafarpour, A Orlitsky, S Pan, A Suresh Conference on Learning Theory, 22.1-22.18, 2012 | 49 | 2012 |
Optimal probability estimation with applications to prediction and classification J Acharya, A Jafarpour, A Orlitsky, AT Suresh Conference on Learning Theory, 764-796, 2013 | 40 | 2013 |
Faster algorithms for testing under conditional sampling M Falahatgar, A Jafarpour, A Orlitsky, V Pichapati, AT Suresh Conference on Learning Theory, 607-636, 2015 | 38 | 2015 |
A competitive test for uniformity of monotone distributions J Acharya, A Jafarpour, A Orlitsky, A Suresh Artificial Intelligence and Statistics, 57-65, 2013 | 34 | 2013 |
Estimating the number of defectives with group testing M Falahatgar, A Jafarpour, A Orlitsky, V Pichapati, AT Suresh 2016 IEEE International Symposium on Information Theory (ISIT), 1376-1380, 2016 | 33 | 2016 |
Sorting with adversarial comparators and application to density estimation J Acharya, A Jafarpour, A Orlitsky, AT Suresh 2014 IEEE International Symposium on Information Theory, 1682-1686, 2014 | 31 | 2014 |
Sublinear algorithms for outlier detection and generalized closeness testing J Acharya, A Jafarpour, A Orlitsky, AT Suresh 2014 IEEE International Symposium on Information Theory, 3200-3204, 2014 | 24 | 2014 |
Tight bounds for universal compression of large alphabets J Acharya, H Das, A Jafarpour, A Orlitsky, AT Suresh 2013 IEEE International Symposium on Information Theory, 2875-2879, 2013 | 19 | 2013 |
Maximum selection and sorting with adversarial comparators J Acharya, M Falahatgar, A Jafarpour, A Orlitsky, AT Suresh Journal of Machine Learning Research 19 (59), 1-31, 2018 | 18 | 2018 |
Expected query complexity of symmetric Boolean functions J Acharya, A Jafarpour, A Orlitsky 2011 49th Annual Allerton Conference on Communication, Control, and …, 2011 | 14 | 2011 |
Poissonization and universal compression of envelope classes J Acharya, A Jafarpour, A Orlitsky, AT Suresh 2014 IEEE International Symposium on Information Theory, 1872-1876, 2014 | 10 | 2014 |
Efficient compression of monotone and m-modal distributions J Acharya, A Jafarpour, A Orlitsky, AT Suresh 2014 IEEE International Symposium on Information Theory, 1867-1871, 2014 | 9 | 2014 |
On the query computation and verification of functions H Das, A Jafarpour, A Orlitsky, S Pan, AT Suresh 2012 IEEE International Symposium on Information Theory Proceedings, 2711-2715, 2012 | 9 | 2012 |
Maximum selection and sorting with adversarial comparators and an application to density estimation J Acharya, M Falahatgar, A Jafarpour, A Orlitsky, AT Suresh arXiv preprint arXiv:1606.02786, 2016 | 7 | 2016 |
Universal compression of power-law distributions M Falahatgar, A Jafarpour, A Orlitsky, V Pichapati, AT Suresh 2015 IEEE International Symposium on Information Theory (ISIT), 2001-2005, 2015 | 7 | 2015 |
Universal compression of envelope classes: Tight characterization via poisson sampling J Acharya, A Jafarpour, A Orlitsky, AT Suresh arXiv preprint arXiv:1405.7460, 2014 | 6 | 2014 |
Estimating multiple concurrent processes J Acharya, H Das, A Jafarpour, A Orlitsky, S Pan 2012 IEEE International Symposium on Information Theory Proceedings, 1628-1632, 2012 | 6 | 2012 |
Function Computation with Optimal Number of Queries AJ Koujahi University of California, San Diego, 2015 | | 2015 |