JMLR 2021 papers on Bandits and online learning
16 of the 285 papers published in JMLR 2021 (5.6%) are on Bandits and online learning, compared with 2.9% at JMLR 2020. They fall into 3 topics.
See JMLR 2021 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 · 9 papers
- Bandit Learning in Decentralized Matching Markets (32 citations)
- Bandit Convex Optimization in Non-stationary Environments (25 citations)
- Exact Asymptotics for Linear Quadratic Adaptive Control (11 citations)
- Fast Learning for Renewal Optimization in Online Task Scheduling (10 citations)
- Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks (8 citations)
- Prediction against a limited adversary (3 citations)
- Refined approachability algorithms and application to regret minimization with global costs (2 citations)
- Simple and Fast Algorithms for Interactive Machine Learning with Random Counter-examples
- Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits
