Easy, adaptable and high-quality Modelling with domain-specific
Constraint Patterns
- URL: http://arxiv.org/abs/2206.02479v1
- Date: Mon, 6 Jun 2022 10:29:40 GMT
- Title: Easy, adaptable and high-quality Modelling with domain-specific
Constraint Patterns
- Authors: Sophia Saller, Jana Koehler
- Abstract summary: Domain-specific constraint patterns are introduced, which form the counterpart to design patterns in software engineering for the constraint programming setting.
These patterns describe the expert knowledge and best-practice solution to recurring problems and include example implementations.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Domain-specific constraint patterns are introduced, which form the
counterpart to design patterns in software engineering for the constraint
programming setting. These patterns describe the expert knowledge and
best-practice solution to recurring problems and include example
implementations. We aim to reach a stage where, for common problems, the
modelling process consists of simply picking the applicable patterns from a
library of patterns and combining them in a model. This vastly simplifies the
modelling process and makes the models simple to adapt. By making the patterns
domain-specific we can further include problem-specific modelling ideas,
including specific global constraints and search strategies that are known for
the problem, into the pattern description. This ensures that the model we
obtain from patterns is not only correct but also of high quality. We introduce
domain-specific constraint patterns on the example of job shop and flow shop,
discuss their advantages and show how the occurrence of patterns can
automatically be checked in an event log.
Related papers
- Mining Constraints from Reference Process Models for Detecting Best-Practice Violations in Event Log [1.389948527681755]
We propose a framework for mining declarative best-practice constraints from a reference model collection.
We demonstrate the capability of our framework to detect best-practice violations through an evaluation based on real-world process model collections and event logs.
arXiv Detail & Related papers (2024-07-02T15:05:37Z) - Automated Statistical Model Discovery with Language Models [34.03743547761152]
We introduce a method for language model driven automated statistical model discovery.
We cast our automated procedure within the principled framework of Box's Loop.
Our results highlight the promise of LM-driven model discovery.
arXiv Detail & Related papers (2024-02-27T20:33:22Z) - Towards Exploratory Reformulation of Constraint Models [0.44658835512168177]
We propose a system that explores the space of models through a process of reformulation from an initial model.
We plan to situate this system in a refinement-based approach, where a user writes a constraint specification.
arXiv Detail & Related papers (2023-11-20T16:04:56Z) - Adapting Large Language Models for Content Moderation: Pitfalls in Data
Engineering and Supervised Fine-tuning [79.53130089003986]
Large Language Models (LLMs) have become a feasible solution for handling tasks in various domains.
In this paper, we introduce how to fine-tune a LLM model that can be privately deployed for content moderation.
arXiv Detail & Related papers (2023-10-05T09:09:44Z) - Earning Extra Performance from Restrictive Feedbacks [41.05874087063763]
We set up a challenge named emphEarning eXtra PerformancE from restriCTive feEDdbacks (EXPECTED) to describe this form of model tuning problems.
The goal of the model provider is to eventually deliver a satisfactory model to the local user(s) by utilizing the feedbacks.
We propose to characterize the geometry of the model performance with regard to model parameters through exploring the parameters' distribution.
arXiv Detail & Related papers (2023-04-28T13:16:54Z) - Generalization Properties of Retrieval-based Models [50.35325326050263]
Retrieval-based machine learning methods have enjoyed success on a wide range of problems.
Despite growing literature showcasing the promise of these models, the theoretical underpinning for such models remains underexplored.
We present a formal treatment of retrieval-based models to characterize their generalization ability.
arXiv Detail & Related papers (2022-10-06T00:33:01Z) - Model Reprogramming: Resource-Efficient Cross-Domain Machine Learning [65.268245109828]
In data-rich domains such as vision, language, and speech, deep learning prevails to deliver high-performance task-specific models.
Deep learning in resource-limited domains still faces multiple challenges including (i) limited data, (ii) constrained model development cost, and (iii) lack of adequate pre-trained models for effective finetuning.
Model reprogramming enables resource-efficient cross-domain machine learning by repurposing a well-developed pre-trained model from a source domain to solve tasks in a target domain without model finetuning.
arXiv Detail & Related papers (2022-02-22T02:33:54Z) - Sufficiently Accurate Model Learning for Planning [119.80502738709937]
This paper introduces the constrained Sufficiently Accurate model learning approach.
It provides examples of such problems, and presents a theorem on how close some approximate solutions can be.
The approximate solution quality will depend on the function parameterization, loss and constraint function smoothness, and the number of samples in model learning.
arXiv Detail & Related papers (2021-02-11T16:27:31Z) - DirectDebug: Automated Testing and Debugging of Feature Models [55.41644538483948]
Variability models (e.g., feature models) are a common way for the representation of variabilities and commonalities of software artifacts.
Complex and often large-scale feature models can become faulty, i.e., do not represent the expected variability properties of the underlying software artifact.
arXiv Detail & Related papers (2021-02-11T11:22:20Z) - Towards Portfolios of Streamlined Constraint Models: A Case Study with
the Balanced Academic Curriculum Problem [1.8466814193413488]
We focus on the automatic addition of streamliner constraints, derived from the types present in an abstract Essence specification of a problem class of interest.
The refinement of streamlined Essence specifications into constraint models gives rise to a large number of modelling choices.
Various forms of racing are utilised to constrain the computational cost of training.
arXiv Detail & Related papers (2020-09-21T19:48:02Z) - Goal-Aware Prediction: Learning to Model What Matters [105.43098326577434]
One of the fundamental challenges in using a learned forward dynamics model is the mismatch between the objective of the learned model and that of the downstream planner or policy.
We propose to direct prediction towards task relevant information, enabling the model to be aware of the current task and encouraging it to only model relevant quantities of the state space.
We find that our method more effectively models the relevant parts of the scene conditioned on the goal, and as a result outperforms standard task-agnostic dynamics models and model-free reinforcement learning.
arXiv Detail & Related papers (2020-07-14T16:42:59Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.