Information theory for ranking and selection
From MaRDI portal
Publication:6093553
Recommendations
- A Knowledge-Gradient Policy for Sequential Information Collection
- Refined knowledge-gradient policy for learning probabilities
- The knowledge-gradient policy for correlated normal beliefs
- Hierarchical knowledge gradient for sequential sampling
- Sequential sampling to myopically maximize the expected value of information
Cites work
- scientific article; zbMATH DE number 6276166 (Why is no real title available?)
- A Knowledge-Gradient Policy for Sequential Information Collection
- An information-theoretic analysis of Thompson sampling
- An informational approach to the global optimization of expensive-to-evaluate functions
- Asymptotic Theory of Information-Theoretic Experimental Design
- Asymptotic optimality of myopic information-based strategies for Bayesian adaptive estimation
- Consistency of sequential Bayesian sampling policies
- Dynamic sampling allocation and design selection
- Efficient ranking and selection in parallel computing environments
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Gradient-Based Myopic Allocation Policy: An Efficient Sampling Procedure in a Low-Confidence Scenario
- Handbooks in operations research and management science: Simulation
- Hierarchical Planning of Project-Selection Problems with Information Purchasing
- On a Measure of the Information Provided by an Experiment
- On two-stage selection procedures and related probability-inequalities
- Postbuckling behavior of circular higher-order shear deformable nanoplates including surface energy effects
- Pure exploration in finitely-armed and continuous-armed bandits
- Ranking and Selection as Stochastic Control
- Selecting a selection procedure
- Sequential Design of Experiments
- Sequential sampling to myopically maximize the expected value of information
- Sequential selection with unknown correlation structures
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- \(X\)-armed bandits
Cited in
(1)
This page was built for publication: Information theory for ranking and selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093553)