mlsanityData to 7 Oct 2026

System-Agnostic Meta-Learning for MDP-based Dynamic Scheduling via Descriptive Policy

arXiv 2201.07051 ↗First posted 18 Jan 2022cs.LG stat.AP stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Dynamic scheduling is an important problem in applications from queuing to wireless networks. It addresses how to choose an item among multiple scheduling items in each timestep to achieve a long-term goal. Conventional approaches for dynamic scheduling find the optimal policy for a given specific system so that the policy from these approaches is usable only for the corresponding system characteristics. Hence, it is hard to use such approaches for a practical system in which system characteristics dynamically change. This paper proposes a novel policy structure for MDP-based dynamic scheduling, a descriptive policy, which has a system-agnostic capability to adapt to unseen system characteristics for an identical task (dynamic scheduling). To this end, the descriptive policy learns a system-agnostic scheduling principle--in a nutshell, "which condition of items should have a higher priority in scheduling". The scheduling principle can be applied to any system so that the descriptive policy learned in one system can be used for another system. Experiments with simple explanatory and realistic application scenarios demonstrate that it enables system-agnostic meta-learning with very little performance degradation compared with the system-specific conventional policies.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 41 references that are in the map. First posted on arXiv 18 Jan 2022.

Builds on

21 of 41 references.

References · 21

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2019Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AIcited by 1,543
  3. 2020Meta-Learning in Neural Networks: A Surveycited by 944
  4. 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
  5. 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 372
  6. 2016Learning to reinforcement learncited by 369
  7. 2017Automatic Goal Generation for Reinforcement Learning Agentscited by 252
  8. 2019Explainable Reinforcement Learning Through a Causal Lenscited by 177
  9. 2017Visualizing and Understanding Atari Agentscited by 141
  10. 2020Explainable Reinforcement Learning: A Surveycited by 139
  11. 2018Meta-Reinforcement Learning of Structured Exploration Strategiescited by 128
  12. 2018State Representation Learning for Control: An Overviewcited by 125
9 more
  1. 2020Explainability in Deep Reinforcement Learningcited by 96
  2. 2020Automatic Data Augmentation for Generalization in Deep Reinforcement Learningcited by 71
  3. 2019Exploratory Not Explanatory: Counterfactual Analysis of Saliency Maps for Deep Reinforcement Learningcited by 60
  4. 2019Interestingness Elements for Explainable Reinforcement Learning: Understanding Agents' Capabilities and Limitationscited by 50
  5. 2018Contrastive Explanations for Reinforcement Learning in terms of Expected Consequencescited by 44
  6. 2019Federated Deep Reinforcement Learningcited by 34
  7. 2020Model-based Adversarial Meta-Reinforcement Learningcited by 32
  8. 2019Meta Reinforcement Learning with Task Embedding and Shared Policycited by 15
  9. 2016Partially Observable Markov Decision Process for Recommender Systemscited by 11

Built on by

Not cited yet.