Reoptimization algorithms for contextual bandits with knapsack constraints
Read the original at arxiv.org→arXiv:2608.11383v1 Announce Type: new Abstract: We study new algorithms for Contextual Bandits with Knapsack. In these problems, there are finitely many types of customers, products, and resources. Each product is...
Original headline: "Reoptimization Algorithms for Contextual Bandits with Knapsack Constraints"
Coverage timeline
- Aug 13, 04:00 UTC arXiv cs.LG lead source Reoptimization Algorithms for Contextual Bandits with Knapsack Constraints