Continual learning as computationally constrained reinforcement learning
From MaRDI portal
Cites work
- A Mathematical Theory of Communication
- A Tutorial on Thompson Sampling
- Algorithms for reinforcement learning.
- Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
- Bandit algorithms
- Control systems and reinforcement learning
- De Finetti's theorem for Markov chains
- Elements of Information Theory
- Foundations of the theory of probability. Translated from the German and edited by Nathan Morrison. With an added bibliography by A. T. Bharucha-Reid
- Funzione caratteristica di un fenomeno aleatorio.
- scientific article; zbMATH DE number 1304255 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 1113195 (Why is no real title available?)
- scientific article; zbMATH DE number 7014218 (Why is no real title available?)
- Non-stationary stochastic optimization
- On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
- Optimal exploration-exploitation in a multi-armed bandit problem with non-stationary rewards
- Overcoming catastrophic forgetting in neural networks
- Random sampling with a reservoir
- Reinforcement Learning, Bit by Bit
- Reinforcement learning. An introduction
- Sliding-Window Thompson Sampling for Non-Stationary Settings
- The Basic Theorems of Information Theory
- The Individual Ergodic Theorem of Information Theory
- Thompson Sampling for Bayesian Bandits with Resets
- Towards Continual Reinforcement Learning: A Review and Perspectives
This page was built for publication: Continual learning as computationally constrained reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911003)
