Collaborating Authors


Lifelong Machine Learning, Second Edition

Morgan & Claypool Publishers

Lifelong Machine Learning, Second Edition is an introduction to an advanced machine learning paradigm that continuously learns by accumulating past knowledge that it then uses in future learning and problem solving. In contrast, the current dominant machine learning paradigm learns in isolation: given a training dataset, it runs a machine learning algorithm on the dataset to produce a model that is then used in its intended application. It makes no attempt to retain the learned knowledge and use it in subsequent learning. Unlike this isolated system, humans learn effectively with only a few examples precisely because our learning is very knowledge-driven: the knowledge learned in the past helps us learn new things with little data or effort. Lifelong learning aims to emulate this capability, because without it, an AI system cannot be considered truly intelligent.

Adversarial Machine Learning

Morgan & Claypool Publishers

The increasing abundance of large high-quality datasets, combined with significant technical advances over the last several decades have made machine learning into a major tool employed across a broad array of tasks including vision, language, finance, and security. However, success has been accompanied with important new challenges: many applications of machine learning are adversarial in nature. Some are adversarial because they are safety critical, such as autonomous driving. An adversary in these applications can be a malicious party aimed at causing congestion or accidents, or may even model unusual situations that expose vulnerabilities in the prediction engine. Other applications are adversarial because their task and/or the data they use are.

Strategic Voting

Morgan & Claypool Publishers

Social choice theory deals with aggregating the preferences of multiple individuals regarding several available alternatives, a situation colloquially known as voting. There are many different voting rules in use and even more in the literature, owing to the various considerations such an aggregation method should take into account. The analysis of voting scenarios becomes particularly challenging in the presence of strategic voters, that is, voters that misreport their true preferences in an attempt to obtain a more favorable outcome. In a world that is tightly connected by the Internet, where multiple groups with complex incentives make frequent joint decisions, the interest in strategic voting exceeds the scope of political science and is a focus of research in economics, game theory, sociology, mathematics, and computer science. The book has two parts.

Predicting Human Decision-Making: From Prediction to Action

Morgan & Claypool Publishers

In this book, we explore the task of automatically predicting human decision-making and its use in designing intelligent human-aware automated computer systems of varying natures - from purely conflicting interaction settings (e.g., security and games) to fully cooperative interaction settings (e.g., autonomous driving and personal robotic assistants). We explore the techniques, algorithms, and empirical methodologies for meeting the challenges that arise from the above tasks and illustrate major benefits from the use of these computational solutions in real-world application domains such as security, negotiations, argumentative interactions, voting systems, autonomous driving, and games. The book presents both the traditional and classical methods as well as the most recent and cutting edge advances, providing the reader with a panorama of the challenges and solutions in predicting human decision-making. Top Description Table of Contents Author Information Table of ContentsPreface Acknowledgments Introduction Utility Maximization Paradigm Predicting Human Decision-Making From Human Prediction to Intelligent Agents Which Model Should I Use? Concluding Remarks Bibliography Authors' Biographies Index Top Description Table of Contents Author Information About the Author(s)Ariel Rosenfeld, Weizmann Institute of Science Ariel Rosenfeld is a Koshland Postdoctoral Fellow at Weizmann Institute of Science, Israel. He obtained a B.Sc. in Computer Science and Economics, graduating magna cum laude from Tel Aviv University, and a Ph.D. in Computer Science from Bar-Ilan University.

Game Theory for Data Science: Eliciting Truthful Information

Morgan & Claypool Publishers

Intelligent systems often depend on data provided by information agents, for example, sensor data or crowdsourced human computation. Providing accurate and relevant data requires costly effort that agents may not always be willing to provide. Thus, it becomes important not only to verify the correctness of data, but also to provide incentives so that agents that provide high-quality data are rewarded while those that do not are discouraged by low rewards. We cover different settings and the assumptions they admit, including sensing, human computation, peer grading, reviews, and predictions. We survey different incentive mechanisms, including proper scoring rules, prediction markets and peer prediction, Bayesian Truth Serum, Peer Truth Serum, Correlated Agreement, and the settings where each of them would be suitable.

Multi-Objective Decision Making

Morgan & Claypool Publishers

Many real-world decision problems have multiple objectives. For example, when choosing a medical treatment plan, we want to maximize the efficacy of the treatment, but also minimize the side effects. These objectives typically conflict, e.g., we can often increase the efficacy of the treatment, but at the cost of more severe side effects. In this book, we outline how to deal with multiple objectives in decision-theoretic planning and reinforcement learning algorithms. To illustrate this, we employ the popular problem classes of multi-objective Markov decision processes (MOMDPs) and multi-objective coordination graphs (MO-CoGs).

Statistical Relational Artificial Intelligence: Logic, Probability, and Computation

Morgan & Claypool Publishers

An intelligent agent interacting with the real world will encounter individual people, courses, test results, drugs prescriptions, chairs, boxes, etc., and needs to reason about properties of these individuals and relations among them as well as cope with uncertainty. Uncertainty has been studied in probability theory and graphical models, and relations have been studied in logic, in particular in the predicate calculus and its extensions. This book examines the foundations of combining logic and probability into what are called relational probabilistic models. It introduces representations, inference, and learning techniques for probability, logic, and their combinations. The book focuses on two representations in detail: Markov logic networks, a relational extension of undirected graphical models and weighted first-order predicate calculus formula, and Problog, a probabilistic extension of logic programs that can also be viewed as a Turing-complete relational extension of Bayesian networks.

Representing and Reasoning with Qualitative Preferences: Tools and Applications

Morgan & Claypool Publishers

This book provides a tutorial introduction to modern techniques for representing and reasoning about qualitative preferences with respect to a set of alternatives. The syntax and semantics of several languages for representing preference languages, including CP-nets, TCP-nets, CI-nets, and CP-theories, are reviewed. Some key problems in reasoning about preferences are introduced, including determining whether one alternative is preferred to another, or whether they are equivalent, with respect to a given set of preferences. These tasks can be reduced to model checking in temporal logic. Specifically, an induced preference graph that represents a given set of preferences can be efficiently encoded using a Kripke Structure for Computational Tree Logic (CTL).