The researchers derived an instance-specific lower bound on the sample complexity of learning the best action with fixed confidence in online learning with feedback graphs, even when the graph is unknown and stochastic.

Authors

• Person: Samuel Tesfazgi, Leonhard Sprandl, Sandra Hirche Organization: AISTATS
  Track: Poster Session 3 - aistats 2026

Sources

• Track: Poster Session 3 - aistats 2026 virtual.aistats.org Samuel Tesfazgi, Leonhard Sprandl, Sandra Hirche · AISTATS via serper

Referenced by nodes (1)

• online learning concept