%{search_type} search results

• The Lovelace Test
• Three types of creativity
• Ready steady go
• Algorithms, the secret to modern life
• From top-down to bottom-up
• Algorithmic evolution
• Painting by numbers
• Learning from the masters
• The art of mathematics
• The mathematician's telescope
• Music: the process of sounding mathematics
• The song-writing formula
• Deepmathematics
• Language games
• Let AI tell you a story
• Why we create: a meeting of minds.

Most books on AI focus on the future of work. But now that algorithms can learn and adapt, does the future of creativity also belong to well-programmed machines? To answer this question, Marcus du Sautoy takes us to the forefront of creative new technologies and offers a more positive and unexpected vision of our future cohabitation with machines.-- Provided by publisher.

• Table of Contents Understanding Rewards-Based Learning Dynamic Programming and the Bellman Equation Monte Carlo Methods Temporal Difference Learning Exploring SARSA Going Deep with DQN Going Deeper with DDQN Policy Gradient Methods Optimizing for Continuous Control All about Rainbow DQN Exploiting ML-Agents DRL Frameworks 3D Worlds From DRL to AGI.
• (source: Nielsen Book Data)

Explore reinforcement learning (RL) techniques to build cutting-edge games using Python libraries such as PyTorch, OpenAI Gym, and TensorFlow Key Features Get to grips with the different reinforcement and DRL algorithms for game development Learn how to implement components such as artificial agents, map and level generation, and audio generation Gain insights into cutting-edge RL research and understand how it is similar to artificial general research Book DescriptionWith the increased presence of AI in the gaming industry, developers are challenged to create highly responsive and adaptive games by integrating artificial intelligence into their projects. This book is your guide to learning how various reinforcement learning techniques and algorithms play an important role in game development with Python. Starting with the basics, this book will help you build a strong foundation in reinforcement learning for game development. Each chapter will assist you in implementing different reinforcement learning techniques, such as Markov decision processes (MDPs), Q-learning, actor-critic methods, SARSA, and deterministic policy gradient algorithms, to build logical self-learning agents. Learning these techniques will enhance your game development skills and add a variety of features to improve your game agent's productivity. As you advance, you'll understand how deep reinforcement learning (DRL) techniques can be used to devise strategies to help agents learn from their actions and build engaging games. By the end of this book, you'll be ready to apply reinforcement learning techniques to build a variety of projects and contribute to open source applications. What you will learn Understand how deep learning can be integrated into an RL agent Explore basic to advanced algorithms commonly used in game development Build agents that can learn and solve problems in all types of environments Train a Deep Q-Network (DQN) agent to solve the CartPole balancing problem Develop game AI agents by understanding the mechanism behind complex AI Integrate all the concepts learned into new projects or gaming agents Who this book is forIf you're a game developer looking to implement AI techniques to build next-generation games from scratch, this book is for you. Machine learning and deep learning practitioners, and RL researchers who want to understand how to use self-learning agents in the game domain will also find this book useful. Knowledge of game development and Python programming experience are required.
(source: Nielsen Book Data)

• Preface Acknowledgments Introduction Related Learning Paradigms Lifelong Supervised Learning Continual Learning and Catastrophic Forgetting Open-World Learning Lifelong Topic Modeling Lifelong Information Extraction Continuous Knowledge Learning in Chatbots Lifelong Reinforcement Learning Conclusion and Future Directions Bibliography Authors' Biographies.
• (source: Nielsen Book Data)

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. Research in lifelong learning has developed significantly in the relatively short time since the first edition of this book was published. The purpose of this second edition is to expand the definition of lifelong learning, update the content of several chapters, and add a new chapter about continual learning in deep neural networks-which has been actively researched over the past two or three years. A few chapters have also been reorganized to make each of them more coherent for the reader. Moreover, the authors want to propose a unified framework for the research area. Currently, there are several research topics in machine learning that are closely related to lifelong learning-most notably, multi-task learning, transfer learning, and meta-learning-because they also employ the idea of knowledge sharing and transfer. This book brings all these topics under one roof and discusses their similarities and differences. Its goal is to introduce this emerging machine learning paradigm and present a comprehensive survey and review of the important research results and latest ideas in the area. This book is thus suitable for students, researchers, and practitioners who are interested in machine learning, data mining, natural language processing, or pattern recognition. Lecturers can readily use the book for courses in any of these related fields.
(source: Nielsen Book Data)

