16 research outputs found
AQUA:An Efficient Solver for the User Authorization Query Problem
We present AQUA, a solver for the User Authorization Query (UAQ) problem in Role-Based Access Control (RBAC). The UAQ problem amounts to determining a set of roles granting a given set of permissions, satisfying a collection of authorisation constraints (most notably Dynamic Mutually-Exclusive Roles, DMER) and achieving some optimization objective, i.e. seeking min/max/any number of roles to activate and/or permissions to grant. AQUA supports the enforcement of a wide class of DMER constraints as well as several types of optimization objectives (namely, min/max/any number of roles to activate, min/max/any number of permissions to grant, and a combinations thereof). In this paper, we demonstrate the use of AQUA∼over a running example while providing certain implementation details including the architecture
Constraints First: A New MDD-based Model to Generate Sentences Under Constraints
This paper introduces a new approach to generating strongly constrained
texts. We consider standardized sentence generation for the typical application
of vision screening. To solve this problem, we formalize it as a discrete
combinatorial optimization problem and utilize multivalued decision diagrams
(MDD), a well-known data structure to deal with constraints. In our context,
one key strength of MDD is to compute an exhaustive set of solutions without
performing any search. Once the sentences are obtained, we apply a language
model (GPT-2) to keep the best ones. We detail this for English and also for
French where the agreement and conjugation rules are known to be more complex.
Finally, with the help of GPT-2, we get hundreds of bona-fide candidate
sentences. When compared with the few dozen sentences usually available in the
well-known vision screening test (MNREAD), this brings a major breakthrough in
the field of standardized sentence generation. Also, as it can be easily
adapted for other languages, it has the potential to make the MNREAD test even
more valuable and usable. More generally, this paper highlights MDD as a
convincing alternative for constrained text generation, especially when the
constraints are hard to satisfy, but also for many other prospects.Comment: To be published in Proceedings of the Thirty-Second International
Joint Conference on Artificial Intelligence, IJCAI 202
Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP
The traditional Capacitated Vehicle Routing Problem (CVRP) minimizes the total distance of the routes under the capacity constraints of the vehicles. But more often, the objective involves multiple criteria including not only the total distance of the tour but also other factors such as travel costs, travel time, and fuel consumption. Moreover, in reality, there are numerous implicit preferences ingrained in the minds of the route planners and the drivers. Drivers, for instance, have familiarity with certain neighborhoods and knowledge of the state of roads, and often consider the best places for rest and lunch breaks. This knowledge is difficult to formulate and balance when operational routing decisions have to be made.
This motivates us to learn the implicit preferences from past solutions and to incorporate these learned preferences in the optimization process. These preferences are in the form of arc probabilities, i.e., the more preferred a route is, the higher is the joint probability. The novelty of this work is the use of a neural network model to estimate the arc probabilities, which allows for additional features and automatic parameter estimation. This first requires identifying suitable features, neural architectures and loss functions, taking into account that there is typically few data available. We investigate the difference with a prior weighted Markov counting approach, and study the applicability of neural networks in this setting
DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean Optimization
Local search is an effective method for solving large-scale combinatorial
optimization problems, and it has made remarkable progress in recent years
through several subtle mechanisms. In this paper, we found two ways to improve
the local search algorithms in solving Pseudo-Boolean Optimization (PBO):
Firstly, some of those mechanisms such as unit propagation are merely used in
solving MaxSAT before, which can be generalized to solve PBO as well; Secondly,
the existing local search algorithms utilize the heuristic on variables,
so-called score, to mainly guide the search. We attempt to gain more insights
into the clause, as it plays the role of a middleman who builds a bridge
between variables and the given formula. Hence, we first extended the
combination of unit propagation-based decimation algorithm to PBO problem,
giving a further generalized definition of unit clause for PBO problem, and
apply it to the existing solver LS-PBO for constructing an initial assignment;
then, we introduced a new heuristic on clauses, dubbed care, to set a higher
priority for the clauses that are less satisfied in current iterations.
Experiments on benchmarks from the most recent PB Competition, as well as three
real-world application benchmarks including minimum-width confidence band,
wireless sensor network optimization, and seating arrangement problems show
that our algorithm DeciLS-PBO has a promising performance compared to the
state-of-the-art algorithms
Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunities
Decision-focused learning (DFL) is an emerging paradigm in machine learning
which trains a model to optimize decisions, integrating prediction and
optimization in an end-to-end system. This paradigm holds the promise to
revolutionize decision-making in many real-world applications which operate
under uncertainty, where the estimation of unknown parameters within these
decision models often becomes a substantial roadblock. This paper presents a
comprehensive review of DFL. It provides an in-depth analysis of the various
techniques devised to integrate machine learning and optimization models,
introduces a taxonomy of DFL methods distinguished by their unique
characteristics, and conducts an extensive empirical evaluation of these
methods proposing suitable benchmark dataset and tasks for DFL. Finally, the
study provides valuable insights into current and potential future avenues in
DFL research.Comment: Experimental Survey and Benchmarkin
A Maximum Satisfiability Based Approach to Bi-Objective Boolean Optimization
Many real-world problem settings give rise to NP-hard combinatorial optimization problems. This results in a need for non-trivial algorithmic approaches for finding optimal solutions to such problems. Many such approaches—ranging from probabilistic and meta-heuristic algorithms to declarative programming—have been presented for optimization problems with a single objective. Less work has been done on approaches for optimization problems with multiple objectives.
We present BiOptSat, an exact declarative approach for finding so-called Pareto-optimal solutions to bi-objective optimization problems. A bi-objective optimization problem arises for example when learning interpretable classifiers and the size, as well as the classification error of the classifier should be taken into account as objectives. Using propositional logic as a declarative programming language, we seek to extend the progress and success in maximum satisfiability (MaxSAT) solving to two objectives. BiOptSat can be viewed as an instantiation of the lexicographic method and makes use of a single SAT solver that is preserved throughout the entire search procedure. It allows for solving three tasks for bi-objective optimization: finding a single Pareto-optimal solution, finding one representative solution for each Pareto point, and enumerating all Pareto-optimal solutions.
We provide an open-source implementation of five variants of BiOptSat, building on different algorithms proposed for MaxSAT. Additionally, we empirically evaluate these five variants, comparing their runtime performance to that of three key competing algorithmic approaches. The empirical comparison in the contexts of learning interpretable decision rules and bi-objective set covering shows practical benefits of our approach. Furthermore, for the best-performing variant of BiOptSat, we study the effects of proposed refinements to determine their effectiveness
Investigation of Matching Problems using Constraint Programming and Optimisation Methods
This thesis focuses on matching under ordinal preferences, i.e. problems where agents may be required to list other agents that they find acceptable in order of preference. In particular, we focus on two main cases: the popular matching and the kidney exchange problem. These problems are important in practice and in this thesis we develop novel algorithms and techniques to solve them as combinatorial optimisation problems. The first part of the thesis focuses on one-sided matching on a bipartite graph, specifically the popular matching. When the participants express their preferences in an ordinal order, one might want to guarantee that no two applicants are inclined to form a coalition in order to maximise their welfare, thus finding a stable matching is needed. Popularity is a concept that offers an attractive trade- off between these two notions. In particular, we examine the popular matching in the context of constraint programming using global constraints. We discuss the possibility to find a popular matching even for the instances that does not admit one.
The second part of the thesis focuses on non-bipartite graphs, i.e. the kidney exchange problem. Kidney transplant is the most effective treatment to cure end-stage renal disease, affecting one in every thousand European citizen. Motivated by the observation that the kidney exchange is inherently a stochastic online problem, first, we give a stochastic online method, which provides an expected value estimation that is correct within the limit of sampling errors. Second, we show that by taking into consideration a probabilistic model of future arrivals and drop-offs, we can get reduce sampling scenarios, and we can even construct a sampling-free probabilistic model, called the Abstract Exchange Graph (AEG). A final contribution of this thesis is related to finding robust solutions when uncertainty occurs. Uncertainty is inherent to most real world problems
MaxSAT Evaluation 2020 : Solver and Benchmark Descriptions
Non peer reviewe