scholarly journals On the Temperature of SAT Formulas

2021 ◽  
Author(s):  
Jesús Giráldez-Cru ◽  
Pedro Almagro-Blanco
Keyword(s):  
Artificial Intelligence ◽  
Formal Verification ◽  
Real World ◽  
Random Model ◽  
Community Structures ◽  
Sat Solving ◽  
Scale Free ◽  
Real World Applications ◽  
The Cost ◽  
Challenging Question

The remarkable advances in SAT solving achieved in the last years have allowed to use this technology in many real-world applications of Artificial Intelligence, such as planning, formal verification, and scheduling, among others. Interestingly, these industrial SAT problems are commonly believed to be easier than classical random SAT formulas, but estimating their actual hardness is still a very challenging question, which in some cases even requires to solve them. In this context, realistic pseudo-industrial random SAT generators have emerged with the aim of reproducing the main features shared by the majority of these application problems. The study of these models may help to better understand the success of those SAT solving techniques and possibly improve them. In this work, we present a model to estimate the temperature of real-world SAT instances. This temperature represents the degree of distortion into the expected structure of the formula, from highly structured benchmarks (more similar to real-world SAT instances) to the complete absence of structure (observed in the classical random SAT model). Our solution is based on the Popularity-Similarity (PS) random model for SAT, which has been recently presented to reproduce two crucial features of application SAT benchmarks: scale-free and community structures. The PS model is able to control the hardness of the generated formula by introducing some randomizations in the expected structure. Our solution is a first step towards a hardness oracle based on the temperature of SAT formulas, which may be able to estimate the cost of solving real-world SAT instances without solving them.

scholarly journals A Survey on Bias and Fairness in Machine Learning

2021 ◽  
Vol 54 (6) ◽  
pp. 1-35
Author(s):  
Ninareh Mehrabi ◽  
Fred Morstatter ◽  
Nripsuta Saxena ◽  
Kristina Lerman ◽  
Aram Galstyan
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Deep Learning ◽  
Real World ◽  
State Of The Art ◽  
Future Directions ◽  
Discriminatory Behavior ◽  
Real World Applications ◽  
Near Future ◽  
Different Sources

With the widespread use of artificial intelligence (AI) systems and applications in our everyday lives, accounting for fairness has gained significant importance in designing and engineering of such systems. AI systems can be used in many sensitive environments to make important and life-changing decisions; thus, it is crucial to ensure that these decisions do not reflect discriminatory behavior toward certain groups or populations. More recently some work has been developed in traditional machine learning and deep learning that address such challenges in different subdomains. With the commercialization of these systems, researchers are becoming more aware of the biases that these applications can contain and are attempting to address them. In this survey, we investigated different real-world applications that have shown biases in various ways, and we listed different sources of biases that can affect AI applications. We then created a taxonomy for fairness definitions that machine learning researchers have defined to avoid the existing bias in AI systems. In addition to that, we examined different domains and subdomains in AI showing what researchers have observed with regard to unfair outcomes in the state-of-the-art methods and ways they have tried to address them. There are still many future directions and solutions that can be taken to mitigate the problem of bias in AI systems. We are hoping that this survey will motivate researchers to tackle these issues in the near future by observing existing work in their respective fields.

Against generalisation: Data-driven decisions need context to be human-compatible

2021 ◽  
pp. 026638212110619
Author(s):  
Sharon Richardson
Keyword(s):  
Artificial Intelligence ◽  
Real World ◽  
Data Science ◽  
Machine Learning Algorithms ◽  
Data Driven ◽  
Theoretical Frameworks ◽  
The Past ◽  
Real World Applications ◽  
Contextual Framework ◽  
Data Driven Decisions

During the past two decades, there have been a number of breakthroughs in the fields of data science and artificial intelligence, made possible by advanced machine learning algorithms trained through access to massive volumes of data. However, their adoption and use in real-world applications remains a challenge. This paper posits that a key limitation in making AI applicable has been a failure to modernise the theoretical frameworks needed to evaluate and adopt outcomes. Such a need was anticipated with the arrival of the digital computer in the 1950s but has remained unrealised. This paper reviews how the field of data science emerged and led to rapid breakthroughs in algorithms underpinning research into artificial intelligence. It then discusses the contextual framework now needed to advance the use of AI in real-world decisions that impact human lives and livelihoods.

scholarly journals Neural Representation and Learning of Hierarchical 2-additive Choquet Integrals

