Approximation algorithms for budgeted learning problems

MaRDI QIDQ3549602zbMATH OpenFDO

Authors Sudipto Guha, Kamesh Munagala

Publication date 5 January 2009

zbMATH Keywords

approximation algorithmslinear programstochastic packingbudgeted learning problemsbudgeted multi-armed bandit problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Recommendations

• The ratio index for budgeted learning, with applications
• Bandits with knapsacks
• Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
• Learning Theory
• Asymptotically optimal algorithms for budgeted multiple play bandits

Cited in

(26)

• Learning Theory
• Sensor scheduling for space object tracking and collision alert
• Per-round knapsack-constrained linear submodular bandits
• Stochastic graph exploration with limited resources
• Budgeted multi-armed bandit in continuous action space
• Stochastic unsplittable flows
• Bandits with knapsacks
• The ratio index for budgeted learning, with applications
• Approximation algorithms for stochastic combinatorial optimization problems
• scientific article; zbMATH DE number 7650116 (Why is no real title available?)
• scientific article; zbMATH DE number 7053373 (Why is no real title available?)
• Submodular stochastic probing on matroids
• Approximation and learning by greedy algorithms
• Differentially private and budget-limited bandit learning over matroids
• Asymptotically optimal multi-armed bandit policies under a cost constraint
• Stochastic graph exploration
• Asymptotically optimal algorithms for budgeted multiple play bandits
• Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• Bandits with global convex constraints and objective
• Bayesian Incentive-Compatible Bandit Exploration
• Thompson sampling-based recursive block elimination for dynamic assignment under limited budget in pure-exploration
• A PAC algorithm in relative precision for bandit problem with costly sampling
• Efficient learning with partially observed attributes
• Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
• scientific article; zbMATH DE number 7378727 (Why is no real title available?)

This page was built for publication: Approximation algorithms for budgeted learning problems

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