scientific article; zbMATH DE number 7049771
From MaRDI portal
Publication:4633073
zbMath1485.62108arXiv1708.01791MaRDI QIDQ4633073
Ole-Christoffer Granmo, Sondre Glimsdal
Publication date: 2 May 2019
Full work available at URL: https://arxiv.org/abs/1708.01791
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thompson samplingdeceptive environmentprobabilistic bisection searchsearching on the linestochastic point location
Bayesian problems; characterization of Bayes procedures (62C10) Sequential statistical analysis (62L10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Constructing optimal binary decision trees is NP-complete
- Stochastic discretized learning-based weak estimation: a novel estimation method for non-stationary environments
- Stochastic simulation: Algorithms and analysis
- Bisection Search with Noisy Responses
- Stochastic approximation algorithms for parallel and distributed processing
- Sequential transmission using noiseless feedback
- Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach
- The stochastic root-finding problem
- Near-Optimal Regret Bounds for Thompson Sampling
- Solving two‐armed Bernoulli bandit problems using a Bayesian learning automaton
- AI 2003: Advances in Artificial Intelligence
- Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation
- The Geometry of Generalized Binary Search
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
- Stochastic approximation
- Searching games with errors -- fifty years of coping with liars
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: