Addressing maximization bias in reinforcement learning with two-sample testing
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6378127 (Why is no real title available?)
- scientific article; zbMATH DE number 3624650 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- scientific article; zbMATH DE number 872108 (Why is no real title available?)
- scientific article; zbMATH DE number 7626792 (Why is no real title available?)
- scientific article; zbMATH DE number 3242901 (Why is no real title available?)
- A Stochastic Approximation Method
- Analysis of financial time series
- Approximation Theorems of Mathematical Statistics
- Asynchronous stochastic approximation and Q-learning
- Bandit algorithms
- Convergence results for single-step on-policy reinforcement-learning algorithms
- Estimating a smooth monotone regression function
- Estimation of the Larger of Two Normal Means
- Introduction to multi-armed bandits
- Maximum likelihood estimators for ranked means
- Non-existence of unbiased estimators of ordered parameters
- Reinforcement learning. An introduction
- Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents
- The theory of dynamic programming
- Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variables
- \({\mathcal Q}\)-learning
This page was built for publication: Addressing maximization bias in reinforcement learning with two-sample testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028236)
