What Is AI - Eng
What Is AI - Eng
An ontology represents knowledge as a set of concepts within a domain and the relationships
between those concepts.
Knowledge representation and knowledge engineering allow AI programs to answer questions
intelligently and make deductions about real-world facts. Formal knowledge representations are
used in content-based indexing and retrieval, scene interpretation, clinical decision
support, knowledge discovery (mining "interesting" and actionable inferences from
large databases), and other areas.
A knowledge base is a body of knowledge represented in a form that can be used by a program.
An ontology is the set of objects, relations, concepts, and properties used by a particular domain
of knowledge. Knowledge bases need to represent things such as: objects, properties,
categories and relations between objects; situations, events, states and time; causes and
effects; knowledge about knowledge (what we know about what other people know); default
reasoning (things that humans assume are true until they are told differently and will remain true
even when other facts are changing); and many other aspects and domains of knowledge.
Among the most difficult problems in knowledge representation are: the breadth of
commonsense knowledge (the set of atomic facts that the average person knows is
enormous); and the sub-symbolic form of most commonsense knowledge (much of what people
know is not represented as "facts" or "statements" that they could express verbally). There is
also the difficulty of knowledge acquisition, the problem of obtaining knowledge for AI
applications.
Planning and decision making
An "agent" is anything that perceives and takes actions in the world. A rational agent has goals
or preferences and takes actions to make them happen. In automated planning, the agent has a
specific goal. In automated decision making, the agent has preferences – there are some
situations it would prefer to be in, and some situations it is trying to avoid. The decision making
agent assigns a number to each situation (called the "utility") that measures how much the agent
prefers it. For each possible action, it can calculate the "expected utility": the utility of all possible
outcomes of the action, weighted by the probability that the outcome will occur. It can then
choose the action with the maximum expected utility.
In classical planning, the agent knows exactly what the effect of any action will be. In most real-
world problems, however, the agent may not be certain about the situation they are in (it is
"unknown" or "unobservable") and it may not know for certain what will happen after each
possible action (it is not "deterministic"). It must choose an action by making a probabilistic guess
and then reassess the situation to see if the action worked.
In some problems, the agent's preferences may be uncertain, especially if there are other agents
or humans involved. These can be learned (e.g., with inverse reinforcement learning) or the
agent can seek information to improve its preferences. Information value theory can be used to
weigh the value of exploratory or experimental actions. The space of possible future actions and
situations is typically intractably large, so the agents must take actions and evaluate situations
while being uncertain what the outcome will be.
A Markov decision process has a transition model that describes the probability that a particular
action will change the state in a particular way, and a reward function that supplies the utility of
each state and the cost of each action. A policy associates a decision with each possible state.
The policy could be calculated (e.g., by iteration), be heuristic, or it can be learned.
Game theory describes rational behavior of multiple interacting agents, and is used in AI
programs that make decisions that involve other agents.
Learning
Machine learning is the study of programs that can improve their performance on a given task
automatically. It has been a part of AI from the beginning.
There are several kinds of machine learning. Unsupervised learning analyzes a stream of data
and finds patterns and makes predictions without any other guidance. Supervised
learning requires a human to label the input data first, and comes in two main
varieties: classification (where the program must learn to predict what category the input belongs
in) and regression (where the program must deduce a numeric function based on numeric input).
In reinforcement learning the agent is rewarded for good responses and punished for bad ones.
The agent learns to choose responses that are classified as "good".[49] Transfer learning is
when the knowledge gained from one problem is applied to a new problem.[50] Deep learning is
a type of machine learning that runs inputs through biologically inspired artificial neural
networks for all of these types of learning.
Computational learning theory can assess learners by computational complexity, by sample
complexity (how much data is required), or by other notions of optimization.
Natural language processing
Natural language processing (NLP) allows programs to read, write and communicate in human
languages such as English. Specific problems include speech recognition, speech
synthesis, machine translation, information extraction, information retrieval and question
answering.
Early work, based on Noam Chomsky's generative grammar and semantic networks, had
difficulty with word-sense disambiguation[f] unless restricted to small domains called "micro-
worlds" (due to the common sense knowledge problem). Margaret Masterman believed that it
was meaning, and not grammar that was the key to understanding languages, and
that thesauri and not dictionaries should be the basis of computational language structure.
Modern deep learning techniques for NLP include word embedding (representing words, typically
as vectors encoding their meaning), transformers (a deep learning architecture using
an attention mechanism), and others. In 2019, generative pre-trained transformer (or "GPT")
language models began to generate coherent text, and by 2023 these models were able to get
human-level scores on the bar exam, SAT test, GRE test, and many other real-world
applications.
Perception
Machine perception is the ability to use input from sensors (such as cameras, microphones,
wireless signals, active lidar, sonar, radar, and tactile sensors) to deduce aspects of the
world. Computer vision is the ability to analyze visual input.
The field includes speech recognition, image classification, facial recognition, object
recognition, and robotic perception.
Social intelligence
Kismet, a robot head which was made in the 1990s; a
machine that can recognize and simulate emotions.
Affective computing is an interdisciplinary umbrella that comprises systems that recognize,
interpret, process or simulate human feeling, emotion and mood. For example, some virtual
assistants are programmed to speak conversationally or even to banter humorously; it makes
them appear more sensitive to the emotional dynamics of human interaction, or to otherwise
facilitate human–computer interaction.
However, this tends to give naïve users an unrealistic conception of the intelligence of existing
computer agents. Moderate successes related to affective computing include textual sentiment
analysis and, more recently, multimodal sentiment analysis, wherein AI classifies the affects
displayed by a videotaped subject.
General intelligence
A machine with artificial general intelligence should be able to solve a wide variety of problems
with breadth and versatility similar to human intelligence.
Techniques
AI research uses a wide variety of techniques to accomplish the goals above.
Search and optimization
AI can solve many problems by intelligently searching through many possible solutions. There
are two very different kinds of search used in AI: state space search and local search.
State space search
State space search searches through a tree of possible states to try to find a goal state. For
example, planning algorithms search through trees of goals and subgoals, attempting to find a
path to a target goal, a process called means-ends analysis.
Simple exhaustive searches are rarely sufficient for most real-world problems: the search
space (the number of places to search) quickly grows to astronomical numbers. The result is a
search that is too slow or never completes. "Heuristics" or "rules of thumb" can help to prioritize
choices that are more likely to reach a goal.
Adversarial search is used for game-playing programs, such as chess or Go. It searches through
a tree of possible moves and counter-moves, looking for a winning position.
Local searchIllustration of gradient descent for 3 different starting points. Two parameters
(represented by the plan coordinates) are adjusted in order to minimize the loss function (the
height).
Local search uses mathematical optimization to find a solution to a problem. It begins with some
form of guess and refines it incrementally.
Gradient descent is a type of local search that optimizes a set of numerical parameters by
incrementally adjusting them to minimize a loss function. Variants of gradient descent are
commonly used to train neural networks.
Another type of local search is evolutionary computation, which aims to iteratively improve a set
of candidate solutions by "mutating" and "recombining" them, selecting only the fittest to survive
each generation.
Distributed search processes can coordinate via swarm intelligence algorithms. Two popular
swarm algorithms used in search are particle swarm optimization (inspired by bird flocking)
and ant colony optimization (inspired by ant trails).
Logic
Formal Logic is used for reasoning and knowledge representation.[80] Formal logic comes in two
main forms: propositional logic (which operates on statements that are true or false and
uses logical connectives such as "and", "or", "not" and "implies")[81] and predicate logic (which
also operates on objects, predicates and relations and uses quantifiers such as "Every X is a Y"
and "There are some Xs that are Ys").
Deductive reasoning in logic is the process of proving a new statement (conclusion) from other
statements that are given and assumed to be true (the premises).[83] Proofs can be structured
as proof trees, in which nodes are labelled by sentences, and children nodes are connected to
parent nodes by inference rules.
Given a problem and a set of premises, problem-solving reduces to searching for a proof tree
whose root node is labelled by a solution of the problem and whose leaf nodes are labelled by
premises or axioms. In the case of Horn clauses, problem-solving search can be performed by
reasoning forwards from the premises or backwards from the problem.[84] In the more general
case of the clausal form of first-order logic, resolution is a single, axiom-free rule of inference, in
which a problem is solved by proving a contradiction from premises that include the negation of
the problem to be solved.
Inference in both Horn clause logic and first-order logic is undecidable, and therefore intractable.
However, backward reasoning with Horn clauses, which underpins computation in the logic
programming language Prolog, is Turing complete. Moreover, its efficiency is competitive with
computation in other symbolic programming languages.
Fuzzy logic assigns a "degree of truth" between 0 and 1. It can therefore handle propositions that
are vague and partially true.
Non-monotonic logics, including logic programming with negation as failure, are designed to
handle default reasoning. Other specialized versions of logic have been developed to describe
many complex domains (see knowledge representation above).
Probabilistic methods for uncertain reasoning
Expectation-maximization clustering of Old Faithful eruption data starts from a random guess but
then successfully converges on an accurate clustering of the two physically distinct modes of
eruption.
Classifiers and statistical learning methods
The simplest AI applications can be divided into two types: classifiers (e.g., "if shiny then
diamond"), on one hand, and controllers (e.g., "if diamond then pick up"), on the other
hand. Classifiers are functions that use pattern matching to determine the closest match. They
can be fine-tuned based on chosen examples using supervised learning. Each pattern (also
called an "observation") is labeled with a certain predefined class. All the observations combined
with their class labels are known as a data set. When a new observation is received, that
observation is classified based on previous experience.
There are many kinds of classifiers in use. The decision tree is the simplest and most widely
used symbolic machine learning algorithm. K-nearest neighbor algorithm was the most widely
used analogical AI until the mid-1990s, and Kernel methods such as the support vector
machine (SVM) displaced k-nearest neighbor in the 1990s. The naive Bayes classifier is
reportedly the "most widely used learner" at Google, due in part to its scalability. Neural
networks are also used as classifiers.
Artificial neural networks
A neural network is an interconnected group of nodes, akin to the vast network of neurons in
the human brain.
An artificial neural network is based on a collection of nodes also known as artificial neurons,
which loosely model the neurons in a biological brain. It is trained to recognise patterns; once
trained, it can recognise those patterns in fresh data. There is an input, at least one hidden layer
of nodes and an output. Each node applies a function and once the weight crosses its specified
threshold, the data is transmitted to the next layer. A network is typically called a deep neural
network if it has at least 2 hidden layers.
Learning algorithms for neural networks use local search to choose the weights that will get the
right output for each input during training. The most common training technique is
the backpropagation algorithm. Neural networks learn to model complex relationships between
inputs and outputs and find patterns in data. In theory, a neural network can learn any function.
In feedforward neural networks the signal passes in only one direction. Recurrent neural
networks feed the output signal back into the input, which allows short-term memories of
previous input events. Long short term memory is the most successful network architecture for
recurrent networks. Perceptrons use only a single layer of neurons, deep learning uses multiple
layers. Convolutional neural networks strengthen the connection between neurons that are
"close" to each other – this is especially important in image processing, where a local set of
neurons must identify an "edge" before the network can identify an object.
Deep learning
Deep learning uses several layers of neurons between the network's inputs and outputs. The
multiple layers can progressively extract higher-level features from the raw input. For example,
in image processing, lower layers may identify edges, while higher layers may identify the
concepts relevant to a human such as digits or letters or faces.
Deep learning has profoundly improved the performance of programs in many important
subfields of artificial intelligence, including computer vision, speech recognition, natural language
processing, image classification and others. The reason that deep learning performs so well in so
many applications is not known as of 2023. The sudden success of deep learning in 2012–2015
did not occur because of some new discovery or theoretical breakthrough (deep neural networks
and backpropagation had been described by many people, as far back as the 1950s) but
because of two factors: the incredible increase in computer power (including the hundred-fold
increase in speed by switching to GPUs) and the availability of vast amounts of training data,
especially the giant curated datasets used for benchmark testing, such as ImageNet.
GPT
Generative pre-trained transformers (GPT) are large language models that are based on the
semantic relationships between words in sentences (natural language processing). Text-based
GPT models are pre-trained on a large corpus of text which can be from the internet. The pre-
training consists in predicting the next token (a token being usually a word, subword, or
punctuation). Throughout this pre-training, GPT models accumulate knowledge about the world,
and can then generate human-like text by repeatedly predicting the next token. Typically, a
subsequent training phase makes the model more truthful, useful and harmless, usually with a
technique called reinforcement learning from human feedback (RLHF). Current GPT models are
still prone to generating falsehoods called "hallucinations", although this can be reduced with
RLHF and quality data. They are used in chatbots, which allow you to ask a question or request
a task in simple text.
Current models and services include: Gemini (formerly
Bard), ChatGPT, Grok, Claude, Copilot and LLaMA.[126] Multimodal GPT models can process
different types of data (modalities) such as images, videos, sound and text.
Specialized hardware and software
Main articles: Programming languages for artificial intelligence and Hardware for artificial
intelligence
In the late 2010s, graphics processing units (GPUs) that were increasingly designed with AI-
specific enhancements and used with specialized TensorFlow software, had replaced previously
used central processing unit (CPUs) as the dominant means for large-scale (commercial and
academic) machine learning models' training. Historically, specialized languages, such
as Lisp, Prolog, Python and others, had been used.
Applications
Ethics
Main article: Ethics of artificial intelligence
AI, like any powerful technology, has potential benefits and potential risks. AI may be able to
advance science and find solutions for serious problems: Demis Hassabis of Deep Mind hopes to
"solve intelligence, and then use that to solve everything else". However, as the use of AI has
become widespread, several unintended consequences and risks have been identified.
Anyone looking to use machine learning as part of real-world, in-production systems needs to
factor ethics into their AI training processes and strive to avoid bias. This is especially true when
using AI algorithms that are inherently unexplainable in deep learning.