The agent also uses everyday language that non-experts can understand. The explanations, or "rationales" as the researchers call them, are designed to be relatable and inspire trust in those who might be in the workplace with AI machines or interact with them in social situations. "If the power of AI is to be democratized, it needs to be accessible to anyone regardless of their technical abilities," said Upol Ehsan, Ph.D. student in the School of Interactive Computing at Georgia Tech and lead researcher. "As AI pervades all aspects of our lives, there is a distinct need for human-centered AI design that makes black-boxed AI systems explainable to everyday users. Our work takes a formative step toward understanding the role of language-based explanations and how humans perceive them."

This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics. A new class of cut-free complete labelled sequent calculi G3LdmL^m_n, for multi-agent STIT with at most n-many choices, is introduced. We refine the calculi G3LdmL^m_n through the use of propagation rules and demonstrate the admissibility of their structural rules, resulting in auxiliary calculi Ldm^m_nL. In the single-agent case, we show that the refined calculi Ldm^m_nL derive theorems within a restricted class of (forestlike) sequents, allowing us to provide proof-search algorithms that decide single-agent STIT logics. We prove that the proof-search algorithms are correct and terminate.

Reinforcement learning, the AI training technique that's brought to fruition systems capable of defeating world poker champions and guiding self-driving cars, isn't the simplest thing in the world to wrangle. That's particularly true in the gaming domain, where cutting-edge approaches sometimes require bespoke tools that aren't publicly available. In a paper recently published on the preprint server Arxiv.org, At its core, it's a collection of environments and algorithms for research in general reinforcement learning and search and planning in games, with tools to analyze learning dynamics and other common evaluation metrics. "The purpose of OpenSpiel is to promote general multiagent reinforcement learning across many different game types, in a similar way as general game-playing but with a heavy emphasis on learning and not in competition form," wrote the researchers.

Planning for multi-robot coverage seeks to determine collision-free paths for a fleet of robots, enabling them to collectively observe points of interest in an environment. Persistent coverage is a variant of traditional coverage where coverage-levels in the environment decay over time. Thus, robots have to continuously revisit parts of the environment to maintain a desired coverage-level. Facilitating this in the real world demands we tackle numerous subproblems. While there exist standard solutions to these subproblems, there is no complete framework that addresses all of their individual challenges as a whole in a practical setting. We adapt and combine these solutions to present a planning framework for persistent coverage with multiple unmanned aerial vehicles (UAVs). Specifically, we run a continuous loop of goal assignment and globally deconflicting, kinodynamic path planning for multiple UAVs. We evaluate our framework in simulation as well as the real world. In particular, we demonstrate that (i) our framework exhibits graceful coverage given sufficient resources, we maintain persistent coverage; if resources are insufficient (e.g., having too few UAVs for a given size of the enviornment), coverage-levels decay slowly and (ii) planning with global deconfliction in our framework incurs a negligibly higher price compared to other weaker, more local collision-checking schemes. (Video: https://youtu.be/aqDs6Wymp5Q)

Incentive mechanisms play a pivotal role in collecting correct and reliable information from self-interested agents. Peer-prediction mechanisms are game-theoretic mechanisms that incentivize agents for reporting the information truthfully, even when the information is unverifiable in nature. Traditionally, a trusted third party implements these mechanisms. We built Infochain, a decentralized system for information elicitation. Infochain ensures transparent, trustless and cost-efficient collection of information from self-interested agents without compromising the game-theoretical guarantees of the peer-prediction mechanisms. In this paper, we address various non-trivial challenges in implementing these mechanisms in Ethereum and provide experimental analysis.

To launch a successful virtual agent project for your organization's customer service capability, the company must overcome four hurdles. This article is part of an MIT SMR initiative exploring how technology is reshaping the practice of management. Are you ready to turn your company's customer service over to AI-powered virtual agents? Whether your goals include creating a fully digital business, improving customer experience, or cutting costs, virtual agents and automation offer many benefits. Consider the experience of Mark Baylis, vice president of customer service and digital customer engagement at Optus, Australia's second-largest telecom operator.

AUSTIN, Texas – Computer scientists at The University of Texas at Austin have taught an artificial intelligence agent how to do something that usually only humans can do--take a few quick glimpses around and infer its whole environment, a skill necessary for the development of effective search-and-rescue robots that one day can improve the effectiveness of dangerous missions. The team, led by professor Kristen Grauman, Ph.D. candidate Santhosh Ramakrishnan and former Ph.D. candidate Dinesh Jayaraman (now at the University of California, Berkeley) published their results today in the journal Science Robotics. Most AI agents--computer systems that could endow robots or other machines with intelligence--are trained for very specific tasks--such as to recognize an object or estimate its volume--in an environment they have experienced before, like a factory. But the agent developed by Grauman and Ramakrishnan is general purpose, gathering visual information that can then be used for a wide range of tasks. "We want an agent that's generally equipped to enter environments and be ready for new perception tasks as they arise," Grauman said.

Evidence in probabilistic reasoning may be ‘hard’ or ‘soft’, that is, it may be of yes/no form, or it may involve a strength of belief, in the unit interval [0, 1]. Reasoning with soft, [0, 1]-valued evidence is important in many situations but may lead to different, confusing interpretations. This paper intends to bring more mathematical and conceptual clarity to the field by shifting the existing focus from specification of soft evidence to accomodation of soft evidence. There are two main approaches, known as Jeffrey’s rule and Pearl’s method; they give different outcomes on soft evidence. This paper argues that they can be understood as correction and as improvement. It describes these two approaches as different ways of updating with soft evidence, highlighting their differences, similarities and applications. This account is based on a novel channel-based approach to Bayesian probability. Proper understanding of these two update mechanisms is highly relevant for inference, decision tools and probabilistic programming languages.

These are exciting times for computational sciences with the digital revolution permeating a variety of areas and radically transforming business, science, and our daily lives. The Internet and the World Wide Web, GPS, satellite communications, remote sensing, and smartphones are dramatically accelerating the pace of discovery, engendering globally connected networks of people and devices. The rise of practically relevant artificial intelligence (AI) is also playing an increasing part in this revolution, fostering e-commerce, social networks, personalized medicine, IBM Watson and AlphaGo, self-driving cars, and other groundbreaking transformations. Unfortunately, humanity is also facing tremendous challenges. Nearly a billion people still live below the international poverty line and human activities and climate change are threatening our planet and the livelihood of current and future generations. Moreover, the impact of computing and information technology has been uneven, mainly benefiting profitable sectors, with fewer societal and environmental benefits, further exacerbating inequalities and the destruction of our planet. Our vision is that computer scientists can and should play a key role in helping address societal and environmental challenges in pursuit of a sustainable future, while also advancing computer science as a discipline. For over a decade, we have been deeply engaged in computational research to address societal and environmental challenges, while nurturing the new field of Computational Sustainability.

--Due to the drastic increase of mobile traffic, wireless caching is proposed to serve repeated requests for content download. T o determine the caching scheme for decentralized caching networks, the content preference learning problem based on mobility prediction is studied. We first formulate preference prediction as a decentralized regularized multi-task learning (DRMTL) problem without considering the mobility of mobile terminals (MTs). The problem is solved by a hybrid Jacobian and Gauss-Seidel proximal multi-block alternating direction method (ADMM) based algorithm, which is proven to conditionally converge to the optimal solution with a rate O (1 / k) . Then we use the tool of Markov renewal process to predict the moving path and sojourn time for MTs, and integrate the mobility pattern with the DRMTL model by reweighting the training samples and introducing a transfer penalty in the objective. We solve the problem and prove that the developed algorithm has the same convergence property but with different conditions. Through simulation we show the convergence analysis on proposed algorithms. Our real trace driven experiments illustrate that the mobility-aware DRMTL model can provide a more accurate prediction on geography preference than DRMTL model. Besides, the hit ratio achieved by most popular proactive caching (MPC) policy with preference predicted by mobility-aware DRMTL outperforms the MPC with preference from DRMTL and random caching (RC) schemes. As a promising technology for the fifth-generation (5G) wireless networks and beyond, proactive caching can alleviate the heavy traffic burden on backhaul links and reduce service delay, through proactively storing popular contents at base stations (BSs) and mobile terminals (MTs) [1]-[3]. With the limitation of storage memory, determining where and what to cache in content centric wireless networks becomes one of the main challenges in the design of proactive caching schemes. Among the various factors affecting the wireless caching design, involving the mobility of MTs and learning content preference are two critical challenges, which have attracted more and more research interest recently. A. background Current investigation on mobility aware wireless caching mainly includes two aspects: studying the impact of MT mobility on caching schemes [4]-[7], and optimizing the wireless caching schemes based on the mobility information of MTs Y u Y e, Ming Xiao and Mikael Skoglund are with the School of Electrical Engineering and Computer Science, Royal Institute of Technology (KTH), Stockholm, Sweden (email: yu9@kth.se,