Improved algorithms for bandit with graph feedback via regret decomposition

Yuchen He; Chihao Zhang

doi:10.1016/j.tcs.2023.114200

ScienceGate Book Chapters

JOURNAL ARTICLE

Improved algorithms for bandit with graph feedback via regret decomposition

Yuchen He Chihao Zhang

Year: 2023 Journal: Theoretical Computer Science Vol: 979 Pages: 114200-114200 Publisher: Elsevier BV

DOI: 10.1016/j.tcs.2023.114200

Get Full-Text PDF Get Analytical Report

Keywords:

Regret Bounded function Graph Observable Mathematics Theoretical computer science Computer science Mathematical optimization Algorithm Machine learning

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.17

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Advanced Bandit Algorithms Research

Social Sciences → Decision Sciences → Management Science and Operations Research

Reinforcement Learning in Robotics

Physical Sciences → Computer Science → Artificial Intelligence

Smart Grid Energy Management

Physical Sciences → Engineering → Electrical and Electronic Engineering

Improved algorithms for bandit with graph feedback via regret decomposition

Metrics

Topics

Related Documents

Improved Regret for Bandit Convex Optimization with Delayed Feedback

Improved Regret Bounds for Online Kernel Selection Under Bandit Feedback

Improved Bayes Regret Bounds for Multi-Task Hierarchical Bayesian Bandit Algorithms

Regret bounds for Narendra-Shapiro bandit algorithms

Regret Analysis for RL using Renewal Bandit Feedback