AAAI 2018 accepted papers on Bandits and online learning
16 of the 937 papers accepted at AAAI 2018 (1.7%) are on Bandits and online learning, compared with 3.3% at AAAI 2017. They fall into 3 topics.
See AAAI 2018 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
Contextual bandits and Thompson sampling · 6 papers
- Transferable Contextual Bandit for Cross-Domain Recommendation (72 citations)
- Online Clustering of Contextual Cascading Bandits (27 citations)
- Customized Nonlinear Bandits for Online Response Selection in Neural Conversation Models (26 citations)
- Nonparametric Stochastic Contextual Bandits (17 citations)
- Learning to Interact With Learning Agents (9 citations)
- Constructive Preference Elicitation Over Hybrid Combinatorial Spaces (7 citations)
Multi-armed bandits · 5 papers
- A Change-Detection Based Framework for Piecewise-Stationary Multi-Armed Bandit Problem (106 citations)
- Efficient-UCBV: An Almost Optimal Algorithm Using Variance Estimates (57 citations)
- Budget-Constrained Multi-Armed Bandits With Multiple Plays (48 citations)
- Incentivizing High Quality User Contributions: New Arm Generation in Bandit Learning (14 citations)
- Partial Truthfulness in Minimal Peer Prediction Mechanisms With Limited Knowledge (1 citation)
Online convex optimization and games · 5 papers
- Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources (97 citations)
- A Combinatorial-Bandit Algorithm for the Online Joint Bid/Budget Optimization of Pay-per-Click Advertising Campaigns (50 citations)
- Information Directed Sampling for Stochastic Bandits With Graph Feedback (32 citations)
- Weighted Voting Via No-Regret Learning (8 citations)
- Online Learning for Structured Loss Spaces (2 citations)
