Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Linear Submodular Bandits and their Application to Diversified Retrieval

6 references·10 citing·40 second hop

FromToDepth

this work references cited by second hop

References

2011Contextual Bandits with Linear Payoff Functions599 cited
2008Stochastic Linear Optimization Under Bandit Feedback581 cited
2008Learning diverse rankings with multi-armed bandits504 cited
2010Linearly Parameterized Bandits428 cited
2007The Epoch-Greedy algorithm for contextual multi-armed bandits307 cited
2008Competing in the dark: An efficient algorithm for bandit linear optimization182 cited

Cited by

2014Matroid Bandits: Fast Combinatorial Optimization with Learning80 cited
2016Learning Hidden Features for Contextual Bandits79 cited
2023Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits76 cited
2021An Efficient Simulation-Based Approach to Ambulance Fleet Allocation and Dynamic Redeployment70 cited
2014Efficient Learning in Large-Scale Combinatorial Semi-Bandits48 cited
2013A fast bandit algorithm for recommendations to users with heterogeneous tastes47 cited
2016Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization44 cited
2012Contextual Sequence Prediction with Application to Control Library Optimization36 cited
2013Adaptive Submodular Maximization in Bandit Setting

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

35 cited

2013A Fast Bandit Algorithm for Recommendation to Users With Heterogenous Tastes31 cited