Bayesian design principles for frequentist sequential learning
From MaRDI portal
Cites work
- An information-theoretic analysis of Thompson sampling
- Asymptotically efficient adaptive allocation rules
- Bandit algorithms
- Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability
- Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning
- Finite-time analysis of the multiarmed bandit problem
- From -entropy to KL-entropy: analysis of minimum information complexity density estima\-tion
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1420699 (Why is no real title available?)
- Improved regret for zeroth-order adversarial bandit convex optimisation
- Information theory. From coding to learning (to appear)
- Kernel-based methods for bandit convex optimization
- On a theorem of Danskin with an application to a theorem of Von Neumann-Sion
- On general minimax theorems
- On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
- On the sample complexity of the linear quadratic regulator
- The Nonstochastic Multiarmed Bandit Problem
- Towards optimal problem dependent generalization error bounds in statistical learning theory
- Unified algorithms for RL with decision-estimation coefficients: PAC, reward-free, preference-based learning and beyond
- Volumetric spanners: an efficient exploration basis for learning
This page was built for publication: Bayesian design principles for frequentist sequential learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892967)
