AAAI 2019 accepted papers on Bandits and online learning
18 of the 1,147 papers accepted at AAAI 2019 (1.6%) are on Bandits and online learning, compared with 1.7% at AAAI 2018. They fall into 3 topics.
See AAAI 2019 in the interactive map
Working on something in this area? Describe your idea in scime atlas to see the closest papers by meaning and how crowded the spot has become.
Topics and papers
Online convex optimization and games · 8 papers
- Learning Resource Allocation and Pricing for Cloud Profit Maximization (63 citations)
- Algorithms for Average Regret Minimization (13 citations)
- Robust Online Matching with User Arrival Distribution Drift (13 citations)
- Confidence Weighted Multitask Learning (8 citations)
- Optimizing Discount and Reputation Trade-Offs in E-Commerce Systems: Characterization and Online Learning (7 citations)
- Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games
- Online Pandora’s Boxes and Bandits
- Solving Imperfect-Information Games via Discounted Regret Minimization
Multi-armed bandits · 7 papers
- Incorporating Behavioral Constraints in Online AI Systems (62 citations)
- Partially Observable Multi-Sensor Sequential Change Detection: A Combinatorial Multi-Armed Bandit Approach (25 citations)
- Crawling the Community Structure of Multiplex Networks (8 citations)
- Semi-Parametric Sampling for Stochastic Bandits with Many Arms (6 citations)
- Leveraging Observations in Bandits: Between Risks and Benefits (5 citations)
- Dueling Bandits with Qualitative Feedback (4 citations)
- General Robustness Evaluation of Incentive Mechanism against Bounded Rationality Using Continuum-Armed Bandits (4 citations)
Contextual bandits and Thompson sampling · 3 papers
- Balanced Linear Contextual Bandits (50 citations)
- Efficient Counterfactual Learning from Bandit Feedback (26 citations)
- Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue (19 citations)
