Ashkan Jafarpour

According to our database, Ashkan Jafarpour authored at least 19 papers between 2011 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Maximum Selection and Sorting with Adversarial Comparators.

Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

J. Mach. Learn. Res., 2018

2016

Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation.

Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

CoRR, 2016

Estimating the number of defectives with group testing.

Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Universal compression of power-law distributions.

Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh

Proceedings of the IEEE International Symposium on Information Theory, 2015

Faster Algorithms for Testing under Conditional Sampling.

Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

CoRR, 2014

Near-Optimal-Sample Estimators for Spherical Gaussian Mixtures.

Ananda Theertha Suresh, Alon Orlitsky, Jayadev Acharya, Ashkan Jafarpour

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Sublinear algorithms for outlier detection and generalized closeness testing.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Poissonization and universal compression of envelope classes.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Efficient compression of monotone and m-modal distributions.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Sorting with adversarial comparators and application to density estimation.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Tight bounds for universal compression of large alphabets.

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Optimal Probability Estimation with Applications to Prediction and Classification.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the COLT 2013, 2013

A Competitive Test for Uniformity of Monotone Distributions.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh

Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

2012

Competitive Classification and Closeness Testing.

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh

Proceedings of the COLT 2012, 2012

On the query computation and verification of functions.

Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Estimating multiple concurrent processes.

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Competitive Closeness Testing.

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan

Proceedings of the COLT 2011, 2011

Expected query complexity of symmetric boolean functions.

Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky

Proceedings of the 49th Annual Allerton Conference on Communication, 2011