Using cache or credit for parallel ranking and selection
From MaRDI portal
Publication:6599359
DOI10.1145/3618299zbMath1544.62005MaRDI QIDQ6599359
Eunhye Song, Harun Avci, Barry L. Nelson, Andreas Wächter
Publication date: 6 September 2024
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Computational methods for problems pertaining to statistics (62-08) Parallel numerical computation (65Y05) Statistical ranking and selection procedures (62F07)
Cites Work
- Efficient global optimization of expensive black-box functions
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
- Selecting a Selection Procedure
- A Knowledge-Gradient Policy for Sequential Information Collection
- Distributed web-based simulation experiments for optimization
- A fully sequential procedure for indifference-zone selection in simulation
- Control variates for screening, selection, and estimation of the best
- Efficient Ranking and Selection in Parallel Computing Environments
- Gaussian Markov Random Fields for Discrete Optimization via Simulation: Framework and Algorithms
- Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments
- On parallel policies for ranking and selection problems
- Simple Bayesian Algorithms for Best-Arm Identification
- Complete expected improvement converges to an optimal budget allocation
- Myopic Allocation Policy With Asymptotically Optimal Sampling Rate
This page was built for publication: Using cache or credit for parallel ranking and selection
