Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation
From MaRDI portal
Publication:5219733
DOI10.1287/MOOR.2018.0938zbMath1441.90105arXiv1612.03964OpenAlexW2963044532WikidataQ128534187 ScholiaQ128534187MaRDI QIDQ5219733
Peter I. Frazier, Rolf Waeber, Shane G. Henderson
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.03964
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic approximation with long range dependent and heavy tailed noise
- Searching with known error probability
- New method of stochastic approximation type
- The expected sample size of some tests of power one
- Power-one tests based on sample sums
- Spectral theory and limit theorems for geometrically ergodic Markov processes
- Stochastic simulation: Algorithms and analysis
- Bisection Search with Noisy Responses
- On the Convergence Rate for Stochastic Approximation in the Nonsmooth Setting
- Collaborative 20 Questions for Target Localization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
- Stochastic approximation algorithms for parallel and distributed processing
- Sequential transmission using noiseless feedback
- Acceleration of Stochastic Approximation by Averaging
- The stochastic root-finding problem
- Twenty Questions with Noise: Bayes Optimal Policies for Entropy Loss
- Asymptotic Behavior of Expected Sample Size in Certain One Sided Tests
- Statistical Methods Related to the Law of the Iterated Logarithm
- A Stochastic Approximation Method
This page was built for publication: Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation