Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback

v1v2v3 (latest)

Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback

7 July 2022

Lillian J. Ratliff

ArXiv (abs)PDF HTML

Papers citing "Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback"

6 / 6 papers shown

Title
Initializing Services in Interactive ML Systems for Diverse Users Avinandan Bose Mihaela Curmei Daniel L. Jiang Jamie Morgenstern Sarah Dean Lillian J. Ratliff Maryam Fazel 55 5 0 19 Dec 2023
Deep Reinforcement Learning in Computer Vision: A Comprehensive Survey Ngan Le V. Rathour Kashu Yamazaki Khoa Luu Marios Savvides VLM AI4TS 53 165 0 25 Aug 2021
Guarantees for Greedy Maximization of Non-submodular Functions with Applications Yatao Bian J. M. Buhmann Andreas Krause Sebastian Tschiatschek 70 237 0 06 Mar 2017
Matroid Bandits: Fast Combinatorial Optimization with Learning Branislav Kveton Zheng Wen Azin Ashkan Hoda Eydgahi Brian Eriksson 96 121 0 20 Mar 2014
Finite-Time Analysis of Kernelised Contextual Bandits Michal Valko N. Korda Rémi Munos I. Flaounas N. Cristianini 188 275 0 26 Sep 2013
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection Abhimanyu Das David Kempe 202 484 0 19 Feb 2011

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.