Bandits on graphs and structures
The goal of this thesis is to investigate the structural properties of certain sequential problems in order to bring the solutions closer to a practical use. In the first part, we put a special emphasis on structures that can be represented as graphs on actions. In the second part, we study the large action spaces that can be of exponential size in the number of base actions or even infinite. For graph bandits, we consider the settings of smoothness of rewards (spectral bandits), side observations, and influence maximization. For large structured domains, we cover kernel bandits, polymatroid bandits, bandits for function optimization (including unknown smoothness), and infinitely many-arms bandits. The thesis aspires to be a survey of the author's contributions on graph and structured bandits.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Stochastic contextual bandits with graph feedback: from independence number to MAS number
We consider contextual bandits with graph feedback, a class of interactive learning problems with richer structures than vanilla contextual bandits, where taking an action reveals the rewards for all neighboring actions …
Multi-Armed BanditsAdversarial Linear Contextual Bandits with Graph-Structured Side Observations
This paper studies the adversarial graphical contextual bandits, a variant of adversarial multi-armed bandits that leverage two categories of the most common side information: \emph{contexts} and \emph{side observations}…
Multi-Armed BanditsPractical Contextual Bandits with Feedback Graphs
While contextual bandit has a mature theory, effectively leveraging different feedback patterns to enhance the pace of learning remains unclear. Bandits with feedback graphs, which interpolates between the full informati…
Multi-Armed BanditsregressionImproved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs
We study high-probability regret bounds for adversarial $K$-armed bandits with time-varying feedback graphs over $T$ rounds. For general strongly observable graphs, we develop an algorithm that achieves the optimal regre…
Multi-Armed BanditsMulti-agent Multi-armed Bandit with Fully Heavy-tailed Dynamics
We study decentralized multi-agent multi-armed bandits in fully heavy-tailed settings, where clients communicate over sparse random graphs with heavy-tailed degree distributions and observe heavy-tailed (homogeneous or h…
Multi-Armed Bandits