| Ad click prediction: a view from the trenches HB McMahan, G Holt, D Sculley, M Young, D Ebner, J Grady, L Nie, ... Proceedings of the 19th ACM SIGKDD international conference on Knowledge …, 2013 | 880 | 2013 |
| Hidden technical debt in machine learning systems D Sculley, G Holt, D Golovin, E Davydov, T Phillips, D Ebner, ... Advances in neural information processing systems 28, 2015 | 809 | 2015 |
| Submodular function maximization. A Krause, D Golovin Tractability 3, 71-104, 2014 | 797 | 2014 |
| Adaptive submodularity: Theory and applications in active learning and stochastic optimization D Golovin, A Krause Journal of Artificial Intelligence Research 42, 427-486, 2011 | 577 | 2011 |
| Google vizier: A service for black-box optimization D Golovin, B Solnik, S Moitra, G Kochanski, J Karro, D Sculley Proceedings of the 23rd ACM SIGKDD international conference on knowledge …, 2017 | 559 | 2017 |
| Machine learning: The high interest credit card of technical debt D Sculley, G Holt, D Golovin, E Davydov, T Phillips, D Ebner, ... | 271 | 2014 |
| An online algorithm for maximizing submodular functions M Streeter, D Golovin Advances in Neural Information Processing Systems 21, 2008 | 245 | 2008 |
| Near-optimal bayesian active learning with noisy observations D Golovin, A Krause, D Ray Advances in Neural Information Processing Systems 23, 2010 | 196 | 2010 |
| Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization. D Golovin, A Krause COLT, 333-345, 2010 | 117 | 2010 |
| Combining multiple heuristics online M Streeter, D Golovin, SF Smith AAAI, 1197-1203, 2007 | 108 | 2007 |
| Online distributed sensor selection D Golovin, M Faulkner, A Krause Proceedings of the 9th ACM/IEEE International Conference on Information …, 2010 | 87 | 2010 |
| Max-min fair allocation of indivisible goods D Golovin School of Computer Science, Carnegie Mellon University, 2005 | 82 | 2005 |
| Online learning of assignments M Streeter, D Golovin, A Krause Advances in neural information processing systems 22, 2009 | 70 | 2009 |
| Approximating the k-multicut problem D Golovin, V Nagarajan, M Singh SODA 6, 621-630, 2006 | 57 | 2006 |
| Strongly history-independent hashing with applications GE Blelloch, D Golovin 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 272-282, 2007 | 54 | 2007 |
| Gradientless descent: High-dimensional zeroth-order optimization D Golovin, J Karro, G Kochanski, C Lee, X Song, Q Zhang arXiv preprint arXiv:1911.06317, 2019 | 39 | 2019 |
| Dynamic resource allocation in conservation planning D Golovin, A Krause, B Gardner, SJ Converse, S Morey Twenty-fifth AAAI Conference on Artificial Intelligence, 2011 | 38 | 2011 |
| Pay today for a rainy day: improved approximation algorithms for demand-robust min-cut and shortest path problems D Golovin, V Goyal, R Ravi Annual Symposium on Theoretical Aspects of Computer Science, 206-217, 2006 | 33 | 2006 |
| Online submodular maximization under a matroid constraint with application to learning assignments D Golovin, A Krause, M Streeter arXiv preprint arXiv:1407.1082, 2014 | 32 | 2014 |
| A revealed preference approach to computational complexity in economics F Echenique, D Golovin, A Wierman Proceedings of the 12th ACM conference on Electronic commerce, 101-110, 2011 | 29 | 2011 |