2020 ◽  
Author(s):  
Roman Bresson ◽  
Johanne Cohen ◽  
Eyke Hüllermeier ◽  
Christophe Labreuche ◽  
Michèle Sebag
Keyword(s):  
Real World ◽  
Choquet Integral ◽  
Marginal Utility ◽  
Decision Makers ◽  
Neural Representation ◽  
Automatic Identification ◽  
Neural Architecture ◽  
Real World Applications ◽  
Choquet Integrals ◽  
The Cost

Multi-Criteria Decision Making (MCDM) aims at modelling expert preferences and assisting decision makers in identifying options best accommodating expert criteria. An instance of MCDM model, the Choquet integral is widely used in real-world applications, due to its ability to capture interactions between criteria while retaining interpretability. Aimed at a better scalability and modularity, hierarchical Choquet integrals involve intermediate aggregations of the interacting criteria, at the cost of a more complex elicitation. The paper presents a machine learning-based approach for the automatic identification of hierarchical MCDM models, composed of 2-additive Choquet integral aggregators and of marginal utility functions on the raw features from data reflecting expert preferences. The proposed NEUR-HCI framework relies on a specific neural architecture, enforcing by design the Choquet model constraints and supporting its end-to-end training. The empirical validation of NEUR-HCI on real-world and artificial benchmarks demonstrates the merits of the approach compared to state-of-art baselines.

Chapter 3. Complete Algorithms

2021 ◽  
Author(s):  
Adnan Darwiche ◽  
Knot Pipatsrisawat
Keyword(s):  
Real World ◽  
Theoretical Perspective ◽  
Point Of View ◽  
Sat Solving ◽  
Practical Point ◽  
Sat Solvers ◽  
Proof Systems ◽  
Real World Applications ◽  
Clause Learning

Complete SAT algorithms form an important part of the SAT literature. From a theoretical perspective, complete algorithms can be used as tools for studying the complexities of different proof systems. From a practical point of view, these algorithms form the basis for tackling SAT problems arising from real-world applications. The practicality of modern, complete SAT solvers undoubtedly contributes to the growing interest in the class of complete SAT algorithms. We review these algorithms in this chapter, including Davis-Putnum resolution, Stalmarck’s algorithm, symbolic SAT solving, the DPLL algorithm, and modern clause-learning SAT solvers. We also discuss the issue of certifying the answers of modern complete SAT solvers.

Rich-Media Interactive Simulations

2016 ◽  
pp. 261-283
Author(s):  
Suzanne Tsacoumis
Keyword(s):  
Real World ◽  
High Fidelity ◽  
Rich Media ◽  
Job Candidates ◽  
Real World Applications ◽  
Fidelity Measures ◽  
Time Required ◽  
The Cost ◽  
Interactive Simulations

High fidelity measures have proven to be powerful tools for measuring a broad range of competencies and their validity is well documented. However, their high-touch nature is often a deterrent to their use due to the cost and time required to develop and implement them. In addition, given the increased reliance on technology to screen and evaluate job candidates, organizations are continuing to search for more efficient ways to gather the information they need about one's capabilities. This chapter describes how innovative, interactive rich-media simulations that incorporate branching technology have been used in several real-world applications. The main focus is on describing the nature of these assessments and highlighting potential solutions to the unique measurement challenges associated with these types of assessments.

Private identity agreement for private set functionalities

2021 ◽  
pp. 1-29
Author(s):  
Ben Kreuter ◽  
Sarvar Patel ◽  
Ben Terner
Keyword(s):  
Real World ◽  
Research Community ◽  
Multiparty Computation ◽  
Privacy Requirements ◽  
Set Intersection ◽  
Real World Applications ◽  
Private Set Intersection ◽  
The Cost ◽  
Significant Attention ◽  
Private Identity

Private set intersection and related functionalities are among the most prominent real-world applications of secure multiparty computation. While such protocols have attracted significant attention from the research community, other functionalities are often required to support a PSI application in practice. For example, in order for two parties to run a PSI over the unique users contained in their databases, they might first invoke a support functionality to agree on the primary keys to represent their users. This paper studies a secure approach to agreeing on primary keys. We introduce and realize a functionality that computes a common set of identifiers based on incomplete information held by two parties, which we refer to as private identity agreement, and we prove the security of our protocol in the honest-but-curious model. We explain the subtleties in designing such a functionality that arise from privacy requirements when intending to compose securely with PSI protocols. We also argue that the cost of invoking this functionality can be amortized over a large number of PSI sessions, and that for applications that require many repeated PSI executions, this represents an improvement over a PSI protocol that directly uses incomplete or fuzzy matches.

Local-Global Interaction and the Emergence of Scale-Free Networks with Community Structures

