activity
20092023
most citedAdaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization

207 citations · 435 across the 12 of their papers we have counts for

collaborators

12 papers

cs.SE2023

SmartChoices: Augmenting Software with Learned Implementations

Daniel Golovin, Gabor Bartok, Eric Chen +7

In many software systems, heuristics are used to make decisions - such as cache eviction, task scheduling, and information presentation - that have a significant impact on overall…

cs.LG2022★ 4 cited

Open Source Vizier: Distributed Infrastructure and API for Reliable and Flexible Blackbox Optimization

Xingyou Song, Sagi Perel, Chansoo Lee +2

Vizier is the de-facto blackbox and hyperparameter optimization service across Google, having optimized some of Google's largest products and research efforts. To operate at the sc…

cs.LG2020★ 13 cited

Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization

Daniel Golovin, Qiuyi Zhang

Single-objective black box optimization (also known as zeroth-order optimization) is the process of minimizing a scalar objective , given evaluations at adaptively chosen inp…

cs.LG2019★ 39 cited

Gradientless Descent: High-Dimensional Zeroth-Order Optimization

Daniel Golovin, John Karro, Greg Kochanski +3

Zeroth-order optimization is the process of minimizing an objective , given oracle access to evaluations at adaptively chosen inputs . In this paper, we present two simple…

cs.LG2014★ 25 cited

Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments

Daniel Golovin, Andreas Krause, Matthew Streeter

Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize the value of the ranking? These app…

cs.LG2013★ 11 cited

Large-Scale Learning with Less RAM via Randomization

Daniel Golovin, D. Sculley, H. Brendan McMahan +1

We reduce the memory footprint of popular large-scale online learning methods by projecting our weight vector onto a coarse discrete set using randomized rounding. Compared to stan…