Math 2.0

Areas Mathematics of machine learning Topic

Bandit theory

Summary

This topic is a part of mathematics of machine learning. It covers sequential decisions with partial feedback, with stochastic, adversarial, Bayesian and structured bandits and their regret bounds and lower bounds.

About this page
TagA5SHDKNH0T
URIm2://A5SHDKNH0T
Kindtopic
WritingW0 stub
MSC62L05, 68Q32, 68T05
Part ofMathematics of machine learning
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.