Optimal and Myopic Information Acquisition
We consider the problem of optimal dynamic information acquisition from many correlated information sources. Each period, the decision-maker jointly takes an action and allocates a fixed number of observations across the available sources. His payoff depends on the actions taken and on an unknown state. In the canonical setting of jointly normal information sources, we show that the optimal dynamic information acquisition rule proceeds myopically after finitely many periods. If signals are acquired in large blocks each period, then the optimal rule turns out to be myopic from period 1. These results demonstrate the possibility of robust and "simple" optimal information acquisition, and simplify the analysis of dynamic information acquisition in a widely used informational environment.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Two-step Lookahead Bayesian Optimization with Inequality Constraints
Recent advances in computationally efficient non-myopic Bayesian optimization (BO) improve query efficiency over traditional myopic methods like expected improvement while only modestly increasing computational cost. The…
Bayesian OptimizationVocal Bursts Valence PredictionConstrained Two-step Look-Ahead Bayesian Optimization
Recent advances in computationally efficient non-myopic Bayesian optimization offer improved query efficiency over traditional myopic methods like expected improvement, with only a modest increase in computational cost. …
Bayesian OptimizationVocal Bursts Valence PredictionDifferentiating Policies for Non-Myopic Bayesian Optimization
Bayesian optimization (BO) methods choose sample points by optimizing an acquisition function derived from a statistical model of the objective. These acquisition functions are chosen to balance sampling regions with pre…
Bayesian OptimizationNonmyopic Gaussian Process Optimization with Macro-Actions
This paper presents a multi-staged approach to nonmyopic adaptive Gaussian process optimization (GPO) for Bayesian optimization (BO) of unknown, highly complex objective functions that, in contrast to existing nonmyopic …
Bayesian OptimizationNonmyopic Global Optimisation via Approximate Dynamic Programming
Unconstrained global optimisation aims to optimise expensive-to-evaluate black-box functions without gradient information. Bayesian optimisation, one of the most well-known techniques, typically employs Gaussian processe…
Bayesian OptimisationGaussian ProcessesSequential Decision Making