• 1. Models for mobile agent computing
• Introduction
• What is a mobile agent
• Why mobile agents
• An algorithmic model for mobile agents
• Mobile agents
• Distributed networks
• Resource measures
• Mobile agent rendezvous
• Outline of the book
• Comments and bibliographic remarks.

• 2. Deterministic rendezvous in a ring
• Introduction
• A single stationary token
• The feasibility of rendezvous
• The time complexity of rendezvous
• Memory tradeoff for rendezvous with detection
• Limits to the memory trade-off
• Movable tokens
• Comments and bibliographic remarks.

• 3. Multiple agent rendezvous in a ring
• Introduction
• Impossibility of rendezvous
• Rendezvous with detection
• Conditional solutions
• Comments and bibliographic remarks.

• 4. Randomized rendezvous in a ring
• Introduction
• Random walk algorithm
• Randomization and tokens
• Time/memory trade-offs
• Coin half tour algorithm
• Approximate counting algorithm
• Comments and bibliographic remarks.

• 5. Other models
• Introduction
• Leader election and rendezvous
• Rendezvous with failing tokens
• Rendezvous when tokens fail upon release
• Rendezvous when tokens can fail at any time
• The cost of token failure
• Flickering tokens
• Asynchronous rendezvous
• Look-compute-move
• Model and terminology
• Impossibility results
• Gathering configurations with a single multiplicity
• Gathering rigid configurations
• Gathering an odd number of robots
• Dangerous networks
• Black-hole search in an asynchronous ring
• Rendezvous in asynchronous rings in spite of a black-hole
• Comments and bibliographic remarks.

• 6. Other topologies
• Introduction
• Synchronous torus
• Memory lower bounds for rendezvous
• Rendezvous algorithms
• Trees
• Arbitrary graphs
• Comments and bibliographic remarks.

• Bibliography
• Glossary
• Authors' biographies
• Index.

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part our investigation concentrates on the simplest case of two agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments.

• Automating Inquiry Uncertainty Sampling Searching Through the Hypothesis Space Minimizing Expected Error and Variance Exploiting Structure in Data Theory Practical Considerations.
• (source: Nielsen Book Data)

The key idea behind active learning is that a machine learning algorithm can perform better with less training if it is allowed to choose the data from which it learns. An active learner may pose ""queries, "" usually in the form of unlabeled data instances to be labeled by an ""oracle"" (e.g., a human annotator) that already understands the nature of the problem. This sort of approach is well-motivated in many modern machine learning and data mining applications, where unlabeled data may be abundant or easy to come by, but training labels are difficult, time-consuming, or expensive to obtain. This book is a general introduction to active learning. It outlines several scenarios in which queries might be formulated, and details many query selection algorithms which have been organized into four broad categories, or ""query selection frameworks."" We also touch on some of the theoretical foundations of active learning, and conclude with an overview of the strengths and weaknesses of these approaches in practice, including a summary of ongoing work to address these open challenges and opportunities.
(source: Nielsen Book Data)

• Markov Decision Processes Value Prediction Problems Control For Further Exploration.
• (source: Nielsen Book Data)

Reinforcement learning is a learning paradigm concerned with learning to control a system so as to maximize a numerical performance measure that expresses a long-term objective. What distinguishes reinforcement learning from supervised learning is that only partial feedback is given to the learner about the learner's predictions. Further, the predictions may have long term effects through influencing the future state of the controlled system. Thus, time plays a special role. The goal in reinforcement learning is to develop efficient learning algorithms, as well as to understand the algorithms' merits and limitations. Reinforcement learning is of great interest because of the large number of practical applications that it can be used to address, ranging from problems in artificial intelligence to operations research or control engineering. In this book, we focus on those algorithms of reinforcement learning that build on the powerful theory of dynamic programming. We give a fairly comprehensive catalog of learning problems, describe the core ideas, note a large number of state of the art algorithms, followed by the discussion of their theoretical properties and limitations.
(source: Nielsen Book Data)

From making faster, better decisions to automating rote work to enabling robots to respond to emotions, AI and machine learning are already reshaping business and society. What should you and your company be doing today to ensure that you're poised for success and keeping up with your competitors in the age of AI' Artificial Intelligence: The Insights You Need from Harvard Business Review brings you today's most essential thinking on AI and explains how to launch the right initiatives at your company to capitalize on the opportunity of the machine intelligence revolution. Business is changing. Will you adapt or be left behind' Get up to speed and deepen your understanding of the topics that are shaping your company's future with the Insights You Need from Harvard Business Review series. Featuring HBR's smartest thinking on fast-moving issues-blockchain, cybersecurity, AI, and more-each book provides the foundational introduction and practical case studies your organization needs to compete today and collects the best research, interviews, and analysis to get it ready for tomorrow. You can't afford to ignore how these issues will transform the landscape of business and society. The Insights You Need series will help you grasp these critical ideas-and prepare you and your company for the future.

