Co-occurring keywords · papers mentioning both
Papers
Contextual Bandits with Knapsacks for a Conversion Model
NeurIPS 2022
Bandits with Knapsacks beyond the Worst Case
NeurIPS 2021
BCORLE(λ): An Offline Reinforcement Learning and Evaluation Framework for Coupons Allocation in E-commerce Market
NeurIPS 2021
Budget-Constrained Coalition Strategies with Discounting
IJCAI 2021
Budget-feasible Maximum Nash Social Welfare is Almost Envy-free
IJCAI 2021
Confidence-Budget Matching for Sequential Budgeted Learning
ICML 2021
Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints
IJCAI 2021
Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs
NeurIPS 2021
Pre-train or Annotate? Domain Adaptation with a Constrained Budget
EMNLP 2021
Towards Hybrid Human-Machine Workflow for Natural Language Generation
EACL 2021
Constrained Reinforcement Learning via Policy Splitting
ACML 2020
Contextual Constrained Learning for Dose-Finding Clinical Trials
AISTATS 2020
Cost-Effective Incentive Allocation via Structured Counterfactual Inference
AAAI 2020
Dual Mirror Descent for Online Allocation Problems
ICML 2020
Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising
ICML 2020
FrugalML: How to use ML Prediction APIs more accurately and cheaply
NeurIPS 2020
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints
AISTATS 2020
Optimal Region Search with Submodular Maximization
IJCAI 2020
Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks
RSS 2020
Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints
ICML 2019
Dynamic Measurement Scheduling for Event Forecasting using Deep RL
ICML 2019
Hyper-parameter Tuning under a Budget Constraint
IJCAI 2019
MaxHedge: Maximizing a Maximum Online
AISTATS 2019
Pareto Efficient Auctions with Interest Rates
AAAI 2019
Stochastic Submodular Maximization with Performance-Dependent Item Costs
AAAI 2019