Prati
Gregory Valiant
Gregory Valiant
Assistant Professor of Computer Science, Stanford University
Potvrđena adresa e-pošte na stanford.edu
Naslov
Citirano
Citirano
Godina
Settling the polynomial learnability of mixtures of gaussians
A Moitra, G Valiant
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 93-102, 2010
3552010
Estimating the unseen: an n/log (n)-sample estimator for entropy and support size, shown optimal via new CLTs
G Valiant, P Valiant
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
3172011
Learning from untrusted data
M Charikar, J Steinhardt, G Valiant
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
2492017
Efficiently learning mixtures of two Gaussians
AT Kalai, A Moitra, G Valiant
Proceedings of the forty-second ACM symposium on Theory of computing, 553-562, 2010
2342010
Optimal algorithms for testing closeness of discrete distributions
SO Chan, I Diakonikolas, P Valiant, G Valiant
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
2042014
An automatic inequality prover and instance optimal identity testing
G Valiant, P Valiant
SIAM Journal on Computing 46 (1), 429-455, 2017
1992017
Learning polynomials with neural networks
A Andoni, R Panigrahy, G Valiant, L Zhang
International conference on machine learning, 1908-1916, 2014
1692014
Estimating the unseen: improved estimators for entropy and other properties
G Valiant, P Valiant
Journal of the ACM (JACM) 64 (6), 1-41, 2017
1622017
Making ai forget you: Data deletion in machine learning
A Ginart, M Guan, G Valiant, JY Zou
Advances in neural information processing systems 32, 2019
1592019
The power of linear estimators
G Valiant, P Valiant
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 403-412, 2011
1582011
Resilience: A criterion for learning in the presence of arbitrary outliers
J Steinhardt, M Charikar, G Valiant
arXiv preprint arXiv:1703.04940, 2017
1152017
Finding correlations in subquadratic time, with applications to learning parities and juntas
G Valiant
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 11-20, 2012
1012012
Designing network protocols for good equilibria
HL Chen, T Roughgarden, G Valiant
SIAM Journal on Computing 39 (5), 1799-1832, 2010
992010
Designing network protocols for good equilibria
HL Chen, T Roughgarden, G Valiant
SIAM Journal on Computing 39 (5), 1799-1832, 2010
992010
Braess's paradox in large random graphs
G Valiant, T Roughgarden
Proceedings of the 7th ACM conference on Electronic commerce, 296-305, 2006
932006
A CLT and tight lower bounds for estimating entropy.
G Valiant, P Valiant
Electron. Colloquium Comput. Complex. 17, 179, 2010
882010
Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
G Valiant
Journal of the ACM (JACM) 62 (2), 1-45, 2015
842015
Testing k-Modal Distributions: Optimal Algorithms via Reductions
C Daskalakis, I Diakonikolas, RA Servedio, G Valiant, P Valiant
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
812013
Martian subsurface properties and crater formation processes inferred from fresh impact crater geometries
ST Stewart, GJ Valiant
Meteoritics & Planetary Science 41 (10), 1509-1537, 2006
792006
Memory, communication, and statistical queries
J Steinhardt, G Valiant, S Wager
Conference on Learning Theory, 1490-1516, 2016
772016
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20