2011 ◽  
Vol 17 (4) ◽  
pp. 263-279 ◽  
Author(s):  
Jing Liu ◽  
Hussein A. Abbass ◽  
Weicai Zhong ◽  
David G. Green
Keyword(s):  
Real World ◽  
Search Problem ◽  
Community Structures ◽  
Community Size ◽  
The Real ◽  
Scale Free ◽  
Rich Club ◽  
Global Coupling ◽  
The Rich ◽  
Power Law Distributions

Understanding complex networks in the real world is a nontrivial task. In the study of community structures we normally encounter several examples of these networks, which makes any statistical inferencing a challenging endeavor. Researchers resort to computer-generated networks that resemble networks encountered in the real world as a means to generate many networks with different sizes, while maintaining the real-world characteristics of interest. The generation of networks that resemble the real world turns out in itself to be a complex search problem. We present a new rewiring algorithm for the generation of networks with unique characteristics that combine the scale-free effects and community structures encountered in the real world. The algorithm is inspired by social interactions in the real world, whereby people tend to connect locally while occasionally they connect globally. This local-global coupling turns out to be a powerful characteristics that is required for our proposed rewiring algorithm to generate networks with community structures, power law distributions both in degree and in community size, positive assortative mixing by degree, and the rich-club phenomenon.

scholarly journals The Cost of Fairness in AI: Evidence from E-Commerce

2021 ◽  
Author(s):  
Moritz von Zahn ◽  
Stefan Feuerriegel ◽  
Niklas Kuehl
Keyword(s):  
Artificial Intelligence ◽  
Information Systems ◽  
Real World ◽  
Systematic Errors ◽  
Prediction Performance ◽  
Use Case ◽  
Financial Cost ◽  
Financial Costs ◽  
The Cost

AbstractContemporary information systems make widespread use of artificial intelligence (AI). While AI offers various benefits, it can also be subject to systematic errors, whereby people from certain groups (defined by gender, age, or other sensitive attributes) experience disparate outcomes. In many AI applications, disparate outcomes confront businesses and organizations with legal and reputational risks. To address these, technologies for so-called “AI fairness” have been developed, by which AI is adapted such that mathematical constraints for fairness are fulfilled. However, the financial costs of AI fairness are unclear. Therefore, the authors develop AI fairness for a real-world use case from e-commerce, where coupons are allocated according to clickstream sessions. In their setting, the authors find that AI fairness successfully manages to adhere to fairness requirements, while reducing the overall prediction performance only slightly. However, they find that AI fairness also results in an increase in financial cost. Thus, in this way the paper’s findings contribute to designing information systems on the basis of AI fairness.

scholarly journals From One to Many: Synced Hash-Based Signatures

2017 ◽  
Author(s):  
Santi J. Vives
Keyword(s):  
Real World ◽  
Building Block ◽  
Main Building ◽  
Unlimited Number ◽  
Real World Applications ◽  
Time Signature ◽  
The Cost

Hash-based signatures use a one-time signature (OTS) as its main building block, and transform it into a many-times scheme, to sign a larger number of signatures. In known constructions, the cost and the size of each signature increase as the number of needed signatures grows. In real-world applications, requiring a significant number of signatures, the signatures can get quite large. As a result, it is usually believed that post-quantum signatures based on hashes need more computation and much larger sizes than classical signatures. We introduce a construction to challenge that idea: we show that it is possible to construct a many-times signatures scheme that is more efficient than the OTS it is built from, rather than less.We study the generation of signatures in conjunction with a blockchain, like bitcoin. The proposed scheme permits an unlimited number of signatures. The size of each signatures is constant and the same as in the OTS. The verification cost starts the same as in the OTS and decreases with each new signature, becoming more efficient on average as the number of signatures grows.

scholarly journals The Last Mile: Where Artificial Intelligence Meets Reality (Preprint)

2019 ◽  
Author(s):  
Enrico Coiera
Keyword(s):  
Artificial Intelligence ◽  
Real World ◽  
Algorithm Development ◽  
High Performing ◽  
Technical Performance ◽  
Last Mile ◽  
Real World Applications ◽  
Agile Approach ◽  
Intelligence Development

UNSTRUCTURED Although much effort is focused on improving the technical performance of artificial intelligence, there are compelling reasons to focus more on the implementation of this technology class to solve real-world applications. In this “last mile” of implementation lie many complex challenges that may make technically high-performing systems perform poorly. Instead of viewing artificial intelligence development as a linear one of algorithm development through to eventual deployment, there are strong reasons to take a more agile approach, iteratively developing and testing artificial intelligence within the context in which it finally will be used.

Sign in / Sign up

Export Citation Format

Share Document