English
Related papers

Related papers: PAC-Bayesian Analysis of the Exploration-Exploitat…

200 papers

We develop a new tool for data-dependent analysis of the exploration-exploitation trade-off in learning under limited feedback. Our tool is based on two main ingredients. The first ingredient is a new concentration inequality that makes it…

Machine Learning · Computer Science 2012-01-31 Yevgeny Seldin , Nicolò Cesa-Bianchi , Peter Auer , François Laviolette , John Shawe-Taylor

Gaussian Process based Bayesian Optimization is a well-known sample efficient sequential strategy for globally optimizing black-box, expensive, and multi-extremal functions. The role of the Gaussian Process is to provide a probabilistic…

Machine Learning · Computer Science 2023-05-16 Antonio Candelieri

A well-balanced exploration-exploitation trade-off is crucial for successful acquisition functions in Bayesian optimization. However, there is a lack of quantitative measures for exploration, making it difficult to analyze and compare…

Machine Learning · Computer Science 2026-05-15 Leonard Papenmeier , Nuojin Cheng , Stephen Becker , Luigi Nardi

Bayesian optimization offers the possibility of optimizing black-box operations not accessible through traditional techniques. The success of Bayesian optimization methods such as Expected Improvement (EI) are significantly affected by the…

Machine Learning · Statistics 2018-07-04 Dipti Jasrasaria , Edward O. Pyzer-Knapp

Active learning provides a framework to adaptively query the most informative experiments towards learning an unknown black-box function. Various approaches of active learning have been proposed in the literature, however, they either focus…

Machine Learning · Computer Science 2023-10-03 Upala Junaida Islam , Kamran Paynabar , George Runger , Ashif Sikandar Iquebal

We present a set of high-probability inequalities that control the concentration of weighted averages of multiple (possibly uncountably many) simultaneously evolving and interdependent martingales. Our results extend the PAC-Bayesian…

Machine Learning · Computer Science 2012-07-31 Yevgeny Seldin , François Laviolette , Nicolò Cesa-Bianchi , John Shawe-Taylor , Peter Auer

We consider Bayesian optimization of expensive-to-evaluate experiments that generate vector-valued outcomes over which a decision-maker (DM) has preferences. These preferences are encoded by a utility function that is not known in closed…

Machine Learning · Computer Science 2022-03-23 Zhiyuan Jerry Lin , Raul Astudillo , Peter I. Frazier , Eytan Bakshy

We give tight concentration bounds for mixtures of martingales that are simultaneously uniform over (a) mixture distributions, in a PAC-Bayes sense; and (b) all finite times. These bounds are proved in terms of the martingale variance,…

Machine Learning · Computer Science 2015-06-23 Akshay Balsubramani

Can one parallelize complex exploration exploitation tradeoffs? As an example, consider the problem of optimal high-throughput experimental design, where we wish to sequentially design batches of experiments in order to simultaneously learn…

Machine Learning · Computer Science 2012-07-03 Thomas Desautels , Andreas Krause , Joel Burdick

The present paper is about estimation and prediction in high-dimensional additive models under a sparsity assumption ($p\gg n$ paradigm). A PAC-Bayesian strategy is investigated, delivering oracle inequalities in probability. The…

Methodology · Statistics 2018-05-22 Benjamin Guedj , Pierre Alquier

Universal compression can learn the source and adapt to it either in a batch mode (forward adaptation), or in a sequential mode (backward adaptation). We recast the sequential mode as a multi-armed bandit problem, a fundamental model in…

Information Theory · Computer Science 2025-06-26 Nir Weinberger , Ram Zamir

Resolving the exploration-exploitation trade-off remains a fundamental problem in the design and implementation of reinforcement learning (RL) algorithms. In this paper, we focus on model-free RL using the epsilon-greedy exploration policy,…

Machine Learning · Computer Science 2020-07-03 Michael Gimelfarb , Scott Sanner , Chi-Guhn Lee

Reinforcement learning studies how to balance exploration and exploitation in real-world systems, optimizing interactions with the world while simultaneously learning how the world operates. One general class of algorithms for such learning…

Machine Learning · Statistics 2018-08-10 Iñigo Urteaga , Chris H. Wiggins

In this paper, we study the exploration / exploitation trade-off in cellular genetic algorithms. We define a new selection scheme, the centric selection, which is tunable and allows controlling the selective pressure with a single…

Artificial Intelligence · Computer Science 2011-07-22 David Simoncini , Sébastien Verel , Philippe Collard , Manuel Clergue

The performance of acquisition functions for Bayesian optimisation to locate the global optimum of continuous functions is investigated in terms of the Pareto front between exploration and exploitation. We show that Expected Improvement…

Machine Learning · Computer Science 2021-04-29 George De Ath , Richard M. Everson , Alma A. M. Rahat , Jonathan E. Fieldsend

We present two alternative ways to apply PAC-Bayesian analysis to sequences of dependent random variables. The first is based on a new lemma that enables to bound expectations of convex functions of certain dependent random variables by…

Machine Learning · Computer Science 2011-05-20 Yevgeny Seldin , François Laviolette , John Shawe-Taylor , Jan Peters , Peter Auer

Within the framework of probably approximately correct Markov decision processes (PAC-MDP), much theoretical work has focused on methods to attain near optimality after a relatively long period of learning and exploration. However,…

Artificial Intelligence · Computer Science 2016-04-06 Kenji Kawaguchi

The main objective of this paper is to outline a theoretical framework to analyse how humans' decision-making strategies under uncertainty manage the trade-off between information gathering (exploration) and reward seeking (exploitation). A…

Artificial Intelligence · Computer Science 2021-02-16 Antonio Candelieri , Andrea Ponti , Francesco Archetti

Reinforcement learning systems are often concerned with balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of exploration can be estimated using the classical notion of Value of…

Artificial Intelligence · Computer Science 2013-01-30 Richard Dearden , Nir Friedman , David Andre

We prove semi-empirical concentration inequalities for random variables which are given as possibly nonlinear functions of independent random variables. These inequalities describe concentration of random variable in terms of the…

Machine Learning · Computer Science 2020-02-04 Ilja Kuzborskij , Csaba Szepesvári
‹ Prev 1 2 3 10 Next ›