Planning and Scheduling in Digital Health with Answer Set Programming
- URL: http://arxiv.org/abs/2208.03099v1
- Date: Fri, 5 Aug 2022 10:51:02 GMT
- Title: Planning and Scheduling in Digital Health with Answer Set Programming
- Authors: Marco Mochi
- Abstract summary: Problems in the healthcare are complex since to solve them several constraints and different type of resources should be taken into account.
We plan to propose solutions to these kind of problems both expanding already tested solutions and by modelling solutions for new problems.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In the hospital world there are several complex combinatory problems, and
solving these problems is important to increase the degree of patients'
satisfaction and the quality of care offered. The problems in the healthcare
are complex since to solve them several constraints and different type of
resources should be taken into account. Moreover, the solutions must be
evaluated in a small amount of time to ensure the usability in real scenarios.
We plan to propose solutions to these kind of problems both expanding already
tested solutions and by modelling solutions for new problems, taking into
account the literature and by using real data when available. Solving these
kind of problems is important but, since the European Commission established
with the General Data Protection Regulation that each person has the right to
ask for explanation of the decision taken by an AI, without developing
Explainability methodologies the usage of AI based solvers e.g. those based on
Answer Set programming will be limited. Thus, another part of the research will
be devoted to study and propose new methodologies for explaining the solutions
obtained.
Related papers
- Estimating Difficulty Levels of Programming Problems with Pre-trained Model [18.92661958433282]
The difficulty level of each programming problem serves as an essential reference for guiding students' adaptive learning.
We formulate the problem of automatic difficulty level estimation of each programming problem, given its textual description and a solution example of code.
For tackling this problem, we propose to couple two pre-trained models, one for text modality and the other for code modality, into a unified model.
arXiv Detail & Related papers (2024-06-13T05:38:20Z) - Learning Task Decomposition to Assist Humans in Competitive Programming [90.4846613669734]
We introduce a novel objective for learning task decomposition, termed value (AssistV)
We collect a dataset of human repair experiences on different decomposed solutions.
Under 177 hours of human study, our method enables non-experts to solve 33.3% more problems, speeds them up by 3.3x, and empowers them to match unassisted experts.
arXiv Detail & Related papers (2024-06-07T03:27:51Z) - Mining Potentially Explanatory Patterns via Partial Solutions [39.58317527488534]
We present an algorithm that assembles a collection of Partial Solutions chosen to strike a balance between high fitness, simplicity and atomicity.
Experiments with standard benchmarks show that the proposed algorithm is able to find Partial Solutions which improve explainability at reasonable computational cost without affecting search performance.
arXiv Detail & Related papers (2024-04-05T20:12:02Z) - Attention-based Reinforcement Learning for Combinatorial Optimization: Application to Job Shop Scheduling Problem [2.024210754085351]
This study proposes an innovative attention-based reinforcement learning method specifically designed for the category of job shop scheduling problems.
A key finding of this research is the ability of our trained learners within the proposed method to be repurposed for larger-scale problems that were not part of the initial training set.
arXiv Detail & Related papers (2024-01-29T21:31:54Z) - On solving decision and risk management problems subject to uncertainty [91.3755431537592]
Uncertainty is a pervasive challenge in decision and risk management.
This paper develops a systematic understanding of such strategies, determine their range of application, and develop a framework to better employ them.
arXiv Detail & Related papers (2023-01-18T19:16:23Z) - A Mutual Information Maximization Approach for the Spurious Solution
Problem in Weakly Supervised Question Answering [60.768146126094955]
Weakly supervised question answering usually has only the final answers as supervision signals.
There may exist many spurious solutions that coincidentally derive the correct answer, but training on such solutions can hurt model performance.
We propose to explicitly exploit such semantic correlations by maximizing the mutual information between question-answer pairs and predicted solutions.
arXiv Detail & Related papers (2021-06-14T05:47:41Z) - The Medkit-Learn(ing) Environment: Medical Decision Modelling through
Simulation [81.72197368690031]
We present a new benchmarking suite designed specifically for medical sequential decision making.
The Medkit-Learn(ing) Environment is a publicly available Python package providing simple and easy access to high-fidelity synthetic medical data.
arXiv Detail & Related papers (2021-06-08T10:38:09Z) - Discovering Diverse Solutions in Deep Reinforcement Learning [84.45686627019408]
Reinforcement learning algorithms are typically limited to learning a single solution of a specified task.
We propose an RL method that can learn infinitely many solutions by training a policy conditioned on a continuous or discrete low-dimensional latent variable.
arXiv Detail & Related papers (2021-03-12T04:54:31Z) - Learning Combined Set Covering and Traveling Salesman Problem [2.0407204637672893]
We study a combined Set Covering and Traveling Salesman problem and provide a mixed integer programming formulation to solve the problem.
Motivated by applications where the optimal policy needs to be updated on a regular basis, we propose a machine learning approach to effectively deal with this problem.
arXiv Detail & Related papers (2020-07-07T05:11:28Z) - Learning What to Defer for Maximum Independent Sets [84.00112106334655]
We propose a novel DRL scheme, coined learning what to defer (LwD), where the agent adaptively shrinks or stretch the number of stages by learning to distribute the element-wise decisions of the solution at each stage.
We apply the proposed framework to the maximum independent set (MIS) problem, and demonstrate its significant improvement over the current state-of-the-art DRL scheme.
arXiv Detail & Related papers (2020-06-17T02:19:31Z)
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.