Ashkan Jafarpour

Generating author description...

All published works

Action	Title	Year	Authors
+	Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation	2016	Jayadev Acharya Moein Falahatgar Ashkan Jafarpour Alon Orlitsky Ananda Theertha Suresh
+ PDF Chat	Universal compression of power-law distributions	2015	Moein Falahatgar Ashkan Jafarpour Alon Orlitsky Venkatadheeraj Pichapati Ananda Theertha Suresh
+	Faster Algorithms for Testing under Conditional Sampling	2015	Moein Falahatgar Ashkan Jafarpour Alon Orlitsky Venkatadheeraj Pichapathi Ananda Theertha Suresh
+	Faster Algorithms for Testing under Conditional Sampling	2015	Moein Falahatgar Ashkan Jafarpour Alon Orlitsky Venkatadheeraj Pichapathi Ananda Theertha Suresh
+	Universal Compression of Power-Law Distributions	2015	Moein Falahatgar Ashkan Jafarpour Alon Orlitsky Venkatadheeraj Pichapati Ananda Theertha Suresh
+	Near-optimal-sample estimators for spherical Gaussian mixtures	2014	Jayadev Acharya Ashkan Jafarpour Alon Orlitsky Ananda Theertha Suresh
+	Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling	2014	Jayadev Acharya Ashkan Jafarpour Alon Orlitsky Ananda Theertha Suresh
+	Near-optimal-sample estimators for spherical Gaussian mixtures	2014	Jayadev Acharya Ashkan Jafarpour Alon Orlitsky Ananda Theertha Suresh
+	A Competitive Test for Uniformity of Monotone Distributions	2013	Jayadev Acharya Ashkan Jafarpour Alon Orlitsky Ananda Theertha Suresh

Common Coauthors

Coauthor	Papers Together
Alon Orlitsky	9
Ananda Theertha Suresh	9
Jayadev Acharya	5
Moein Falahatgar	5
Venkatadheeraj Pichapati	2
Venkatadheeraj Pichapathi	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Probability and Computing: Randomized Algorithms and Probabilistic Analysis	2005	Michael Mitzenmacher Eli Upfal	3
+	None	2009	Dan Hefetz Michael Krivelevich Miloš Stojaković Tibor Szabó	2
+	A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data	2008	Liam Paninski	2
+ PDF Chat	About Adaptive Coding on Countable Alphabets: Max-Stable Envelope Classes	2015	Stéphane Boucheron Élisabeth Gassiat Mesrob I. Ohannessian	2
+ PDF Chat	Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions	2013	Gil I. Shamir	2
+ PDF Chat	About Adaptive Coding on Countable Alphabets	2014	Dominique Bontemps Stéphane Boucheron Élisabeth Gassiat	2
+ PDF Chat	Learning mixtures of spherical gaussians	2013	Daniel Hsu Sham M. Kakade	1
+	Testing uniformity versus a monotone density	1999	Jiayang Sun Michael Woodroofe	1
+	General auction mechanism for search advertising	2009	Gagan Aggarwal S. Muthukrishnan Dávid Pál Martin Pál	1
+	Minimax redundancy for large alphabets	2010	Wojciech Szpankowski M.J. Weinberger	1
+ PDF Chat	Learning poisson binomial distributions	2012	Constantinos Daskalakis Ilias Diakonikolas Rocco A. Servedio	1
+	Estimating the unseen	2011	Gregory Valiant Paul Valiant	1
+ PDF Chat	Active Property Testing	2012	Maria-Florina Balcan Eric Blais Avrim Blum Lin F. Yang	1
+	On redundancy of memoryless sources over countable alphabets	2014	Maryam Hosseini Narayana Santhanam	1
+	Minimax Theory for High-dimensional Gaussian Mixtures with Sparse Mean Separation	2013	Martin Azizyan Aarti Singh Larry Wasserman	1
+	Optimal Algorithms for Testing Closeness of Discrete Distributions	2013	Siu-On Chan Ilias Diakonikolas Gregory Valiant Paul Valiant	1
+ PDF Chat	Efficient density estimation via piecewise polynomial approximation	2014	Siu-On Chan Ilias Diakonikolas Rocco A. Servedio Xiaorui Sun	1
+	The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures	2013	Joseph Anderson Mikhail Belkin Navin Goyal Luis Rademacher James Voss	1
+	Variational Minimax Estimation of Discrete Distributions under KL Loss	2004	Liam Paninski	1
+ PDF Chat	Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes	2011	Dominique Bontemps	1
+ PDF Chat	Large Deviations for Quicksort	1996	Colin McDiarmid Ryan Hayward	1
+ PDF Chat	On Testing Expansion in Bounded-Degree Graphs	2011	Oded Goldreich Dana Ron	1
+	Robust Estimators in High Dimensions without the Computational Intractability	2016	Ilias Diakonikolas Gautam Kamath Daniel M. Kane Jerry Li Ankur Moitra Alistair Stewart	1
+	An Empirical Study of Smoothing Techniques for Language Modeling	1996	Stanley F. Chen Joshua Goodman	1
+	Polynomial Learning of Distribution Families	2010	Mikhail Belkin K. P. Sinha	1
+	Learning mixtures of structured distributions over discrete domains	2012	Siu-On Chan Ilias Diakonikolas Rocco A. Servedio Xiaorui Sun	1
+ PDF Chat	Introduction to the non-asymptotic analysis of random matrices	2012	Roman Vershynin	1
+ PDF Chat	User-Friendly Tail Bounds for Sums of Random Matrices	2011	Joel A. Tropp	1
+ PDF Chat	Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws	2007	Alexander Gnedin Ben B. Hansen Jim Pitman	1
+ PDF Chat	Coding on Countably Infinite Alphabets	2009	Stéphane Boucheron Aurélien Garivier Élisabeth Gassiat	1
+ PDF Chat	<i> L <sub>p</sub> </i> Testing and Learning of Discrete Distributions	2015	Bo Waggoner	1
+ PDF Chat	Testing that distributions are close	2002	Tuğkan Batu Lance Fortnow Ronitt Rubinfeld Warren D. Smith Patrick White	1
+ PDF Chat	Adaptive estimation of a quadratic functional by model selection	2000	Béatrice Laurent Pascal Massart	1
+	On Spectral Learning of Mixtures of Distributions	2005	Dimitris Achlioptas Frank McSherry	1
+	Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling	2014	Jayadev Acharya Ashkan Jafarpour Alon Orlitsky Ananda Theertha Suresh	1
+ PDF Chat	On the power of conditional samples in distribution testing	2013	Sourav Chakraborty Eldar Fischer Yonatan Goldhirsh Arie Matsliah	1
+	Mixture Densities, Maximum Likelihood and the EM Algorithm	1984	Richard A. Redner Homer F. Walker	1