Practical Contextual Bandits for Large-Scale Structured Discrete Constrained Optimization Problems
Authors:
- Pavithra HarshaPHPavithra Harsha
- Chitra SubramanianCSChitra Subramanian
- Naoki AbeNANaoki Abe
- Shivaram SubramanianSSShivaram Subramanian
- Amadou BaABAmadou Ba
- Kevin Arturo Fernández RománKRKevin Arturo Fernández Román
- Mauricio Longinos GarridoMGMauricio Longinos Garrido
- Chandrasekhar NarayanaswamiCNChandrasekhar Narayanaswami
Open Access
- 3 August 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 850-859
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Ursa: Lightweight Resource Management for Cloud-Native Microservices2024
- Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under RealizabilityMathematics of Operations Research, 2022
- Bandit algorithms to personalize educational chatbotsMachine Learning, 2021
- Online Decision Making with High-Dimensional CovariatesOperations Research, 2020
- A Practical Price Optimization Approach for Omnichannel RetailingINFORMS Journal on Optimization, 2019
- From Ads to Interventions: Contextual Bandits in Mobile Health2017
- Pricing Problems Under the Nested Logit Model with a Quality Consistency ConstraintINFORMS Journal on Computing, 2017
- A contextual-bandit approach to personalized news article recommendation2010
- An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling ProblemsINFORMS Journal on Computing, 2008
- Reinforcement Learning with Immediate Rewards and Linear HypothesesAlgorithmica, 2003