1 citations · 1 across the 2 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2024
Stochastic -Submodular Bandits with Full Bandit Feedback
Guanyu Nie, Vaneet Aggarwal, Christopher John Quinn
In this paper, we present the first sublinear -regret bounds for online -submodular optimization problems with full-bandit feedback, where is a corresponding offline appr…
cs.LG2023★ 1 cited
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback
Guanyu Nie, Yididiya Y Nadew, Yanhui Zhu +2
We investigate the problem of stochastic, combinatorial multi-armed bandits where the learner only has access to bandit feedback and the reward function can be non-linear. We provi…