Guaranteed rank minimization via singular value projection P Jain, R Meka, I Dhillon Advances in Neural Information Processing Systems 23, 2010 | 574 | 2010 |
Constructive discrepancy minimization by walking on the edges S Lovett, R Meka SIAM Journal on Computing 44 (5), 1573-1582, 2015 | 178 | 2015 |
Efficient algorithms for outlier-robust regression A Klivans, PK Kothari, R Meka Conference On Learning Theory, 1420-1430, 2018 | 176 | 2018 |
Learning graphical models using multiplicative weights A Klivans, R Meka 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 135 | 2017 |
Simultaneous unsupervised learning of disparate clusterings P Jain, R Meka, IS Dhillon Statistical Analysis and Data Mining: The ASA Data Science Journal 1 (3 …, 2008 | 127 | 2008 |
Sum-of-squares lower bounds for planted clique R Meka, A Potechin, A Wigderson Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 119 | 2015 |
Pseudorandom generators for polynomial threshold functions R Meka, D Zuckerman Proceedings of the Forty-second ACM Symposium on Theory of Computing, 427-436, 2010 | 113 | 2010 |
Better pseudorandom generators from milder pseudorandom restrictions P Gopalan, R Meka, O Reingold, L Trevisan, S Vadhan 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 120-129, 2012 | 95 | 2012 |
Making the long code shorter B Barak, P Gopalan, J Håstad, R Meka, P Raghavendra, D Steurer 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 370-379, 2012 | 93 | 2012 |
Polynomial-time approximation schemes for knapsack and related counting problems using branching programs P Gopalan, A Klivans, R Meka arXiv preprint arXiv:1008.3187, 2010 | 93* | 2010 |
Guaranteed rank minimization via singular value projection R Meka, P Jain, IS Dhillon arXiv preprint arXiv:0909.5457, 2009 | 90 | 2009 |
Learning one convolutional layer with overlapping patches S Goel, A Klivans, R Meka International conference on machine learning, 1783-1791, 2018 | 85 | 2018 |
Pseudorandomness from shrinkage R Impagliazzo, R Meka, D Zuckerman 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 111-119, 2012 | 85 | 2012 |
Almost optimal explicit Johnson-Lindenstrauss families D Kane, R Meka, J Nelson International Workshop on Approximation Algorithms for Combinatorial …, 2011 | 85 | 2011 |
Rank minimization via online learning R Meka, P Jain, C Caramanis, IS Dhillon Proceedings of the 25th International Conference on Machine learning, 656-663, 2008 | 80 | 2008 |
Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016 | 74 | 2016 |
Bounding the sensitivity of polynomial threshold functions P Harsha, A Klivans, R Meka arXiv preprint arXiv:0909.5175, 2009 | 73* | 2009 |
Matrix completion from power-law distributed samples R Meka, P Jain, I Dhillon Advances in neural information processing systems 22, 2009 | 70 | 2009 |
Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs PK Kothari, R Meka, P Raghavendra Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 67 | 2017 |
DNF sparsification and a faster deterministic counting algorithm P Gopalan, R Meka, O Reingold computational complexity 22 (2), 275-310, 2013 | 65 | 2013 |