• Preface Planning and Autonomous Behavior Classical Planning: Full Information and Deterministic Actions Classical Planning: Variations and Extensions Beyond Classical Planning: Transformations Planning with Sensing: Logical Models MDP Planning: Stochastic Actions and Full Feedback POMDP Planning: Stochastic Actions and Partial Feedback Discussion Bibliography Author's Biography.
• (source: Nielsen Book Data)

Planning is the model-based approach to autonomous behavior where the agent behavior is derived automatically from a model of the actions, sensors, and goals. The main challenges in planning are computational as all models, whether featuring uncertainty and feedback or not, are intractable in the worst case when represented in compact form. In this book, we look at a variety of models used in AI planning, and at the methods that have been developed for solving them. The goal is to provide a modern and coherent view of planning that is precise, concise, and mostly self-contained, without being shallow. For this, we make no attempt at covering the whole variety of planning approaches, ideas, and applications, and focus on the essentials. The target audience of the book are students and researchers interested in autonomous behavior and planning from an AI, engineering, or cognitive science perspective.
(source: Nielsen Book Data)

• Introduction Rational Agents Strategic Games Coordination Partial Observability Mechanism Design Learning.
• (source: Nielsen Book Data)

Multiagent systems is an expanding field that blends classical fields like game theory and decentralized control with modern fields like computer science and machine learning. This monograph provides a concise introduction to the subject, covering the theoretical foundations as well as more recent developments in a coherent and readable manner. The text is centered on the concept of an agent as decision maker. Chapter 1 is a short introduction to the field of multiagent systems. Chapter 2 covers the basic theory of singleagent decision making under uncertainty. Chapter 3 is a brief introduction to game theory, explaining classical concepts like Nash equilibrium. Chapter 4 deals with the fundamental problem of coordinating a team of collaborative agents. Chapter 5 studies the problem of multiagent reasoning and decision making under partial observability. Chapter 6 focuses on the design of protocols that are stable against manipulations by self-interested agents. Chapter 7 provides a short introduction to the rapidly expanding field of multiagent reinforcement learning. The material can be used for teaching a half-semester course on multiagent systems covering, roughly, one chapter per lecture.
(source: Nielsen Book Data)

• Ensembles Discovered Predictive Learning and Decision Trees Model Complexity, Model Selection and Regularization Importance Sampling and the Classic Ensemble Methods Rule Ensembles and Interpretation Statistics Ensemble Complexity.
• (source: Nielsen Book Data)

Ensemble methods have been called the most influential development in Data Mining and Machine Learning in the past decade. They combine multiple models into one usually more accurate than the best of its components. Ensembles can provide a critical boost to industrial challenges - from investment timing to drug discovery, and fraud detection to recommendation systems - where predictive accuracy is more vital than model interpretability. Ensembles are useful with all modeling algorithms, but this book focuses on decision trees to explain them most clearly. After describing trees and their strengths and weaknesses, the authors provide an overview of regularization - today understood to be a key reason for the superior performance of modern ensembling algorithms. The book continues with a clear description of two recent developments: Importance Sampling (IS) and Rule Ensembles (RE). IS reveals classic ensemble methods - bagging, random forests, and boosting - to be special cases of a single algorithm, thereby showing how to improve their accuracy and speed. REs are linear rule models derived from decision tree ensembles. They are the most interpretable version of ensembles, which is essential to applications such as credit scoring and fault diagnosis. Lastly, the authors explain the paradox of how ensembles achieve greater accuracy on new data despite their (apparently much greater) complexity. This book is aimed at novice and advanced analytic researchers and practitioners -- especially in Engineering, Statistics, and Computer Science. Those with little exposure to ensembles will learn why and how to employ this breakthrough method, and advanced practitioners will gain insight into building even more powerful models. Throughout, snippets of code in R are provided to illustrate the algorithms described and to encourage the reader to try the techniques. The authors are industry experts in data mining and machine learning who are also adjunct professors and popular speakers. Although early pioneers in discovering and using ensembles, they here distill and clarify the recent groundbreaking work of leading academics (such as Jerome Friedman) to bring the benefits of ensembles to practitioners.
(source: Nielsen Book Data)