Abstract
An observer of a process (xt) believes the process is governed by Q whereas the true law is P. We bound the expected average distance between P (xt | x1, ..., xt - 1) and Q (xt | x1, ..., xt - 1) for t = 1, ..., n by a function of the relative entropy between the marginals of P and Q on the n first realizations. We apply this bound to the cost of learning in sequential decision problems and to the merging of Q to P.
| Original language | English |
|---|---|
| Pages (from-to) | 24-32 |
| Number of pages | 9 |
| Journal | Journal of Mathematical Economics |
| Volume | 44 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2008 |
| Externally published | Yes |
Keywords
- Bayesian learning
- Entropy
- Repeated decision problem
- Value of information
Fingerprint
Dive into the research topics of 'Entropy bounds on Bayesian learning'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver