arXiv Machine Learning By Akshay Balsubramani

The concentration game: Bayesian updating, regret, and information

Read the original on arXiv Machine Learning →

arXiv:2608. 18061v1 Announce Type: new Abstract: We give a two-player zero-sum repeated game between a learner and nature whose value identity generates Bayesian updating and an exact accounting of exponential-weights regret at once, and supplies the comparator-class variational form that a wide class of concentration phenomena share.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 19

Indexed Bellman Information Complexity

arXiv:2606. 11171v2 Announce Type: replace Abstract: We develop indexed Bellman information complexity, a representation-level theory of interactive decision making centered on information indices and reference histories.

By Yunbei Xu