We stand with Ukraine

We stand with Ukraine

Daniel Golovin

According to our database¹, Daniel Golovin authored at least 38 papers between 2006 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

The Vizier Gaussian Process Bandit Algorithm.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

Setareh Ariafar

,

Srinivas Vasudevan

,

,

CoRR, 2024

2023

SmartChoices: Augmenting Software with Learned Implementations.

[BibT_eX]

[DOI]

,

,

,

,

,

Efi Kokiopoulou

,

,

,

Justin Sybrandt

,

CoRR, 2023

2022

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

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the International Conference on Automated Machine Learning, 2022

2020

Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization.

[BibT_eX]

[DOI]

Qiuyi (Richard) Zhang

,

Proceedings of the 37th International Conference on Machine Learning, 2020

Gradientless Descent: High-Dimensional Zeroth-Order Optimization.

[BibT_eX]

[DOI]

,

,

,

,

,

Qiuyi (Richard) Zhang

Proceedings of the 8th International Conference on Learning Representations, 2020

2017

Google Vizier: A Service for Black-Box Optimization.

[BibT_eX]

[DOI]

,

Benjamin Solnik

,

Subhodeep Moitra

,

,

,

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

2015

Improved approximations for two-stage min-cut and shortest path problems under uncertainty.

[BibT_eX]

[DOI]

,

,

Valentin Polishchuk

,

,

Mikko Sysikaski

Math. Program., 2015

Hidden Technical Debt in Machine Learning Systems.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Vinay Chaudhary

,

,

Jean-François Crespo

,

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014

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

[BibT_eX]

[DOI]

,

,

Matthew J. Streeter

CoRR, 2014

Sequential Decision Making in Computational Sustainability via Adaptive Submodularity.

[BibT_eX]

[DOI]

,

,

Sarah J. Converse

AI Mag., 2014

Submodular Function Maximization.

[BibT_eX]

[DOI]

,

Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013

Ad click prediction: a view from the trenches.

[BibT_eX]

[DOI]

H. Brendan McMahan

,

,

,

,

,

,

,

,

,

,

Sharat Chikkerur

,

,

Martin Wattenberg

,

Arnar Mar Hrafnkelsson

,

,

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Large-Scale Learning with Less RAM via Randomization.

[BibT_eX]

[DOI]

,

,

H. Brendan McMahan

,

Proceedings of the 30th International Conference on Machine Learning, 2013

2011

Complexity and economics: computational constraints may not matter empirically.

[BibT_eX]

[DOI]

Federico Echenique

,

,

SIGecom Exch., 2011

Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization.

[BibT_eX]

[DOI]

,

J. Artif. Intell. Res., 2011

Adaptive Submodular Optimization under Matroid Constraints

[BibT_eX]

[DOI]

,

CoRR, 2011

A revealed preference approach to computational complexity in economics.

[BibT_eX]

[DOI]

Federico Echenique

,

,

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Randomized Sensing in Adversarial Environments.

[BibT_eX]

[DOI]

,

,

Proceedings of the IJCAI 2011, 2011

Dynamic Resource Allocation in Conservation Planning.

[BibT_eX]

[DOI]

,

,

,

Sarah J. Converse

,

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees

[BibT_eX]

[DOI]

CoRR, 2010

Near-Optimal Bayesian Active Learning with Noisy Observations.

[BibT_eX]

[DOI]

,

,

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Online distributed sensor selection.

[BibT_eX]

[DOI]

,

Matthew Faulkner

,

Proceedings of the 9th International Conference on Information Processing in Sensor Networks, 2010

Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization.

[BibT_eX]

[DOI]

,

Proceedings of the COLT 2010, 2010

2009

Simultaneous source location.

[BibT_eX]

[DOI]

Konstantin Andreev

,

,

,

,

ACM Trans. Algorithms, 2009

Online Learning of Assignments that Maximize Submodular Functions

[BibT_eX]

[DOI]

,

,

Matthew J. Streeter

CoRR, 2009

Online Learning of Assignments.

[BibT_eX]

[DOI]

Matthew J. Streeter

,

,

Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

B-Treaps: A Uniquely Represented Alternative to B-Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Uniquely Represented Data Structures for Computational Geometry.

[BibT_eX]

[DOI]

Guy E. Blelloch

,

,

Virginia Vassilevska

Proceedings of the Algorithm Theory, 2008

An Online Algorithm for Maximizing Submodular Functions.

[BibT_eX]

[DOI]

Matthew J. Streeter

,

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

All-Norms and All-L_p-Norms Approximation Algorithms.

[BibT_eX]

[DOI]

,

,

,

Kanat Tangwongsan

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

More expressive market models and the future of combinatorial auctions.

[BibT_eX]

[DOI]

SIGecom Exch., 2007

Stochastic packing-market planning.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Strongly History-Independent Hashing with Applications.

[BibT_eX]

[DOI]

Guy E. Blelloch

,

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Restart Schedules for Ensembles of Problem Instances.

[BibT_eX]

[DOI]

Matthew J. Streeter

,

,

Stephen F. Smith

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Combining Multiple Heuristics Online.

[BibT_eX]

[DOI]

Matthew J. Streeter

,

,

Stephen F. Smith

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.

[BibT_eX]

[DOI]

,

,

Proceedings of the STACS 2006, 2006

Approximating the <i>k</i>-multicut problem.

[BibT_eX]

[DOI]

,

Viswanath Nagarajan

,

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Quorum placement in networks: minimizing network congestion.

[BibT_eX]

[DOI]

,

,

,

,

Michael K. Reiter

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Loading...