Raghu Meka
Raghu Meka
Dirección de correo verificada de cs.ucla.edu - Página principal
Citado por
Citado por
Guaranteed rank minimization via singular value projection
R Meka, P Jain, IS Dhillon
arXiv preprint arXiv:0909.5457, 2009
Constructive discrepancy minimization by walking on the edges
S Lovett, R Meka
SIAM Journal on Computing 44 (5), 1573-1582, 2015
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
Efficient algorithms for outlier-robust regression
A Klivans, PK Kothari, R Meka
Conference On Learning Theory, 1420-1430, 2018
Pseudorandom generators for polynomial threshold functions
R Meka, D Zuckerman
SIAM Journal on Computing 42 (3), 1275-1301, 2013
Rectangles are nonnegative juntas
M Göös, S Lovett, R Meka, T Watson, D Zuckerman
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
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
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
Pseudorandomness from shrinkage
R Impagliazzo, R Meka, D Zuckerman
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 111-119, 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
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
Learning graphical models using multiplicative weights
A Klivans, R Meka
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
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
Almost optimal explicit Johnson-Lindenstrauss families
D Kane, R Meka, J Nelson
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011
Bounding the sensitivity of polynomial threshold functions
P Harsha, A Klivans, R Meka
arXiv preprint arXiv:0909.5175, 2009
Matrix completion from power-law distributed samples
R Meka, P Jain, I Dhillon
Advances in neural information processing systems 22, 1258-1266, 2009
Computational limits for matrix completion
M Hardt, R Meka, P Raghavendra, B Weitz
Conference on Learning Theory, 703-725, 2014
Learning one convolutional layer with overlapping patches
S Goel, A Klivans, R Meka
International Conference on Machine Learning, 1783-1791, 2018
DNF sparsification and a faster deterministic counting algorithm
P Gopalan, R Meka, O Reingold
Computational Complexity 22 (2), 275-310, 2013
Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs
PK Kothari, R Meka, P Raghavendra
SIAM Journal on Computing, STOC17-305-STOC17-332, 2021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20