paper-with-me

Papers

Interpretable and Personalized Apprenticeship Scheduling: Learning Interpretable Scheduling Policies from Heterogeneous User Demonstrations

2019-06-14 · NeurIPS 2020 12 · Rohan Paleja, Andrew Silva, Letian Chen, Matthew Gombolay

Resource scheduling and coordination is an NP-hard optimization requiring an efficient allocation of agents to a set of tasks with upper- and lower bound temporal and resource constraints. Due to the large-scale and dynamic nature of resource coordination in hospitals and factories, human domain experts manually plan and adjust schedules on the fly. To perform this job, domain experts leverage heterogeneous strategies and rules-of-thumb honed over years of apprenticeship. What is critically needed is the ability to extract this domain knowledge in a heterogeneous and interpretable apprenticeship learning framework to scale beyond the power of a single human expert, a necessity in safety-critical domains. We propose a personalized and interpretable apprenticeship scheduling algorithm that infers an interpretable representation of all human task demonstrators by extracting decision-making criteria via an inferred, personalized embedding non-parametric in the number of demonstrator types. We achieve near-perfect LfD accuracy in synthetic domains and 88.22\% accuracy on a planning domain with real-world, outperforming baselines. Finally, our user study showed our methodology produces more interpretable and easier-to-use models than neural networks ($p < 0.05$).

📄 PDF Abstract BibTeX arXiv:1906.06397

Code (1)

core-robotics-lab/personalized_neural_trees 공식 구현 pytorch

Tasks

Decision MakingScheduling

Similar Papers 제목 키워드 기반

Human-Machine Collaborative Optimization via Apprenticeship Scheduling

2018-05-11 · Matthew Gombolay, Reed Jensen, Jessica Stigile, Toni Golen 외

Coordinating agents to complete a set of tasks with intercoupled temporal and resource constraints is computationally challenging, yet human domain experts can solve these difficult scheduling problems using paradigms le…

Decision MakingJob Shop SchedulingScheduling

Interpretable Modeling of Deep Reinforcement Learning Driven Scheduling

2024-03-24 · Boyang Li, Zhiling Lan, Michael E. Papka

In the field of high-performance computing (HPC), there has been recent exploration into the use of deep reinforcement learning for cluster scheduling (DRL scheduling), which has demonstrated promising outcomes. However,…

Deep Reinforcement LearningImitation Learningreinforcement-learningReinforcement Learning+1

Scheduling That Speaks: An Interpretable Programmatic Reinforcement Learning Framework

2026-05-18 · Chengpeng Hu, Yingqian Zhang, Hendrik Baier arxiv

Deep reinforcement learning (DRL) has recently emerged as a promising approach to solve combinatorial optimization problems such as job shop scheduling. However, the policies learned by DRL are typically represented by d…

Reinforcement Learning

Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning

2021-09-07 · Cristiane Ferreira, Gonçalo Figueira, Pedro Amorim

The emergence of Industry 4.0 is making production systems more flexible and also more dynamic. In these settings, schedules often need to be adapted in real-time by dispatching rules. Although substantial progress was m…

Job Shop SchedulingScheduling

CoS: Towards Optimal Event Scheduling via Chain-of-Scheduling

2025-11-17 · Yiming Zhao, Jiwei Tang, Shimin Di, Libin Zheng 외 arxiv

Recommending event schedules is a key issue in Event-based Social Networks (EBSNs) in order to maintain user activity. An effective recommendation is required to maximize the user's preference, subjecting to both time an…

Knowledge DistillationZero-Shot Learning