Per-Round Knapsack-Constrained Linear Submodular Bandits
From MaRDI portal
Publication:5380603
DOI10.1162/NECO_a_00887zbMath1474.68331OpenAlexW2520047712WikidataQ47392785 ScholiaQ47392785MaRDI QIDQ5380603
Meng Fang, Dacheng Tao, Baosheng Yu
Publication date: 5 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00887
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial bandits
- Asymptotically efficient adaptive allocation rules
- A note on maximizing a submodular set function subject to a knapsack constraint
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
- Playing Games with Approximation Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Bandits with Knapsacks
- Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
- The Nonstochastic Multiarmed Bandit Problem
- 10.1162/153244303321897663
- Per-Round Knapsack-Constrained Linear Submodular Bandits
- Risk-Sensitive Reinforcement Learning
- Random forests
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: Per-Round Knapsack-Constrained Linear Submodular Bandits
