Noisy binary search and its applications
From MaRDI portal
Recommendations
Cited in
(26)- Operations research applications of dichotomous search
- Regret bounds for sleeping experts and bandits
- An efficient noisy binary search in graphs via Median approximation
- The power of adaptivity in source identification with time queries on the path
- Bisection search with noisy responses
- Recurring comparison faults: sorting and finding the minimum
- Analyzing simulations in Monte-Carlo tree search for the game of Go
- Fast error-tolerant quartet phylogeny algorithms
- Fast error-tolerant quartet phylogeny algorithms
- The \(K\)-armed dueling bandits problem
- Maximum selection and sorting with adversarial comparators
- Searching a Tree with Permanently Noisy Advice
- Sorting with Recurrent Comparison Errors
- Coping with errors in binary search procedures (Preliminary Report)
- Search with Noisy and Delayed Responses
- Edge and pair queries-random graphs and complexity
- External-memory sorting with comparison errors
- Subsampling suffices for adaptive data analysis
- Sharp noisy binary search with monotonic probabilities
- Approximate selection with unreliable comparisons in sublinear time
- The query complexity of searching trees with permanently noisy advice
- A finite-horizon approach to active level set estimation
- Parameter estimation for Gibbs distributions
- Learning with comparison feedback: online estimation of sample statistics
- Dynamic pricing with finitely many unknown valuations
- Noisy (binary) searching: simple, fast and correct
This page was built for publication: Noisy binary search and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934677)
