Taking the human out of the loop: A review of Bayesian optimization

B Shahriari, K Swersky, Z Wang… - Proceedings of the …, 2015 - ieeexplore.ieee.org
Big Data applications are typically associated with systems involving large numbers of
users, massive complex software systems, and large-scale heterogeneous computing and …

A unified framework for stochastic optimization

WB Powell - European Journal of Operational Research, 2019 - Elsevier
Stochastic optimization is an umbrella term that includes over a dozen fragmented
communities, using a patchwork of sometimes overlap** notational systems with …

Causal machine learning: A survey and open problems

J Kaddour, A Lynch, Q Liu, MJ Kusner… - arxiv preprint arxiv …, 2022 - arxiv.org
Causal Machine Learning (CausalML) is an umbrella term for machine learning methods
that formalize the data-generation process as a structural causal model (SCM). This …

Non-stochastic best arm identification and hyperparameter optimization

K Jamieson, A Talwalkar - Artificial intelligence and statistics, 2016 - proceedings.mlr.press
Motivated by the task of hyperparameter optimization, we introduce the\em non-stochastic
best-arm identification problem. We identify an attractive algorithm for this setting that makes …

[BOOK][B] Reinforcement Learning and Stochastic Optimization: A Unified Framework for Sequential Decisions: by Warren B. Powell (ed.), Wiley (2022). Hardback. ISBN …

I Halperin - 2022 - Taylor & Francis
What is reinforcement learning? How is reinforcement learning different from stochastic
optimization? And finally, can it be used for applications to quantitative finance for my current …

[PDF][PDF] On the complexity of best-arm identification in multi-armed bandit models

E Kaufmann, O Cappé, A Garivier - The Journal of Machine Learning …, 2016 - jmlr.org
The stochastic multi-armed bandit model is a simple abstraction that has proven useful in
many different contexts in statistics and machine learning. Whereas the achievable limit in …

Almost optimal exploration in multi-armed bandits

Z Karnin, T Koren, O Somekh - International conference on …, 2013 - proceedings.mlr.press
We study the problem of exploration in stochastic Multi-Armed Bandits. Even in the simplest
setting of identifying the best arm, there remains a logarithmic multiplicative gap between the …

Optimal best arm identification with fixed confidence

A Garivier, E Kaufmann - Conference on Learning Theory, 2016 - proceedings.mlr.press
We give a complete characterization of the complexity of best-arm identification in one-
parameter bandit problems. We prove a new, tight lower bound on the sample complexity …

lil'ucb: An optimal exploration algorithm for multi-armed bandits

K Jamieson, M Malloy, R Nowak… - … on Learning Theory, 2014 - proceedings.mlr.press
The paper proposes a novel upper confidence bound (UCB) procedure for identifying the
arm with the largest mean in a multi-armed bandit game in the fixed confidence setting using …

Learning to learn without gradient descent by gradient descent

Y Chen, MW Hoffman… - International …, 2017 - proceedings.mlr.press
We learn recurrent neural network optimizers trained on simple synthetic functions by
gradient descent. We show that these learned optimizers exhibit a remarkable degree of …