Scaling up ML-based Black-box Planning with Partial STRIPS Models

by   Matias Greco, et al.

A popular approach for sequential decision-making is to perform simulator-based search guided with Machine Learning (ML) methods like policy learning. On the other hand, model-relaxation heuristics can guide the search effectively if a full declarative model is available. In this work, we consider how a practitioner can improve ML-based black-box planning on settings where a complete symbolic model is not available. We show that specifying an incomplete STRIPS model that describes only part of the problem enables the use of relaxation heuristics. Our findings on several planning domains suggest that this is an effective way to improve ML-based black-box planning beyond collecting more data or tuning ML architectures.


page 1

page 2

page 3

page 4


Testing Monotonicity of Machine Learning Models

Today, machine learning (ML) models are increasingly applied in decision...

Does Explainable Machine Learning Uncover the Black Box in Vision Applications?

Machine learning (ML) in general and deep learning (DL) in particular ha...

MLink: Linking Black-Box Models from Multiple Domains for Collaborative Inference

The cost efficiency of model inference is critical to real-world machine...

Neural-Symbolic Descriptive Action Model from Images: The Search for STRIPS

Recent work on Neural-Symbolic systems that learn the discrete planning ...

Embedding is not Cipher: Understanding the risk of embedding leakages

Machine Learning (ML) already has been integrated into all kinds of syst...

Transfer Learning without Knowing: Reprogramming Black-box Machine Learning Models with Scarce Data and Limited Resources

Current transfer learning methods are mainly based on finetuning a pretr...

Activity-Based Search for Black-Box Contraint-Programming Solvers

Robust search procedures are a central component in the design of black-...