Per-round knapsack-constrained linear submodular bandits

DOI10.1162/NECO_A_00887MaRDI QIDQ5380603zbMATH OpenOpenAlexWikidataFDO

Authors Baosheng Yu, Meng Fang, Dacheng Tao

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

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40)

Recommendations

• Bandits with knapsacks
• Ranking with submodular functions on a budget
• Approximation algorithms for budgeted learning problems
• Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
• Submodular Maximization Subject to a Knapsack Constraint Under Noise Models

Cites work

• scientific article; zbMATH DE number 4078557 (Why is no real title available?)
• 10.1162/153244303321897663
• A note on maximizing a submodular set function subject to a knapsack constraint
• An analysis of approximations for maximizing submodular set functions—I
• Asymptotically efficient adaptive allocation rules
• Bandits with knapsacks
• Combinatorial bandits
• Dynamic assortment with demand learning for seasonal consumer goods
• Finite-time analysis of the multiarmed bandit problem
• Near optimal online algorithms and fast approximation algorithms for resource allocation problems
• Per-round knapsack-constrained linear submodular bandits
• Playing Games with Approximation Algorithms
• Random forests
• Reinforcement learning. An introduction
• Risk-sensitive reinforcement learning
• The Nonstochastic Multiarmed Bandit Problem

Cited in

(2)

• Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
• Per-round knapsack-constrained linear submodular bandits

This page was built for publication: Per-round knapsack-constrained linear submodular bandits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380603)